default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalder ten Cate
Person information
- affiliation: University of Amsterdam, The Netherlands
- affiliation (former): University of California, Santa Cruz, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Balder ten Cate
, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
On the non-efficient PAC learnability of conjunctive queries. Inf. Process. Lett. 183: 106431 (2024)- [j43]Bart Bogaerts, Balder ten Cate, Brett McLean, Jan Van den Bussche:
Preservation theorems for Tarski's relation algebra. Log. Methods Comput. Sci. 20(3) (2024) - [j42]Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. ACM Trans. Comput. Log. 25(2): 12:1-12:27 (2024) - [c58]Balder ten Cate:
Craig Interpolation for Decidable Fragments of First-Order Logic (Invited Talk). CSL 2024: 2:1-2:2 - [c57]Balder ten Cate, Raoul Koudijs, Ana Ozaki:
On the Power and Limitations of Examples for Description Logic Concepts (Extended Abstract). Description Logics 2024 - [c56]Balder ten Cate, Jesse Comer:
Craig Interpolation for Decidable First-Order Fragments. FoSSaCS (2) 2024: 137-159 - [c55]Balder ten Cate, Victor Dalmau, Phokion G. Kolaitis, Wei-Lin Wu:
When Do Homomorphism Counts Help in Query Algorithms? ICDT 2024: 8:1-8:20 - [c54]Balder ten Cate, Víctor Dalmau, Jakub Oprsal:
Right-Adjoints for Datalog Programs. ICDT 2024: 10:1-10:20 - [c53]Balder ten Cate, Raoul Koudijs, Ana Ozaki:
On the Power and Limitations of Examples for Description Logic Concepts. IJCAI 2024: 3567-3575 - 2023
- [j41]Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
Fitting Algorithms for Conjunctive Queries. SIGMOD Rec. 52(4): 6-18 (2023) - [c52]Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
SAT-based PAC Learning of Description Logic Concepts (Extended Abstract). Description Logics 2023 - [c51]Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
SAT-Based PAC Learning of Description Logic Concepts. IJCAI 2023: 3347-3355 - [c50]Balder ten Cate, Victor Dalmau, Maurice Funk, Carsten Lutz:
Extremal Fitting Problems for Conjunctive Queries. PODS 2023: 89-98 - [i27]Balder ten Cate, Víctor Dalmau, Jakub Oprsal:
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. CoRR abs/2302.06366 (2023) - [i26]Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis, Wei-Lin Wu:
When do homomorphism counts help in query algorithms? CoRR abs/2304.06294 (2023) - [i25]Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. CoRR abs/2304.06646 (2023) - [i24]Balder ten Cate, Jesse Comer:
Craig Interpolation for Guarded Fragments. CoRR abs/2304.08086 (2023) - [i23]Bart Bogaerts, Balder ten Cate, Brett McLean, Jan Van den Bussche:
Preservation theorems for Tarski's relation algebra. CoRR abs/2305.04656 (2023) - [i22]Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
SAT-Based PAC Learning of Description Logic Concepts. CoRR abs/2305.08511 (2023) - [i21]Balder ten Cate, Jesse Comer:
Craig Interpolation for Decidable First-Order Fragments. CoRR abs/2310.08689 (2023) - [i20]Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
Extremal Fitting CQs do not Generalize. CoRR abs/2312.03407 (2023) - 2022
- [j40]Balder ten Cate, Victor Dalmau:
Conjunctive Queries: Unique Characterizations and Exact Learnability. ACM Trans. Database Syst. 47(4): 14:1-14:41 (2022) - [c49]Balder ten Cate, Raoul Koudijs, Johan van Benthem:
Local Dependence and Guarding. AiML 2022: 135-154 - [i19]Balder ten Cate, Victor Dalmau, Maurice Funk, Carsten Lutz:
Extremal Fitting Problems for Conjunctive Queries. CoRR abs/2206.05080 (2022) - [i18]Johan van Benthem, Balder ten Cate, Raoul Koudijs:
Local Dependence and Guarding. CoRR abs/2206.06046 (2022) - [i17]Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. CoRR abs/2206.06049 (2022) - [i16]Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
On the non-efficient PAC learnability of acyclic conjunctive queries. CoRR abs/2208.10255 (2022) - 2021
- [j39]Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom:
Inference from Visible Information and Background Knowledge. ACM Trans. Comput. Log. 22(2): 13:1-13:69 (2021) - [c48]Balder ten Cate, Victor Dalmau:
Conjunctive Queries: Unique Characterizations and Exact Learnability. ICDT 2021: 9:1-9:24 - 2020
- [c47]Balder ten Cate:
The Homomorphism Lattice, Unique Characterizations, and Concept Learning. Description Logics 2020 - [i15]Vince Bárány, Michael Benedikt, Balder ten Cate:
Some Model Theory of Guarded Negation. CoRR abs/2005.06299 (2020) - [i14]Balder ten Cate, Victor Dalmau:
Conjunctive Queries: Unique Characterizations and Exact Learnability. CoRR abs/2008.06824 (2020)
2010 – 2019
- 2019
- [c46]Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. ICDT 2019: 13:1-13:18 - [i13]Karan Singhal, Karthik Raman, Balder ten Cate:
Learning Multilingual Word Embeddings Using Image-Text Data. CoRR abs/1905.12260 (2019) - 2018
- [j38]Vince Bárány, Michael Benedikt, Balder ten Cate:
Some Model Theory of Guarded Negation. J. Symb. Log. 83(4): 1307-1344 (2018) - [c45]Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang-Chiew Tan:
Active Learning of GAV Schema Mappings. PODS 2018: 355-368 - 2017
- [j37]Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang-Chiew Tan:
Approximation Algorithms for Schema-Mapping Discovery from Data Examples. ACM Trans. Database Syst. 42(2): 12:1-12:41 (2017) - [j36]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. ACM Trans. Database Syst. 42(4): 22:1-22:35 (2017) - [i12]Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. CoRR abs/1712.08198 (2017) - 2016
- [b1]Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura:
Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2016, ISBN 978-3-031-00728-6 - [j35]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Exchange-Repairs - Managing Inconsistency in Data Exchange. J. Data Semant. 5(2): 77-97 (2016) - [j34]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17(2): 8 (2016) - [j33]Michael Benedikt, Balder ten Cate, Efthymia Tsamoura:
Generating Plans from Proofs. ACM Trans. Database Syst. 40(4): 22:1-22:45 (2016) - [c44]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Practical Query Answering in Data Exchange Under Inconsistency-Tolerant Semantics. EDBT 2016: 233-244 - [c43]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. ICDT 2016: 7:1-7:19 - [c42]Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis:
Querying Visible and Invisible Information. LICS 2016: 297-306 - 2015
- [j32]Vince Bárány, Balder ten Cate, Luc Segoufin:
Guarded Negation. J. ACM 62(3): 22:1-22:26 (2015) - [j31]Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the Data Complexity of Consistent Query Answering. Theory Comput. Syst. 57(4): 843-891 (2015) - [j30]Balder ten Cate, Wang-Chiew Tan:
Foreword: Special Issue on Database Theory. Theory Comput. Syst. 57(4): 1112-1113 (2015) - [c41]Balder ten Cate, Benny Kimelfeld, Dan Olteanu:
PPDL: Probabilistic Programming with Datalog. AMW 2015 - [c40]Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang Chiew Tan:
Approximation Algorithms for Schema-Mapping Discovery from Data Examples. AMW 2015 - [c39]Balder ten Cate, Víctor Dalmau:
The Product Homomorphism Problem and Applications. ICDT 2015: 161-176 - [c38]Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom:
The Complexity of Boundedness for Guarded Logics. LICS 2015: 293-304 - [c37]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Interpolation with Decidable Fixpoint Logics. LICS 2015: 378-389 - [c36]Balder ten Cate, Cristina Civili, Evgeny Sherkhonov, Wang-Chiew Tan:
High-Level Why-Not Explanations using Ontologies. PODS 2015: 31-43 - [c35]Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, Geoffrey Washburn:
Design and Implementation of the LogicBlox System. SIGMOD Conference 2015: 1371-1382 - [e2]Balder ten Cate, Alessandra Mileo:
Web Reasoning and Rule Systems - 9th International Conference, RR 2015, Berlin, Germany, August 4-5, 2015, Proceedings. Lecture Notes in Computer Science 9209, Springer 2015, ISBN 978-3-319-22001-7 [contents] - [i11]Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis:
Querying Visible and Invisible Tables in the Presence of Integrity Constraints. CoRR abs/1509.01683 (2015) - [i10]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Exchange-Repairs: Managing Inconsistency in Data Exchange. CoRR abs/1509.06390 (2015) - 2014
- [j29]Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4): 33:1-33:44 (2014) - [c34]Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective interpolation and preservation in guarded logics. CSL-LICS 2014: 13:1-13:10 - [c33]Michael Benedikt, Balder ten Cate, Efthymia Tsamoura:
Generating low-cost plans from proofs. PODS 2014: 200-211 - [c32]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Exchange-Repairs: Managing Inconsistency in Data Exchange. RR 2014: 140-156 - [p2]Balder ten Cate, Phokion G. Kolaitis:
Schema Mappings: A Case of Logical Dynamics in Database Theory. Johan van Benthem on Logic and Information Dynamics 2014: 67-100 - [i9]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Statistical Modeling with Datalog. CoRR abs/1412.2221 (2014) - [i8]Balder ten Cate, Cristina Civili, Evgeny Sherkhonov, Wang-Chiew Tan:
High-Level Why-Not Explanations using Ontologies. CoRR abs/1412.2332 (2014) - [i7]Michael Benedikt, Carsten Lutz, Balder ten Cate:
Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331). Dagstuhl Reports 4(8): 1-20 (2014) - 2013
- [j28]Luc Segoufin, Balder ten Cate:
Unary negation. Log. Methods Comput. Sci. 9(3) (2013) - [j27]Loredana Afanasiev, Balder ten Cate:
On Core XPath with Inflationary Fixed Points. RAIRO Theor. Informatics Appl. 47(1): 3-23 (2013) - [j26]Balder ten Cate, Enrico Franconi, Inanç Seylan:
Beth Definability in Expressive Description Logics. J. Artif. Intell. Res. 48: 347-414 (2013) - [j25]Serge Abiteboul, Balder ten Cate, Yannis Katsis:
On the equivalence of distributed systems with queries and communication. J. Comput. Syst. Sci. 79(6): 739-762 (2013) - [j24]Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis:
Learning schema mappings. ACM Trans. Database Syst. 38(4): 28 (2013) - [c31]Balder ten Cate, Phokion G. Kolaitis, Walied Othman:
Data exchange with arithmetic operations. EDBT 2013: 537-548 - [c30]Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Schema mappings and data examples. EDBT 2013: 777-780 - [c29]Vince Bárány, Michael Benedikt, Balder ten Cate:
Rewriting Guarded Negation Queries. MFCS 2013: 98-110 - [c28]Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. PODS 2013: 213-224 - [i6]Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP. CoRR abs/1301.6479 (2013) - 2012
- [j23]Amélie Gheerbrant, Balder ten Cate:
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees. Log. Methods Comput. Sci. 8(4) (2012) - [j22]Vince Bárány, Balder ten Cate, Martin Otto:
Queries with Guarded Negation. Proc. VLDB Endow. 5(11): 1328-1339 (2012) - [c27]Balder ten Cate:
Guarded Negation. Advances in Modal Logic 2012: 183-184 - [c26]Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the data complexity of consistent query answering. ICDT 2012: 22-33 - [c25]Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis:
Learning schema mappings. ICDT 2012: 182-195 - [i5]Vince Bárány, Balder ten Cate, Martin Otto:
Queries with Guarded Negation (full version). CoRR abs/1203.0077 (2012) - [i4]Balder ten Cate, Víctor Dalmau:
A note on the product homomorphism problem and CQ-definability. CoRR abs/1212.3534 (2012) - 2011
- [j21]Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth A. Ross:
Foreword. Theory Comput. Syst. 49(2): 365-366 (2011) - [j20]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples. Proc. VLDB Endow. 4(12): 1414-1417 (2011) - [j19]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Characterizing schema mappings via data examples. ACM Trans. Database Syst. 36(4): 23:1-23:48 (2011) - [c24]Vince Bárány, Balder ten Cate, Luc Segoufin:
Guarded Negation. ICALP (2) 2011: 356-367 - [c23]Serge Abiteboul, Balder ten Cate, Yannis Katsis:
On the equivalence of distributed systems with queries and communication. ICDT 2011: 126-137 - [c22]Balder ten Cate, Enrico Franconi, Inanç Seylan:
Beth Definability in Expressive Description Logics. IJCAI 2011: 1099-1106 - [c21]Balder ten Cate, Alessandro Facchini:
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. MFCS 2011: 290-302 - [c20]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Designing and refining schema mappings via data examples. SIGMOD Conference 2011: 133-144 - [c19]Balder ten Cate, Luc Segoufin:
Unary negation. STACS 2011: 344-355 - 2010
- [j18]Balder ten Cate, Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages. Commun. ACM 53(1): 101-110 (2010) - [j17]Balder ten Cate, Luc Segoufin:
Transitive closure logic, nested tree walking automata, and XPath. J. ACM 57(3): 18:1-18:41 (2010) - [j16]Balder ten Cate, Gaëlle Fontaine, Tadeusz Litak:
Some modal aspects of XPath. J. Appl. Non Class. Logics 20(3): 139-171 (2010) - [j15]Balder ten Cate, Tadeusz Litak, Maarten Marx:
Complete axiomatizations for XPath fragments. J. Appl. Log. 8(2): 153-172 (2010) - [c18]Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Database Constraints and Homomorphism Dualities. CP 2010: 475-490 - [c17]Balder ten Cate, Gaëlle Fontaine:
An Easy Completeness Proof for the Modal µ-Calculus on Finite Trees. FoSSaCS 2010: 161-175
2000 – 2009
- 2009
- [j14]Balder ten Cate, David Gabelaia, Dmitry Sustretov:
Modal languages for topology: Expressivity and definability. Ann. Pure Appl. Log. 159(1-2): 146-170 (2009) - [j13]Johan van Benthem, Balder ten Cate, Jouko A. Väänänen:
Lindström theorems for fragments of first-order logic. Log. Methods Comput. Sci. 5(3) (2009) - [j12]Balder ten Cate:
A note on the expressibility problem for modal logics and star-free regular expressions. Inf. Process. Lett. 109(10): 509-513 (2009) - [j11]Balder ten Cate, Carsten Lutz:
The complexity of query containment in expressive fragments of XPath 2.0. J. ACM 56(6): 31:1-31:48 (2009) - [j10]Balder ten Cate, Maarten Marx:
Axiomatizing the Logical Core of XPath 2.0. Theory Comput. Syst. 44(4): 561-589 (2009) - [j9]Balder ten Cate, Laura Chiticariu, Phokion G. Kolaitis, Wang Chiew Tan:
Laconic Schema Mappings: Computing the Core with SQL Queries. Proc. VLDB Endow. 2(1): 1006-1017 (2009) - [c16]Amélie Gheerbrant, Balder ten Cate:
Craig Interpolation for Linear Temporal Languages. CSL 2009: 287-301 - [c15]Loredana Afanasiev, Balder ten Cate:
On Core XPath with Inflationary Fixed Points. FICS 2009: 11-17 - [c14]Balder ten Cate, Gaëlle Fontaine:
An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees. FICS 2009: 30-38 - [c13]Balder ten Cate, Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages. ICDT 2009: 63-72 - [c12]Amélie Gheerbrant, Balder ten Cate:
Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees. LFCS 2009: 180-196 - [i3]Balder ten Cate, Laura Chiticariu, Phokion G. Kolaitis, Wang Chiew Tan:
Laconic schema mappings: computing core universal solutions by means of SQL queries. CoRR abs/0903.1953 (2009) - 2008
- [c11]Balder ten Cate, Luc Segoufin:
XPath, transitive closure logic, and nested tree walking automata. PODS 2008: 251-260 - 2007
- [j8]Balder ten Cate, Maarten Marx:
Navigational XPath: calculus and algebra. SIGMOD Rec. 36(2): 19-26 (2007) - [c10]Balder ten Cate, Maarten Marx:
Axiomatizing the Logical Core of XPath 2.0. ICDT 2007: 134-148 - [c9]Balder ten Cate, Johan van Benthem, Jouko A. Väänänen:
Lindstrom theorems for fragments of first-order logic. LICS 2007: 280-292 - [c8]Balder ten Cate, Carsten Lutz:
The complexity of query containment in expressive fragments of XPath 2.0. PODS 2007: 73-82 - [p1]Carlos Areces, Balder ten Cate:
Hybrid logics. Handbook of Modal Logic 2007: 821-868 - [e1]Balder ten Cate, Henk Zeevat:
Logic, Language, and Computation, 6th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2005, Batumi, Georgia, September 12-16, 2005. Revised Selected Papers. Lecture Notes in Computer Science 4363, Springer 2007, ISBN 978-3-540-75143-4 [contents] - 2006
- [j7]Balder ten Cate:
Expressivity of Second Order Propositional Modal Logic. J. Philos. Log. 35(2): 209-223 (2006) - [j6]Nick Bezhanishvili, Balder ten Cate:
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators. J. Log. Comput. 16(2): 177-197 (2006) - [j5]Patrick Blackburn, Balder ten Cate:
Pure Extensions, Proof Rules, and Hybrid Axiomatics. Stud Logica 84(2): 277-322 (2006) - [j4]Johan van Benthem, Guram Bezhanishvili, Balder ten Cate, Darko Sarenac:
Multimo dal Logics of Products of Topologies. Stud Logica 84(3): 369-392 (2006) - [c7]Balder ten Cate, Willem Conradie, Maarten Marx, Yde Venema:
Definitorially Complete Description Logics. KR 2006: 79-89 - [c6]Balder ten Cate:
The expressivity of XPath with transitive closure. PODS 2006: 328-337 - [c5]Balder ten Cate, Tadeusz Litak:
Topological Perspective on the Hybrid Proof Rules. HyLo@FLoC 2006: 79-94 - 2005
- [j3]Balder ten Cate, Maarten Marx, Jorge Petrucio Viana:
Hybrid logics with Sahlqvist axioms. Log. J. IGPL 13(3): 293-300 (2005) - [j2]Balder ten Cate, Massimo Franceschet:
Guarded Fragments with Constants. J. Log. Lang. Inf. 14(3): 281-288 (2005) - [j1]Balder ten Cate:
Interpolation for extended modal languages. J. Symb. Log. 70(1): 223-234 (2005) - [c4]Balder ten Cate, Massimo Franceschet:
On the Complexity of Hybrid Logics with Binders. CSL 2005: 339-354 - 2002
- [c3]Balder ten Cate:
On the Logic of d-separation. KR 2002: 568-577 - [c2]Balder ten Cate, Chung-chieh Shan:
Question Answering: From Partitions to Prolog. TABLEAUX 2002: 251-265 - [i2]Chung-chieh Shan, Balder ten Cate:
The partition semantics of questions, syntactically. CoRR cs.CL/0209008 (2002) - [i1]Balder ten Cate, Chung-chieh Shan:
Question answering: from partitions to Prolog. CoRR cs.CL/0209009 (2002) - 2001
- [c1]Balder ten Cate:
The dynamics of information exchange dialogues. FGMOL 2001: 322-333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
