The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Phokion G. Kolaitis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Phokion G. Kolaitis, Christos H. Papadimitriou
    Why Not Negation by Fixpoint? [Citation Graph (25, 12)][DBLP]
    PODS, 1988, pp:231-239 [Conf]
  2. Phokion G. Kolaitis
    The Expressive Power of Stratified Programs [Citation Graph (13, 0)][DBLP]
    Inf. Comput., 1991, v:90, n:1, pp:50-66 [Journal]
  3. Phokion G. Kolaitis, Moshe Y. Vardi
    On the Expressive Power of Datalog: Tools and a Case Study. [Citation Graph (9, 14)][DBLP]
    PODS, 1990, pp:61-71 [Conf]
  4. Phokion G. Kolaitis, Christos H. Papadimitriou
    Why not Negation by Fixpoint? [Citation Graph (8, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:1, pp:125-144 [Journal]
  5. Phokion G. Kolaitis, Moshe Y. Vardi
    0-1 Laws for Infinitary Logics (Preliminary Report) [Citation Graph (7, 0)][DBLP]
    LICS, 1990, pp:156-167 [Conf]
  6. Phokion G. Kolaitis, Moshe Y. Vardi
    The Decision Problem for the Probabilities of Higher-Order Properties [Citation Graph (5, 0)][DBLP]
    STOC, 1987, pp:425-435 [Conf]
  7. Phokion G. Kolaitis, Moshe Y. Vardi
    Infinitary Logics and 0-1 Laws [Citation Graph (5, 0)][DBLP]
    Inf. Comput., 1992, v:98, n:2, pp:258-294 [Journal]
  8. Phokion G. Kolaitis, Moshe Y. Vardi
    On the Expressive Power of Datalog: Tools and a Case Study. [Citation Graph (5, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:1, pp:110-134 [Journal]
  9. Phokion G. Kolaitis, Moshe Y. Vardi
    0-1 Laws and Decision Problems for Fragments of Second-Order Logic [Citation Graph (3, 0)][DBLP]
    LICS, 1988, pp:2-11 [Conf]
  10. Phokion G. Kolaitis, Moshe Y. Vardi
    Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory [Citation Graph (3, 0)][DBLP]
    LICS, 1992, pp:46-57 [Conf]
  11. Surajit Chaudhuri, Phokion G. Kolaitis
    Can Datalog be Approximated? [Citation Graph (3, 15)][DBLP]
    PODS, 1994, pp:86-96 [Conf]
  12. Phokion G. Kolaitis, Moshe Y. Vardi
    Conjunctive-Query Containment and Constraint Satisfaction. [Citation Graph (3, 22)][DBLP]
    PODS, 1998, pp:205-213 [Conf]
  13. Phokion G. Kolaitis
    Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report) [Citation Graph (2, 0)][DBLP]
    LICS, 1990, pp:168-180 [Conf]
  14. Phokion G. Kolaitis, Jouko A. Väänänen
    Generalized Quantifiers and Pebble Games on Finite Structures [Citation Graph (2, 0)][DBLP]
    LICS, 1992, pp:348-359 [Conf]
  15. Phokion G. Kolaitis, Moshe Y. Vardi
    0-1 Laws and Decision Problems for Fragments of Second-Order Logic [Citation Graph (2, 0)][DBLP]
    Inf. Comput., 1990, v:87, n:1/2, pp:301-337 [Journal]
  16. Phokion G. Kolaitis, Moshe Y. Vardi
    Infinitary Logic for Computer Science. [Citation Graph (1, 0)][DBLP]
    ICALP, 1992, pp:450-473 [Conf]
  17. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
    How to Define a Linear Order on Finite Models [Citation Graph (1, 0)][DBLP]
    LICS, 1994, pp:40-49 [Conf]
  18. Phokion G. Kolaitis, Moshe Y. Vardi
    On the Expressive Power of Variable-Confined Logics. [Citation Graph (1, 0)][DBLP]
    LICS, 1996, pp:348-359 [Conf]
  19. Phokion G. Kolaitis, Jouko A. Väänänen
    Generalized Quantifiers and Pebble Games on Finite Structures. [Citation Graph (1, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:74, n:1, pp:23-75 [Journal]
  20. Phokion G. Kolaitis, Christos H. Papadimitriou
    Some Computational Aspects of Circumscription [Citation Graph (1, 0)][DBLP]
    J. ACM, 1990, v:37, n:1, pp:1-14 [Journal]
  21. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
    Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:620-626 [Conf]
  22. Phokion G. Kolaitis, Christos H. Papadimitriou
    Some Computational Aspects of Circumscription. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:455-469 [Conf]
  23. Phokion G. Kolaitis, Moshe Y. Vardi
    A Game-Theoretic Approach to Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:175-181 [Conf]
  24. Miki Hermann, Phokion G. Kolaitis
    The Complexity of Counting Problems in Equational Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:560-574 [Conf]
  25. Miki Hermann, Phokion G. Kolaitis
    Unification Algorithms Cannot be Combined in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:246-260 [Conf]
  26. Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
    Integer Programming as a Framework for Optimization and Approximability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:249-259 [Conf]
  27. Phokion G. Kolaitis, Madhukar N. Thakur
    Approximation Properties of NP Minimization Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:353-366 [Conf]
  28. Phokion G. Kolaitis, Madhukar N. Thakur
    Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:31-41 [Conf]
  29. Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi
    Constraint Propagation as a Proof System. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:77-91 [Conf]
  30. Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi
    Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:310-326 [Conf]
  31. Miki Hermann, Phokion G. Kolaitis
    On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:282-296 [Conf]
  32. Phokion G. Kolaitis, Thomas Raffill
    In Search of a Phase Transition in the AC-Matching Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:433-450 [Conf]
  33. Phokion G. Kolaitis, Jonathan Panttaja
    On the Complexity of Existential Pebble Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:314-329 [Conf]
  34. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:664-674 [Conf]
  35. Anuj Dawar, Lauri Hella, Phokion G. Kolaitis
    Implicit Definability and Infinitary Logic in Finite Model Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:624-635 [Conf]
  36. Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
    The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:346-357 [Conf]
  37. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa
    Data Exchange: Semantics and Query Answering. [Citation Graph (0, 0)][DBLP]
    ICDT, 2003, pp:207-224 [Conf]
  38. Phokion G. Kolaitis
    Languages for Polynomial-Time Queries - An Ongoing Quest. [Citation Graph (0, 12)][DBLP]
    ICDT, 1995, pp:38-39 [Conf]
  39. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
    Phase Transitions of PP-Complete Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:183-192 [Conf]
  40. Delbert D. Bailey, Phokion G. Kolaitis
    Phase Transitions of Bounded Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1187-1193 [Conf]
  41. Phokion G. Kolaitis
    Constraint Satisfaction, Databases, and Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1587-1595 [Conf]
  42. Albert Atserias, Phokion G. Kolaitis
    First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:275-284 [Conf]
  43. Lefteris M. Kirousis, Phokion G. Kolaitis
    A Dichotomy in the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:71-80 [Conf]
  44. Phokion G. Kolaitis
    A Tutorial on Finite Model Theory (Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:122- [Conf]
  45. Phokion G. Kolaitis, Martin Otto
    On the Boundedness Problem for Two-Variable First-Order Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:513-524 [Conf]
  46. Phokion G. Kolaitis
    On Asymptotic Probability of Inductive Queries and Their Decision Problem. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:153-166 [Conf]
  47. Miki Hermann, Laurent Juban, Phokion G. Kolaitis
    On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:13-32 [Conf]
  48. Lefteris M. Kirousis, Phokion G. Kolaitis
    On the Complexity of Model Checking and Inference in Minimal Models. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:42-53 [Conf]
  49. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
    Subtractive Reductions and Complete Problems for Counting Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:323-332 [Conf]
  50. Miki Hermann, Phokion G. Kolaitis
    Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:359-370 [Conf]
  51. Phokion G. Kolaitis, Moshe Y. Vardi
    0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:84-98 [Conf]
  52. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
    On Preservation under Homomorphisms and Unions of Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:319-329 [Conf]
  53. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa
    Data exchange: getting to the core. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:90-101 [Conf]
  54. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan
    Composing Schema Mappings: Second-Order Dependencies to the Rescue. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:83-94 [Conf]
  55. Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan
    Peer data exchange. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:160-171 [Conf]
  56. T. S. Jayram, Phokion G. Kolaitis, Erik Vee
    The containment problem for REAL conjunctive queries with inequalities. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:80-89 [Conf]
  57. Phokion G. Kolaitis
    Schema mappings, data exchange, and metadata management. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:61-75 [Conf]
  58. Phokion G. Kolaitis
    Combinatorial Games In Database Theory. [Citation Graph (0, 17)][DBLP]
    PODS, 1995, pp:231-232 [Conf]
  59. Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur
    On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. [Citation Graph (0, 12)][DBLP]
    PODS, 1998, pp:197-204 [Conf]
  60. Phokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan
    The complexity of data exchange. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:30-39 [Conf]
  61. Phokion G. Kolaitis
    Constraint Satisfaction, Complexity, and Logic. [Citation Graph (0, 0)][DBLP]
    SETN, 2004, pp:1-2 [Conf]
  62. Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi
    Panel: logic in the computer science curriculum. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:376-377 [Conf]
  63. Lefteris M. Kirousis, Phokion G. Kolaitis
    The Complexity of Minimal Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:407-418 [Conf]
  64. Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
    Efficient Implementation of Large-Scale Multi-Structural Databases. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:958-969 [Conf]
  65. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
    How to Define a Linear Order on Finite Models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:87, n:3, pp:241-267 [Journal]
  66. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
    Almost everywhere equivalence of logics in finite model theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1996, v:2, n:4, pp:422-443 [Journal]
  67. Erich Grädel, Phokion G. Kolaitis, Moshe Y. Vardi
    On the decision problem for two-variable first-order logic. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1997, v:3, n:1, pp:53-69 [Journal]
  68. Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu
    On the unusual effectiveness of logic in computer science. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2001, v:7, n:2, pp:213-236 [Journal]
  69. Lefteris M. Kirousis, Phokion G. Kolaitis
    The Complexity of Minimal Satisfiability Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:82, pp:- [Journal]
  70. Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
    Preferred representations of Boolean relations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:119, pp:- [Journal]
  71. Miki Hermann, Phokion G. Kolaitis
    Unification Algorithms Cannot Be Combined in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:162, n:1-2, pp:24-42 [Journal]
  72. Lefteris M. Kirousis, Phokion G. Kolaitis
    The complexity of minimal satisfiability problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:1, pp:20-39 [Journal]
  73. Phokion G. Kolaitis, Madhukar N. Thakur
    Logical Definability of NP Optimization Problems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:115, n:2, pp:321-353 [Journal]
  74. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential second-order logic over graphs: Charting the tractability frontier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:312-362 [Journal]
  75. Phokion G. Kolaitis, Victor Vianu
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:1, pp:1- [Journal]
  76. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
    On preservation under homomorphisms and unions of conjunctive queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:2, pp:208-237 [Journal]
  77. Miki Hermann, Phokion G. Kolaitis
    Computational Complexity of Simultaneous Elementary Matching Problems. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1999, v:23, n:2, pp:107-136 [Journal]
  78. Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
    Integer Programming as a Framework for Optimization and Approximability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:2, pp:144-161 [Journal]
  79. Surajit Chaudhuri, Phokion G. Kolaitis
    Can Datalog Be Approximated? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:2, pp:355-369 [Journal]
  80. Phokion G. Kolaitis, Madhukar N. Thakur
    Approximation Properties of NP Minimization Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:391-411 [Journal]
  81. Phokion G. Kolaitis, Moshe Y. Vardi
    Conjunctive-Query Containment and Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:2, pp:302-332 [Journal]
  82. Miki Hermann, Phokion G. Kolaitis
    The Complexity of Counting Problems in Equational Matching. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:3, pp:343-362 [Journal]
  83. Phokion G. Kolaitis
    Recursion in a Quantifier vs. Elementary Induction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:2, pp:235-259 [Journal]
  84. Lefteris M. Kirousis, Phokion G. Kolaitis
    A Dichotomy in the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:6, pp:695-715 [Journal]
  85. 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. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2005, v:34, n:3, pp:87-90 [Journal]
  86. Foto N. Afrati, Phokion G. Kolaitis
    Foreword: Selected Papers from ICDT 1997. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:239, n:2, pp:187- [Journal]
  87. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
    Subtractive reductions and complete problems for counting complexity classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:3, pp:496-513 [Journal]
  88. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa
    Data exchange: semantics and query answering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:336, n:1, pp:89-124 [Journal]
  89. Phokion G. Kolaitis
    LICS 2003 special issue. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:4, pp:674- [Journal]
  90. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa
    Data exchange: getting to the core. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2005, v:30, n:1, pp:174-210 [Journal]
  91. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan
    Composing schema mappings: Second-order dependencies to the rescue. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2005, v:30, n:4, pp:994-1055 [Journal]
  92. Phokion G. Kolaitis, Michael J. Franklin
    Foreword. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2004, v:29, n:, pp:1- [Journal]
  93. Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan
    Peer data exchange. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:4, pp:1454-1498 [Journal]
  94. Phokion G. Kolaitis
    Reflections on Finite Model Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:257-269 [Conf]
  95. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan
    Quasi-inverses of schema mappings. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:123-132 [Conf]
  96. Laura Chiticariu, Mauricio A. Hernández, Lucian Popa, Phokion G. Kolaitis
    Semi-Automatic Schema Integration in Clio. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:1326-1329 [Conf]
  97. Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
    The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  98. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
    Phase transitions of PP-complete satisfiability problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1627-1639 [Journal]

  99. 06401 Abstracts Collection - Complexity of Constraints. [Citation Graph (, )][DBLP]


  100. 06401 Executive Summary - Complexity of Constraints. [Citation Graph (, )][DBLP]


  101. A Logical Approach to Constraint Satisfaction. [Citation Graph (, )][DBLP]


  102. Repair checking in inconsistent databases: algorithms and complexity. [Citation Graph (, )][DBLP]


  103. Structural characterizations of schema-mapping languages. [Citation Graph (, )][DBLP]


  104. Probabilistic data exchange. [Citation Graph (, )][DBLP]


  105. The ACM PODS Alberto O. Mendelzon test-of-time-award 2010. [Citation Graph (, )][DBLP]


  106. Reverse data exchange: coping with nulls. [Citation Graph (, )][DBLP]


  107. Answering aggregate queries in data exchange. [Citation Graph (, )][DBLP]


  108. Towards a theory of schema-mapping optimization. [Citation Graph (, )][DBLP]


  109. The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. [Citation Graph (, )][DBLP]


  110. Characterizing schema mappings via data examples. [Citation Graph (, )][DBLP]


  111. Interactive generation of integrated schemas. [Citation Graph (, )][DBLP]


  112. Random graphs and the parity quantifier. [Citation Graph (, )][DBLP]


  113. Structural characterizations of schema-mapping languages. [Citation Graph (, )][DBLP]


  114. Laconic schema mappings: computing core universal solutions by means of SQL queries [Citation Graph (, )][DBLP]


  115. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. [Citation Graph (, )][DBLP]


  116. Closures and dichotomies for quantified constraints. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002