default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhokion G. Kolaitis
Person information
- affiliation: University of California, Santa Cruz, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i41]Balder ten Cate, Phokion G. Kolaitis, Carsten Lutz:
Query Repairs. CoRR abs/2501.11162 (2025)- [i40]Guillermo Badia, Phokion G. Kolaitis, Carles Noguera:
Codd's Theorem for Databases over Semirings. CoRR abs/2501.16543 (2025) - 2024
- [j71]Benny Kimelfeld
, Phokion G. Kolaitis:
A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in Databases. Commun. ACM 67(3): 74-83 (2024) - [j70]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
Multi-Structural Games and Beyond. Log. Methods Comput. Sci. 20(4) (2024) - [j69]Albert Atserias, Phokion G. Kolaitis:
Consistency of Relations over Monoids. Proc. ACM Manag. Data 2(2): 107 (2024) - [c124]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 - [c123]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS 2024: 34:1-34:16 - [c122]Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri:
Combining Entity Resolution and Query Answering in Ontologies: A Formal Conceptual Framework. SEBD 2024: 633-642 - [i39]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams:
Parallel Play Saves Quantifiers. CoRR abs/2402.10293 (2024) - [i38]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR abs/2407.00688 (2024) - [i37]Phokion G. Kolaitis, Andreas Pieris:
Characterizing Data Dependencies Then and Now. CoRR abs/2408.01109 (2024) - [i36]Phokion G. Kolaitis, Nina Pardal, Jonni Virtema:
Rewriting Consistent Answers on Annotated Data. CoRR abs/2412.11661 (2024) - 2023
- [j68]Jing Ao, Zehui Cheng, Rada Chirkova, Phokion G. Kolaitis:
Theory and Practice of Relational-to-RDF Temporal Data Exchange and Query Answering. ACM J. Data Inf. Qual. 15(2): 15:1-15:27 (2023) - [c121]Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri:
A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases. KR 2023: 229-239 - [i35]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
A Finer Analysis of Multi-Structural Games and Beyond. CoRR abs/2301.13329 (2023) - [i34]Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri:
A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases. CoRR abs/2303.07469 (2023) - [i33]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) - [i32]Albert Atserias, Phokion G. Kolaitis:
Consistency of Relations over Monoids. CoRR abs/2312.02023 (2023) - 2022
- [j67]Albert Atserias, Phokion G. Kolaitis:
Structure and Complexity of Bag Consistency. SIGMOD Rec. 51(1): 78-85 (2022) - [c120]Akhil A. Dixit, Phokion G. Kolaitis:
Consistent Answers of Aggregation Queries via SAT. ICDE 2022: 924-937 - [i31]Erich Grädel, Phokion G. Kolaitis, Marc Noy:
Logic and Random Discrete Structures (Dagstuhl Seminar 22061). Dagstuhl Reports 12(2): 1-16 (2022) - [i30]Phokion G. Kolaitis, Andrei E. Romashchenko, Milan Studený, Dan Suciu, Tobias Boege:
Algorithmic Aspects of Information Theory (Dagstuhl Seminar 22301). Dagstuhl Reports 12(7): 180-204 (2022) - 2021
- [j66]Zehui Cheng, Phokion G. Kolaitis:
Universal solutions for temporal data exchange. Inf. Comput. 281: 104793 (2021) - [j65]John Livieratos, Phokion G. Kolaitis, Lefteris M. Kirousis:
On the Computational Complexity of Non-Dictatorial Aggregation. J. Artif. Intell. Res. 72: 137-183 (2021) - [j64]Vishal Chakraborty, Theo Delemazure, Benny Kimelfeld, Phokion G. Kolaitis, Kunal Relia, Julia Stoyanovich:
Algorithmic Techniques for Necessary and Possible Winners. Trans. Data Sci. 2(3): 22:1-22:23 (2021) - [j63]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. ACM Trans. Database Syst. 46(3): 12:1-12:39 (2021) - [c119]Shqiponja Ahmetaj, Vasilis Efthymiou, Ronald Fagin, Phokion G. Kolaitis, Chuan Lei, Fatma Özcan, Lucian Popa:
Ontology-Enriched Query Answering on Relational Databases. AAAI 2021: 15247-15254 - [c118]Vishal Chakraborty, Phokion G. Kolaitis:
Classifying the Complexity of the Possible Winner Problem on Partial Chains. AAMAS 2021: 297-305 - [c117]Marco Console, Phokion G. Kolaitis, Andreas Pieris:
Model-theoretic Characterizations of Rule-based Ontologies. Description Logics 2021 - [c116]Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu:
On the Expressive Power of Homomorphism Counts. LICS 2021: 1-13 - [c115]Albert Atserias, Phokion G. Kolaitis:
Structure and Complexity of Bag Consistency. PODS 2021: 247-259 - [c114]Marco Console, Phokion G. Kolaitis, Andreas Pieris:
Model-theoretic Characterizations of Rule-based Ontologies. PODS 2021: 416-428 - [c113]Phokion G. Kolaitis:
Computational Social Choice and Incomplete Information. SEBD 2021: ii - [c112]Akhil A. Dixit, Phokion G. Kolaitis:
CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving. SIGMOD Conference 2021: 2701-2705 - [i29]Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu:
On the Expressive Power of Homomorphism Counts. CoRR abs/2101.12733 (2021) - [i28]Akhil A. Dixit, Phokion G. Kolaitis:
Consistent Answers of Aggregation Queries using SAT Solvers. CoRR abs/2103.03314 (2021) - 2020
- [j62]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
On the Language of Nested Tuple Generating Dependencies. ACM Trans. Database Syst. 45(2): 8:1-8:59 (2020) - [c111]Jing Ao, Zehui Cheng, Rada Chirkova, Phokion G. Kolaitis:
Temporal Enrichment and Querying of Ontology-Compliant Data. ADBIS (Short Papers) 2020: 129-139 - [c110]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Decision Problems in Information Theory. ICALP 2020: 106:1-106:20 - [c109]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. PODS 2020: 95-112 - [c108]Zehui Cheng, Phokion G. Kolaitis:
Universal Solutions in Temporal Data Exchange. TIME 2020: 8:1-8:17 - [i27]Vishal Chakraborty, Phokion G. Kolaitis:
The Complexity of Possible Winners on Partial Chains. CoRR abs/2002.12510 (2020) - [i26]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Decision Problems in Information Theory. CoRR abs/2004.08783 (2020) - [i25]Vishal Chakraborty, Theo Delemazure, Benny Kimelfeld, Phokion G. Kolaitis, Kunal Relia, Julia Stoyanovich:
Algorithmic Techniques for Necessary and Possible Winners. CoRR abs/2005.06779 (2020) - [i24]Albert Atserias, Phokion G. Kolaitis:
Consistency, Acyclicity, and Positive Semirings. CoRR abs/2009.09488 (2020) - [i23]Albert Atserias, Phokion G. Kolaitis:
Structure and Complexity of Bag Consistency. CoRR abs/2012.12126 (2020)
2010 – 2019
- 2019
- [j61]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang-Chiew Tan:
Expressive power of entity-linking frameworks. J. Comput. Syst. Sci. 100: 44-69 (2019) - [j60]Albert Atserias, Phokion G. Kolaitis, Simone Severini:
Generalized satisfiability problems via operator assignments. J. Comput. Syst. Sci. 105: 171-198 (2019) - [j59]Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos:
Aggregation of Votes with Multiple Positions on Each Issue. ACM Trans. Economics and Comput. 7(1): 1:1-1:25 (2019) - [c107]Phokion G. Kolaitis, Lucian Popa, Kun Qian:
Knowledge Refinement via Rule Selection. AAAI 2019: 2886-2894 - [c106]Benny Kimelfeld, Phokion G. Kolaitis, Muhammad Tibi:
Query Evaluation in Election Databases. PODS 2019: 32-46 - [c105]Akhil A. Dixit, Phokion G. Kolaitis:
A SAT-Based System for Consistent Query Answering. SAT 2019: 117-135 - [i22]Phokion G. Kolaitis, Lucian Popa, Kun Qian:
Knowledge Refinement via Rule Selection. CoRR abs/1901.10051 (2019) - [i21]Akhil A. Dixit, Phokion G. Kolaitis:
A SAT-based System for Consistent Query Answering. CoRR abs/1905.02828 (2019) - [i20]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. CoRR abs/1906.09727 (2019) - [i19]Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 19031). Dagstuhl Reports 9(1): 28-46 (2019) - [i18]Michael Benedikt, Kristian Kersting, Phokion G. Kolaitis, Daniel Neider:
Logic and Learning (Dagstuhl Seminar 19361). Dagstuhl Reports 9(9): 1-22 (2019) - 2018
- [j58]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Limits of Schema Mappings. Theory Comput. Syst. 62(4): 899-940 (2018) - [c104]Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos:
On the Computational Complexity of Non-dictatorial Aggregation. RAMiCS 2018: 350-365 - [c103]Benny Kimelfeld, Phokion G. Kolaitis, Julia Stoyanovich:
Computational Social Choice Meets Databases. IJCAI 2018: 317-323 - [c102]Phokion G. Kolaitis:
Reflections on Schema Mappings, Data Exchange, and Metadata Management. PODS 2018: 107-109 - [c101]Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang-Chiew Tan:
Active Learning of GAV Schema Mappings. PODS 2018: 355-368 - [i17]Benny Kimelfeld, Phokion G. Kolaitis, Julia Stoyanovich:
Computational Social Choice Meets Databases. CoRR abs/1805.04156 (2018) - 2017
- [j57]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) - [c100]Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos:
Aggregation of Votes with Multiple Positions on Each Issue. RAMiCS 2017: 209-225 - [c99]Phokion G. Kolaitis:
Schema Mappings: Structural Properties and Limits (Invited Talk). CSL 2017: 2:1-2:1 - [c98]Albert Atserias, Phokion G. Kolaitis, Simone Severini:
Generalized Satisfiability Problems via Operator Assignments. FCT 2017: 56-68 - [c97]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Expressive Power of Entity-Linking Frameworks. ICDT 2017: 10:1-10:18 - [c96]André Hernich, Phokion G. Kolaitis:
Foundations of information integration under bag semantics. LICS 2017: 1-12 - [i16]Albert Atserias, Phokion G. Kolaitis, Simone Severini:
Generalized Satisfiability Problems via Operator Assignments. CoRR abs/1704.01736 (2017) - [i15]Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick:
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). Dagstuhl Reports 7(9): 1-25 (2017) - 2016
- [j56]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Exchange-Repairs - Managing Inconsistency in Data Exchange. J. Data Semant. 5(2): 77-97 (2016) - [j55]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang-Chiew Tan:
A Declarative Framework for Linking Entities. ACM Trans. Database Syst. 41(3): 17:1-17:38 (2016) - [c95]Lauri Hella, Phokion G. Kolaitis:
Dependence Logic vs. Constraint Satisfaction. CSL 2016: 14:1-14:17 - [c94]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Practical Query Answering in Data Exchange Under Inconsistency-Tolerant Semantics. EDBT 2016: 233-244 - [c93]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Limits of Schema Mappings. ICDT 2016: 19:1-19:17 - 2015
- [j54]Avi Wigderson, Phokion G. Kolaitis:
Invited Articles Foreword. J. ACM 62(5): 41:1 (2015) - [j53]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) - [c92]Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang Chiew Tan:
Approximation Algorithms for Schema-Mapping Discovery from Data Examples. AMW 2015 - [c91]Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
A Declarative Framework for Linking Entities. ICDT 2015: 25-43 - [c90]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Dichotomies in the Complexity of Preferred Repairs. PODS 2015: 3-15 - [i14]Foto N. Afrati, Phokion G. Kolaitis, Angelos Vasilakopoulos:
Consistent Answers of Conjunctive Queries on Graphs. CoRR abs/1503.00650 (2015) - [i13]Lefteris M. Kirousis, Phokion G. Kolaitis:
Aggregation of Votes with Multiple Positions on Each Issue. CoRR abs/1505.07737 (2015) - [i12]Balder ten Cate, Richard L. Halpert, Phokion G. Kolaitis:
Exchange-Repairs: Managing Inconsistency in Data Exchange. CoRR abs/1509.06390 (2015) - 2014
- [j52]Benny Kimelfeld, Phokion G. Kolaitis:
The Complexity of Mining Maximal Frequent Subgraphs. ACM Trans. Database Syst. 39(4): 32:1-32:33 (2014) - [c89]Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Nested dependencies: structure and reasoning. PODS 2014: 176-187 - [c88]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 - [e8]Manolis Koubarakis, Giorgos B. Stamou, Giorgos Stoilos, Ian Horrocks, Phokion G. Kolaitis, Georg Lausen, Gerhard Weikum:
Reasoning Web. Reasoning on the Web in the Big Data Era - 10th International Summer School 2014, Athens, Greece, September 8-13, 2014. Proceedings. Lecture Notes in Computer Science 8714, Springer 2014, ISBN 978-3-319-10586-4 [contents] - 2013
- [j51]Phokion G. Kolaitis, Swastik Kopparty:
Random graphs and the parity quantifier. J. ACM 60(5): 37:1-37:34 (2013) - [j50]Phokion G. Kolaitis, Enela Pema, Wang-Chiew Tan:
Efficient Querying of Inconsistent Databases with Binary Integer Programming. Proc. VLDB Endow. 6(6): 397-408 (2013) - [j49]Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis:
Learning schema mappings. ACM Trans. Database Syst. 38(4): 28 (2013) - [c87]Phokion G. Kolaitis:
The Query Containment Problem: Set Semantics vs. Bag Semantics. AMW 2013 - [c86]Balder ten Cate, Phokion G. Kolaitis, Walied Othman:
Data exchange with arithmetic operations. EDBT 2013: 537-548 - [c85]Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Schema mappings and data examples. EDBT 2013: 777-780 - [c84]Samson Abramsky, Georg Gottlob, Phokion G. Kolaitis:
Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. IJCAI 2013: 440-446 - [c83]Benny Kimelfeld, Phokion G. Kolaitis:
The complexity of mining maximal frequent subgraphs. PODS 2013: 13-24 - [c82]Phokion G. Kolaitis, Francesca Spezzano:
The Semantics of Aggregate Queries in Data Exchange Revisited. SUM 2013: 233-246 - [e7]Phokion G. Kolaitis, Maurizio Lenzerini, Nicole Schweikardt:
Data Exchange, Integration, and Streams. Dagstuhl Follow-Ups 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-61-3 [contents] - 2012
- [j48]Phokion G. Kolaitis, Enela Pema:
A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett. 112(3): 77-85 (2012) - [c81]Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis:
On the data complexity of consistent query answering. ICDT 2012: 22-33 - [c80]Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis:
Learning schema mappings. ICDT 2012: 182-195 - [c79]Richard Hull, Phokion G. Kolaitis, Dirk Van Gucht:
The ACM PODS Alberto O. Mendelzon test-of-time award 2012. PODS 2012: 35-36 - [c78]Ronald Fagin, Phokion G. Kolaitis:
Local transformations and conjunctive-query equivalence. PODS 2012: 179-190 - 2011
- [j47]Phokion G. Kolaitis:
The quest for a logic for polynomial-time computation: technical perspective. Commun. ACM 54(6): 103 (2011) - [j46]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. J. ACM 58(4): 15:1-15:55 (2011) - [j45]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) - [j44]Phokion G. Kolaitis, Maurizio Lenzerini, Nicole Schweikardt:
Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar). SIGMOD Rec. 40(1): 40-42 (2011) - [j43]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Reverse data exchange: Coping with nulls. ACM Trans. Database Syst. 36(2): 11:1-11:42 (2011) - [j42]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) - [c77]Enela Pema, Phokion G. Kolaitis, Wang Chiew Tan:
On the tractability and intractability of consistent conjunctive query answering. EDBT/ICDT Ph.D. Workshop 2011: 38-44 - [c76]Phokion G. Kolaitis:
Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). FSTTCS 2011: 25-25 - [c75]Phokion G. Kolaitis:
Schema mappings and data examples. LID 2011: 1 - [c74]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Designing and refining schema mappings via data examples. SIGMOD Conference 2011: 133-144 - [p1]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Schema Mapping Evolution Through Composition and Inversion. Schema Matching and Mapping 2011: 191-222 - 2010
- [j41]Balder ten Cate, Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages. Commun. ACM 53(1): 101-110 (2010) - [c73]Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan:
Database Constraints and Homomorphism Dualities. CP 2010: 475-490 - [c72]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. ICDT 2010: 76-88 - [c71]Jianwen Su, Phokion G. Kolaitis:
The ACM PODS Alberto O. Mendelzon test-of-time-award 2010. PODS 2010: 39-40 - [c70]Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan:
Characterizing schema mappings via data examples. PODS 2010: 261-272
2000 – 2009
- 2009
- [j40]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) - [j39]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. SIAM J. Comput. 38(6): 2330-2355 (2009) - [c69]Foto N. Afrati, Phokion G. Kolaitis:
Repair checking in inconsistent databases: algorithms and complexity. ICDT 2009: 31-41 - [c68]Balder ten Cate, Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages. ICDT 2009: 63-72 - [c67]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Reverse data exchange: coping with nulls. PODS 2009: 23-32 - [c66]Catriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou:
The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. PODS 2009: 43 - [c65]Phokion G. Kolaitis, Swastik Kopparty:
Random graphs and the parity quantifier. STOC 2009: 705-714 - [e6]Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009. Dagstuhl Seminar Proceedings 09441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i11]Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - [i10]Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - [i9]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) - [i8]Phokion G. Kolaitis, Swastik Kopparty:
Random Graphs and the Parity Quantifier. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j38]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini:
Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7): 1103-1115 (2008) - [j37]Henry F. Korth, Philip A. Bernstein, Mary F. Fernández, Le Gruenwald, Phokion G. Kolaitis, Kathryn S. McKinley, M. Tamer Özsu:
Paper and proposal reviews: is the process flawed? SIGMOD Rec. 37(3): 36-39 (2008) - [j36]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Quasi-inverses of schema mappings. ACM Trans. Database Syst. 33(2): 11:1-11:52 (2008) - [c64]Phokion G. Kolaitis, Moshe Y. Vardi:
A Logical Approach to Constraint Satisfaction. Complexity of Constraints 2008: 125-155 - [c63]Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa:
Towards a theory of schema-mapping optimization. PODS 2008: 33-42 - [c62]Foto N. Afrati, Phokion G. Kolaitis:
Answering aggregate queries in data exchange. PODS 2008: 129-138 - [c61]Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa:
Interactive generation of integrated schemas. SIGMOD Conference 2008: 833-846 - [e5]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5250, Springer 2008, ISBN 978-3-540-92799-0 [contents] - 2007
- [b1]Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein:
Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-00428-8, pp. 1-437 - [j35]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis:
Phase transitions of PP-complete satisfiability problems. Discret. Appl. Math. 155(12): 1627-1639 (2007) - [c60]Phokion G. Kolaitis:
Reflections on Finite Model Theory. LICS 2007: 257-269 - [c59]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Quasi-inverses of schema mappings. PODS 2007: 123-132 - [c58]Laura Chiticariu, Mauricio A. Hernández, Phokion G. Kolaitis, Lucian Popa:
Semi-Automatic Schema Integration in Clio. VLDB 2007: 1326-1329 - 2006
- [j34]Albert Atserias, Anuj Dawar, Phokion G. Kolaitis:
On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2): 208-237 (2006) - [j33]Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan:
Peer data exchange. ACM Trans. Database Syst. 31(4): 1454-1498 (2006) - [c57]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. ICALP (1) 2006: 346-357 - [c56]Phokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan:
The complexity of data exchange. PODS 2006: 30-39 - [c55]T. S. Jayram, Phokion G. Kolaitis, Erik Vee:
The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89 - [e4]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
Complexity of Constraints, 01.10. - 06.10.2006. Dagstuhl Seminar Proceedings 06401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i7]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006 - [i6]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006 - [i5]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. CoRR abs/cs/0609072 (2006) - [i4]Tomás Feder, Phokion G. Kolaitis:
Closures and dichotomies for quantified constraints. Electron. Colloquium Comput. Complex. TR06 (2006) - [i3]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j32]Leopoldo E. Bertossi, Jan Chomicki, Parke Godfrey, Phokion G. Kolaitis, Alex Thomo, Calisto Zuzarte:
Exchange, integration, and consistency of data: report on the ARISE/NISR workshop. SIGMOD Rec. 34(3): 87-90 (2005) - [j31]Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa:
Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1): 89-124 (2005) - [j30]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005) - [j29]Phokion G. Kolaitis:
LICS 2003 special issue. ACM Trans. Comput. Log. 6(4): 674 (2005) - [j28]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:
Data exchange: getting to the core. ACM Trans. Database Syst. 30(1): 174-210 (2005) - [j27]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst. 30(4): 994-1055 (2005) - [c54]Phokion G. Kolaitis:
Schema mappings, data exchange, and metadata management. PODS 2005: 61-75 - [c53]Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan:
Peer data exchange. PODS 2005: 160-171 - [c52]Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins:
Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB 2005: 958-969 - [i2]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini:
Preferred representations of Boolean relations. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j26]Phokion G. Kolaitis, Victor Vianu:
Foreword. J. ACM 51(1): 1 (2004) - [j25]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick:
Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004) - [j24]Lefteris M. Kirousis, Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37(6): 695-715 (2004) - [j23]Phokion G. Kolaitis, Michael J. Franklin:
Foreword. ACM Trans. Database Syst. 29: 1 (2004) - [c51]Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi:
Constraint Propagation as a Proof System. CP 2004: 77-91 - [c50]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Composing Schema Mappings: Second-Order Dependencies to the Rescue. PODS 2004: 83-94 - [c49]Albert Atserias, Anuj Dawar, Phokion G. Kolaitis:
On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS 2004: 319-329 - [c48]Phokion G. Kolaitis:
Constraint Satisfaction, Complexity, and Logic. SETN 2004: 1-2 - 2003
- [j22]Lefteris M. Kirousis, Phokion G. Kolaitis:
The complexity of minimal satisfiability problems. Inf. Comput. 187(1): 20-39 (2003) - [c47]Phokion G. Kolaitis, Jonathan Panttaja:
On the Complexity of Existential Pebble Games. CSL 2003: 314-329 - [c46]Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa:
Data Exchange: Semantics and Query Answering. ICDT 2003: 207-224 - [c45]Delbert D. Bailey, Phokion G. Kolaitis:
Phase Transitions of Bounded Satisfiability Problems. IJCAI 2003: 1187-1193 - [c44]Phokion G. Kolaitis:
Constraint Satisfaction, Databases, and Logic. IJCAI 2003: 1587-1595 - [c43]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:
Data exchange: getting to the core. PODS 2003: 90-101 - 2002
- [c42]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis:
Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. AAAI/IAAI 2002: 620-626 - [c41]Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi:
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP 2002: 310-326 - [e3]Lucian Popa, Serge Abiteboul, Phokion G. Kolaitis:
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA. ACM 2002, ISBN 1-58113-507-6 [contents] - 2001
- [j21]Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu:
On the unusual effectiveness of logic in computer science. Bull. Symb. Log. 7(2): 213-236 (2001) - [c40]Phokion G. Kolaitis, Thomas Raffill:
In Search of a Phase Transition in the AC-Matching Problem. CP 2001: 433-450 - [c39]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis:
Phase Transitions of PP-Complete Satisfiability Problems. IJCAI 2001: 183-192 - [c38]Lefteris M. Kirousis, Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80 - [c37]Lefteris M. Kirousis, Phokion G. Kolaitis:
On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001: 42-53 - [c36]Lefteris M. Kirousis, Phokion G. Kolaitis:
The Complexity of Minimal Satisfiability Problems. STACS 2001: 407-418 - 2000
- [j20]Miki Hermann, Phokion G. Kolaitis:
Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162(1-2): 24-42 (2000) - [j19]Phokion G. Kolaitis, Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2): 302-332 (2000) - [j18]Foto N. Afrati, Phokion G. Kolaitis:
Foreword: Selected Papers from ICDT 1997. Theor. Comput. Sci. 239(2): 187 (2000) - [c35]Phokion G. Kolaitis, Moshe Y. Vardi:
A Game-Theoretic Approach to Constraint Satisfaction. AAAI/IAAI 2000: 175-181 - [c34]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick:
Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674 - [c33]Phokion G. Kolaitis, Moshe Y. Vardi:
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. MFCS 2000: 84-98 - [c32]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332 - [i1]Lefteris M. Kirousis, Phokion G. Kolaitis:
The Complexity of Minimal Satisfiability Problems. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j17]Miki Hermann, Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems. J. Autom. Reason. 23(2): 107-136 (1999) - [c31]Albert Atserias, Phokion G. Kolaitis:
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. LICS 1999: 275-284 - [c30]Miki Hermann, Laurent Juban, Phokion G. Kolaitis:
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR 1999: 13-32 - 1998
- [j16]Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability. J. Comput. Syst. Sci. 57(2): 144-161 (1998) - [c29]Phokion G. Kolaitis, Martin Otto:
On the Boundedness Problem for Two-Variable First-Order Logic. LICS 1998: 513-524 - [c28]Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur:
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. PODS 1998: 197-204 - [c27]Phokion G. Kolaitis, Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction. PODS 1998: 205-213 - [c26]Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi:
Panel: logic in the computer science curriculum. SIGCSE 1998: 376-377 - 1997
- [j15]Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto:
How to Define a Linear Order on Finite Models. Ann. Pure Appl. Log. 87(3): 241-267 (1997) - [j14]Erich Grädel, Phokion G. Kolaitis, Moshe Y. Vardi:
On the decision problem for two-variable first-order logic. Bull. Symb. Log. 3(1): 53-69 (1997) - [j13]Surajit Chaudhuri, Phokion G. Kolaitis:
Can Datalog Be Approximated? J. Comput. Syst. Sci. 55(2): 355-369 (1997) - [c25]Miki Hermann, Phokion G. Kolaitis:
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP 1997: 282-296 - [e2]Foto N. Afrati, Phokion G. Kolaitis:
Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings. Lecture Notes in Computer Science 1186, Springer 1997, ISBN 3-540-62222-5 [contents] - 1996
- [j12]Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto:
Almost everywhere equivalence of logics in finite model theory. Bull. Symb. Log. 2(4): 422-443 (1996) - [c24]Miki Hermann, Phokion G. Kolaitis:
Unification Algorithms Cannot be Combined in Polynomial Time. CADE 1996: 246-260 - [c23]Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability. CCC 1996: 249-259 - [c22]Phokion G. Kolaitis, Moshe Y. Vardi:
On the Expressive Power of Variable-Confined Logics. LICS 1996: 348-359 - [e1]Neil Immerman, Phokion G. Kolaitis:
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, DIMACS/AMS 1996, ISBN 978-0-8218-0517-6 [contents] - 1995
- [j11]Phokion G. Kolaitis, Jouko A. Väänänen:
Generalized Quantifiers and Pebble Games on Finite Structures. Ann. Pure Appl. Log. 74(1): 23-75 (1995) - [j10]Phokion G. Kolaitis, Madhukar N. Thakur:
Approximation Properties of NP Minimization Classes. J. Comput. Syst. Sci. 50(3): 391-411 (1995) - [j9]Phokion G. Kolaitis, Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study. J. Comput. Syst. Sci. 51(1): 110-134 (1995) - [j8]Miki Hermann, Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching. J. Symb. Comput. 20(3): 343-362 (1995) - [c21]Anuj Dawar, Lauri Hella, Phokion G. Kolaitis:
Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995: 624-635 - [c20]Phokion G. Kolaitis:
Languages for Polynomial-Time Queries - An Ongoing Quest. ICDT 1995: 38-39 - [c19]Miki Hermann, Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). MFCS 1995: 359-370 - [c18]Phokion G. Kolaitis:
Combinatorial Games In Database Theory. PODS 1995: 231-232 - 1994
- [j7]Phokion G. Kolaitis, Madhukar N. Thakur:
Logical Definability of NP Optimization Problems. Inf. Comput. 115(2): 321-353 (1994) - [c17]Miki Hermann, Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching. CADE 1994: 560-574 - [c16]Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto:
How to Define a Linear Order on Finite Models. LICS 1994: 40-49 - [c15]Surajit Chaudhuri, Phokion G. Kolaitis:
Can Datalog be Approximated? PODS 1994: 86-96 - 1993
- [c14]Phokion G. Kolaitis, Madhukar N. Thakur:
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). SCT 1993: 31-41 - [c13]Phokion G. Kolaitis:
A Tutorial on Finite Model Theory (Abstract). LICS 1993: 122 - 1992
- [j6]Phokion G. Kolaitis, Moshe Y. Vardi:
Infinitary Logics and 0-1 Laws. Inf. Comput. 98(2): 258-294 (1992) - [c12]Phokion G. Kolaitis, Moshe Y. Vardi:
Infinitary Logic for Computer Science. ICALP 1992: 450-473 - [c11]Phokion G. Kolaitis, Moshe Y. Vardi:
Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory. LICS 1992: 46-57 - [c10]Phokion G. Kolaitis, Jouko A. Väänänen:
Generalized Quantifiers and Pebble Games on Finite Structures. LICS 1992: 348-359 - 1991
- [j5]Phokion G. Kolaitis:
The Expressive Power of Stratified Programs. Inf. Comput. 90(1): 50-66 (1991) - [j4]Phokion G. Kolaitis, Christos H. Papadimitriou:
Why not Negation by Fixpoint? J. Comput. Syst. Sci. 43(1): 125-144 (1991) - [c9]Phokion G. Kolaitis, Madhukar N. Thakur:
Approximation Properties of NP Minimization Classes. SCT 1991: 353-366 - 1990
- [j3]Phokion G. Kolaitis, Moshe Y. Vardi:
0-1 Laws and Decision Problems for Fragments of Second-Order Logic. Inf. Comput. 87(1/2): 301-337 (1990) - [j2]Phokion G. Kolaitis, Christos H. Papadimitriou:
Some Computational Aspects of Circumscription. J. ACM 37(1): 1-14 (1990) - [c8]Phokion G. Kolaitis, Moshe Y. Vardi:
0-1 Laws for Infinitary Logics (Preliminary Report). LICS 1990: 156-167 - [c7]Phokion G. Kolaitis:
Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report). LICS 1990: 168-180 - [c6]Phokion G. Kolaitis, Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study. PODS 1990: 61-71
1980 – 1989
- 1988
- [c5]Phokion G. Kolaitis, Christos H. Papadimitriou:
Some Computational Aspects of Circumscription. AAAI 1988: 455-469 - [c4]Phokion G. Kolaitis, Moshe Y. Vardi:
0-1 Laws and Decision Problems for Fragments of Second-Order Logic. LICS 1988: 2-11 - [c3]Phokion G. Kolaitis, Christos H. Papadimitriou:
Why Not Negation by Fixpoint? PODS 1988: 231-239 - 1987
- [c2]Phokion G. Kolaitis, Moshe Y. Vardi:
The Decision Problem for the Probabilities of Higher-Order Properties. STOC 1987: 425-435 - 1985
- [c1]Phokion G. Kolaitis:
On Asymptotic Probability of Inductive Queries and Their Decision Problem. Logic of Programs 1985: 153-166
1970 – 1979
- 1979
- [j1]Phokion G. Kolaitis:
Recursion in a Quantifier vs. Elementary Induction. J. Symb. Log. 44(2): 235-259 (1979)
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 2025-02-27 22:45 CET 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:
