 | 2010 |
|---|
| 136 |       | Solmaz Kolahi,
Leonid Libkin:
An information-theoretic analysis of worst-case redundancy in database design.
ACM Trans. Database Syst. 35(1): (2010) |
| 2009 |
|---|
| 135 | | Leonid Libkin,
Cristina Sirangelo:
Open and Closed World Assumptions in Data Exchange.
Description Logics 2009 |
| 134 | | Pablo Barceló,
Leonid Libkin,
Antonella Poggi,
Cristina Sirangelo:
XML with incomplete information: models, properties, and query answering.
PODS 2009: 237-246 |
| 133 | | Shun'ichi Amano,
Leonid Libkin,
Filip Murlak:
XML schema mappings.
PODS 2009: 33-42 |
| 132 | | Leonid Libkin:
The finite model theory toolbox of a database theoretician.
PODS 2009: 65-76 |
| 131 | | Leonid Libkin:
Expressive Power of Query Languages.
Encyclopedia of Database Systems 2009: 1081-1083 |
| 130 | | Anthony Widjaja To,
Leonid Libkin:
Algorithmic metatheorems for decidable LTL model checking over infinite systems
CoRR abs/0910.4932: (2009) |
| 129 | | Leonid Libkin,
Victor Vianu:
Introduction to PODS 2007 special section.
J. ACM 56(6): (2009) |
| 2008 |
|---|
| 128 | | Anthony Widjaja To,
Leonid Libkin:
Recurrent Reachability Analysis in Regular Model Checking.
LPAR 2008: 198-213 |
| 127 | | Leonid Libkin,
Cristina Sirangelo:
Reasoning about XML with Temporal Logics and Automata.
LPAR 2008: 97-112 |
| 126 | | Leonid Libkin,
Cristina Sirangelo:
Data exchange and schema mappings in open and closed worlds.
PODS 2008: 139-148 |
| 125 | | Leonid Libkin:
Introduction to the PODS 2007 special section.
ACM Trans. Database Syst. 33(4): (2008) |
| 124 | | Marcelo Arenas,
Pablo Barceló,
Leonid Libkin:
Game-based notions of locality over finite models.
Ann. Pure Appl. Logic 152(1-3): 3-30 (2008) |
| 123 | | Rajeev Alur,
Marcelo Arenas,
Pablo Barceló,
Kousha Etessami,
Neil Immerman,
Leonid Libkin:
First-Order and Temporal Logics for Nested Words
CoRR abs/0811.0537: (2008) |
| 122 | | Marcelo Arenas,
Leonid Libkin:
XML data exchange: Consistency and query answering.
J. ACM 55(2): (2008) |
| 121 | | Rajeev Alur,
Marcelo Arenas,
Pablo Barceló,
Kousha Etessami,
Neil Immerman,
Leonid Libkin:
First-Order and Temporal Logics for Nested Words.
Logical Methods in Computer Science 4(4): (2008) |
| 120 | | Marcelo Arenas,
Wenfei Fan,
Leonid Libkin:
On the Complexity of Verifying Consistency of XML Specifications.
SIAM J. Comput. 38(3): 841-880 (2008) |
| 2007 |
|---|
| 119 |  | Leonid Libkin:
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China
ACM 2007 |
| 118 | | Marcelo Arenas,
Pablo Barceló,
Leonid Libkin:
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization.
ICALP 2007: 888-900 |
| 117 | | Marcelo Arenas,
Pablo Barceló,
Leonid Libkin:
Combining Temporal Logics for Querying XML Documents.
ICDT 2007: 359-373 |
| 116 | | Rajeev Alur,
Marcelo Arenas,
Pablo Barceló,
Kousha Etessami,
Neil Immerman,
Leonid Libkin:
First-Order and Temporal Logics for Nested Words.
LICS 2007: 151-160 |
| 115 | | Solmaz Kolahi,
Leonid Libkin:
XML design for relational storage.
WWW 2007: 1083-1092 |
| 114 | | Leonid Libkin:
Normalization Theory for XML.
XSym 2007: 1-13 |
| 113 | | Michael Benedikt,
Leonid Libkin,
Frank Neven:
Logical definability and query languages over ranked and unranked trees.
ACM Trans. Comput. Log. 8(2): (2007) |
| 112 | | Thomas Eiter,
Leonid Libkin:
Preface.
Theor. Comput. Sci. 371(3): 147 (2007) |
| 2006 |
|---|
| 111 | | Solmaz Kolahi,
Leonid Libkin:
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF.
PODS 2006: 114-123 |
| 110 | | Leonid Libkin:
Data exchange and incomplete information.
PODS 2006: 60-69 |
| 109 | | Thomas Eiter,
Leonid Libkin:
Introduction to special ICDT section.
ACM Trans. Database Syst. 31(3): 769 (2006) |
| 108 | | Leonid Libkin:
Logics for Unranked Trees: An Overview
CoRR abs/cs/0606062: (2006) |
| 107 | | Leonid Libkin:
Locality of Queries and Transformations.
Electr. Notes Theor. Comput. Sci. 143: 115-127 (2006) |
| 106 | | Leonid Libkin:
Logics for Unranked Trees: An Overview.
Logical Methods in Computer Science 2(3): (2006) |
| 2005 |
|---|
| 105 | | Thomas Eiter,
Leonid Libkin:
Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings
Springer 2005 |
| 104 | | Leonid Libkin:
Logics for Unranked Trees: An Overview.
ICALP 2005: 35-50 |
| 103 | | Marcelo Arenas,
Wenfei Fan,
Leonid Libkin:
Consistency of XML Specifications.
Inconsistency Tolerance 2005: 15-41 |
| 102 | | Pablo Barceló,
Leonid Libkin:
Temporal Logics over Unranked Trees.
LICS 2005: 31-40 |
| 101 | | Marcelo Arenas,
Leonid Libkin:
XML data exchange: consistency and query answering.
PODS 2005: 13-24 |
| 100 | | Marcelo Arenas,
Leonid Libkin:
An information-theoretic approach to normal forms for relational and XML data.
J. ACM 52(2): 246-283 (2005) |
| 2004 |
|---|
| 99 | | Leonid Libkin:
Elements of Finite Model Theory
Springer 2004 |
| 98 | | Marcelo Arenas,
Pablo Barceló,
Leonid Libkin:
Game-Based Notions of Locality Over Finite Models.
CSL 2004: 175-189 |
| 97 | | Denilson Barbosa,
Alberto O. Mendelzon,
Leonid Libkin,
Laurent Mignet,
Marcelo Arenas:
Efficient Incremental Validation of XML Documents.
ICDE 2004: 671-682 |
| 96 | | Marcelo Arenas,
Pablo Barceló,
Ronald Fagin,
Leonid Libkin:
Locally Consistent Transformations and Query Answering in Data Exchange.
PODS 2004: 229-240 |
| 95 | | Marcelo Arenas,
Leonid Libkin:
A normal form for XML documents.
ACM Trans. Database Syst. 29: 195-232 (2004) |
| 2003 |
|---|
| 94 | | Leonid Libkin,
Frank Neven:
Logical Definability and Query Languages over Unranked Trees.
LICS 2003: 178-187 |
| 93 | | Marcelo Arenas,
Leonid Libkin:
An information-theoretic approach to normal forms for relational and XML data.
PODS 2003: 15-26 |
| 92 | | Leonid Libkin:
Variable independence for first-order definable constraints.
ACM Trans. Comput. Log. 4(4): 431-451 (2003) |
| 91 | | Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Incremental recomputation in local languages.
Inf. Comput. 181(2): 88-98 (2003) |
| 90 | | Leonid Libkin:
A collapse result for constraint queries over structures of small degree.
Inf. Process. Lett. 86(5): 277-281 (2003) |
| 89 | | Michael Benedikt,
Leonid Libkin,
Thomas Schwentick,
Luc Segoufin:
Definable relations and first-order query languages over strings.
J. ACM 50(5): 694-751 (2003) |
| 88 | | Michael Benedikt,
Martin Grohe,
Leonid Libkin,
Luc Segoufin:
Reachability and connectivity queries in constraint databases.
J. Comput. Syst. Sci. 66(1): 169-206 (2003) |
| 87 | | Leonid Libkin:
Expressive power of SQL.
Theor. Comput. Sci. 296(3): 379-404 (2003) |
| 2002 |
|---|
| 86 | | Marcelo Arenas,
Wenfei Fan,
Leonid Libkin:
What's Hard about XML Schema Constraints?
DEXA 2002: 269-278 |
| 85 | | Michael Benedikt,
Leonid Libkin:
Tree Extension Algebras: Logics, Automata, and Query Languages.
LICS 2002: 203- |
| 84 | | Marcelo Arenas,
Wenfei Fan,
Leonid Libkin:
On Verifying Consistency of XML Specifications.
PODS 2002: 259-270 |
| 83 | | Marcelo Arenas,
Leonid Libkin:
A Normal Form for XML Documents.
PODS 2002: 85-96 |
| 82 | | Martín Abadi,
Leonid Libkin,
Frank Pfenning:
Editorial.
ACM Trans. Comput. Log. 3(3): 335-335 (2002) |
| 81 | | Wenfei Fan,
Leonid Libkin:
On XML integrity constraints in the presence of DTDs.
J. ACM 49(3): 368-406 (2002) |
| 80 | | Michael Benedikt,
Leonid Libkin:
Aggregate Operators in Constraint Query Languages.
J. Comput. Syst. Sci. 64(3): 628-654 (2002) |
| 79 | | Leonid Libkin,
Limsoon Wong:
Lower bounds for invariant queries in logics with counting.
Theor. Comput. Sci. 288(1): 153-180 (2002) |
| 2001 |
|---|
| 78 | | Leonid Libkin:
Expressive Power of SQL.
ICDT 2001: 1-21 |
| 77 | | Michael Benedikt,
Leonid Libkin,
Thomas Schwentick,
Luc Segoufin:
A Model-Theoretic Approach to Regular String Relations.
LICS 2001: 431- |
| 76 | | Wenfei Fan,
Leonid Libkin:
On XML Integrity Constraints in the Presence of DTDs.
PODS 2001 |
| 75 | | Michael Benedikt,
Leonid Libkin,
Thomas Schwentick,
Luc Segoufin:
String Operations in Query Languages.
PODS 2001 |
| 74 | | Leonid Libkin:
Logics capturing local properties.
ACM Trans. Comput. Log. 2(1): 135-153 (2001) |
| 73 | | Stavros S. Cosmadakis,
Gabriel M. Kuper,
Leonid Libkin:
On the orthographic dimension of definable sets.
Inf. Process. Lett. 79(3): 141-145 (2001) |
| 72 | | Lauri Hella,
Leonid Libkin,
Juha Nurmonen,
Limsoon Wong:
Logics with aggregate operators.
J. ACM 48(4): 880-907 (2001) |
| 71 | | Kenneth A. Ross,
Stefano Ceri,
Luis Gravano,
Per-Åke Larson,
Leonid Libkin,
Tova Milo:
Reminiscences on Influential Papers.
SIGMOD Record 30(1): 55-57 (2001) |
| 2000 |
|---|
| 70 | | Gabriel M. Kuper,
Leonid Libkin,
Jan Paredaens:
Constraint Databases
Springer 2000 |
| 69 | | Gabriel M. Kuper,
Leonid Libkin,
Jan Paredaens:
Introduction.
Constraint Databases 2000: 1-16 |
| 68 | | Michael Benedikt,
Leonid Libkin:
Query Safety with Constraints.
Constraint Databases 2000: 109-129 |
| 67 | | Jan Chomicki,
Leonid Libkin:
Aggregate Languages for Constraint Databases.
Constraint Databases 2000: 131-154 |
| 66 | | Michael Benedikt,
Leonid Libkin:
Expressive Power: The Finite Case.
Constraint Databases 2000: 55-87 |
| 65 | | Leonid Libkin:
Variable Independence, Quantifier Elimination, and Constraint Representations.
ICALP 2000: 260-271 |
| 64 | | Michael Benedikt,
Martin Grohe,
Leonid Libkin,
Luc Segoufin:
Reachability and Connectivity Queries in Constraint Databases.
PODS 2000: 104-115 |
| 63 | | Leonid Libkin:
Logics Capturing Local Properties.
STACS 2000: 217-229 |
| 62 | | Leonid Libkin:
Logics with counting and local properties.
ACM Trans. Comput. Log. 1(1): 33-59 (2000) |
| 61 | | Michael Benedikt,
Leonid Libkin:
Relational queries over interpreted structures.
J. ACM 47(4): 644-680 (2000) |
| 60 | | Michael Benedikt,
Leonid Libkin:
Safe Constraint Queries.
SIAM J. Comput. 29(5): 1652-1682 (2000) |
| 59 | | Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Local properties of query languages.
Theor. Comput. Sci. 239(2): 277-308 (2000) |
| 1999 |
|---|
| 58 | | Leonid Libkin,
Limsoon Wong:
On the Power of Incremental Evaluation in SQL-Like Languages.
DBPL 1999: 17-30 |
| 57 | | Leonid Libkin:
Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries.
LICS 1999: 316-325 |
| 56 | | Lauri Hella,
Leonid Libkin,
Juha Nurmonen,
Limsoon Wong:
Logics with Aggregate Operators.
LICS 1999: 35-44 |
| 55 | | Michael Benedikt,
Leonid Libkin:
Exact and Approximate Aggregation in Constraint Query.
PODS 1999: 102-113 |
| 54 | | Leonid Libkin:
What you can and cannot say in SQL or proving folk theorems in database theory.
Proc. 15èmes Journées Bases de Données Avancées, BDA 1999: 425 |
| 53 | | Lauri Hella,
Leonid Libkin,
Juha Nurmonen:
Notions of Locality and Their Logical Characterizations over Finite Models.
J. Symb. Log. 64(4): 1751-1773 (1999) |
| 52 | | Leonid Libkin:
Query languages with arithmetic and constraint databases.
SIGACT News 30(4): 41-50 (1999) |
| 51 | | Leonid Libkin:
Some Remarks on Variable Independence, Closure, and Orthographic Dimension in Constraint Databases.
SIGMOD Record 28(4): 24-28 (1999) |
| 50 | | Leonid Libkin:
Database Principles Column - Introduction.
SIGMOD Record 28(4): 29 (1999) |
| 1998 |
|---|
| 49 | | Leonid Libkin,
Bernhard Thalheim:
Semantics in Databases, Selected Papers from a Workshop, Prague, Czech Republic, 1995
Springer 1998 |
| 48 | | Leonid Libkin:
On Counting Logics and Local Properties.
LICS 1998: 501-512 |
| 47 | | Michael Benedikt,
Leonid Libkin:
Safe Constraint Queries.
PODS 1998: 99-108 |
| 46 | | Leonid Libkin,
Limsoon Wong:
Unary Quantifiers, Transitive Closure, and Relations of Large Degree.
STACS 1998: 183-193 |
| 45 | | Michael Benedikt,
Timothy Griffin,
Leonid Libkin:
Verifiable Properties of Database Transactions.
Inf. Comput. 147(1): 57-88 (1998) |
| 44 | | Michael Benedikt,
Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Relational Expressive Power of Constraint Query Languages.
J. ACM 45(1): 1-34 (1998) |
| 43 | | Leonid Libkin:
Models of Approximation in Databases.
Theor. Comput. Sci. 190(2): 167-210 (1998) |
| 1997 |
|---|
| 42 | | Leonid Libkin,
Limsoon Wong:
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions.
DBPL 1997: 222-238 |
| 41 | | Leonid Libkin,
Limsoon Wong:
On the Power of Aggregation in Relational Query Languages.
DBPL 1997: 260-280 |
| 40 | | Leonid Libkin,
Juha Nurmonen:
Counting and Locality over Finite Structures: A Survey.
ESSLLI 1997: 18-50 |
| 39 | | Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Local Properties of Query Languages.
ICDT 1997: 140-154 |
| 38 | | Latha S. Colby,
Leonid Libkin:
Tractable Iteration Mechanisms for Bag Languages.
ICDT 1997: 461-475 |
| 37 | | Leonid Libkin:
On the Forms of Locality over Finite Models.
LICS 1997: 204-215 |
| 36 | | Michael Benedikt,
Leonid Libkin:
Languages for Relational Databases over Interpreted Structures.
PODS 1997: 87-98 |
| 35 | | Timothy Griffin,
Leonid Libkin,
Howard Trickey:
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions.
IEEE Trans. Knowl. Data Eng. 9(3): 508-511 (1997) |
| 34 | | Leonid Libkin,
Limsoon Wong:
Query Languages for Bags and Aggregate Functions.
J. Comput. Syst. Sci. 55(2): 241-272 (1997) |
| 1996 |
|---|
| 33 | | Michael Benedikt,
Leonid Libkin:
On the Structure of Queries in Constraint Query Languages.
LICS 1996: 25-34 |
| 32 | | Michael Benedikt,
Timothy Griffin,
Leonid Libkin:
Verifiable Properties of Database Transactions.
PODS 1996: 117-127 |
| 31 | | Michael Benedikt,
Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Relational Expressive Power of Constraint Query Languages.
PODS 1996: 5-16 |
| 30 | | Leonid Libkin,
Rona Machlin,
Limsoon Wong:
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques.
SIGMOD Conference 1996: 228-239 |
| 29 | | Latha S. Colby,
Timothy Griffin,
Leonid Libkin,
Inderpal Singh Mumick,
Howard Trickey:
Algorithms for Deferred View Maintenance.
SIGMOD Conference 1996: 469-480 |
| 28 | | Leonid Libkin,
Limsoon Wong:
Semantic Representations and Query Labguages for Or-Sets.
J. Comput. Syst. Sci. 52(1): 125-142 (1996) |
| 27 | | Stéphane Grumbach,
Leonid Libkin,
Tova Milo,
Limsoon Wong:
Query languages for bags: expressive power and complexity.
SIGACT News 27(2): 30-44 (1996) |
| 1995 |
|---|
| 26 | | Leonid Libkin:
Query Language Primitives for Programming with Incomplete Databases.
DBPL 1995: 6 |
| 25 | | Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL.
DBPL 1995: 7 |
| 24 | | Leonid Libkin:
Approximation in Databases.
ICDT 1995: 411-424 |
| 23 | | Leonid Libkin:
Normalizing Incomplete Databases.
PODS 1995: 219-230 |
| 22 | | Timothy Griffin,
Leonid Libkin:
Incremental Maintenance of Views with Duplicates.
SIGMOD Conference 1995: 328-339 |
| 21 | | Leonid Libkin:
A Semantics-based Approach to Design of Query Languages for Partial Information.
Semantics in Databases 1995: 170-208 |
| 20 | | Elsa L. Gunter,
Leonid Libkin:
Interfacing HOL90 with a Functional Database Query Language.
TPHOLs 1995: 170-185 |
| 19 | | Leonid Libkin,
Vladimir Gurvich:
Trees as semilattices.
Discrete Mathematics 145(1-3): 321-327 (1995) |
| 18 | | Leonid Libkin,
Limsoon Wong:
On Representation and Querying Incomplete Information in Databases with Bags.
Inf. Process. Lett. 56(4): 209-214 (1995) |
| 1994 |
|---|
| 17 | | Elsa L. Gunter,
Leonid Libkin:
OR-SML: A Functional Database Programming Language for Disjunctive Information and Its Applications.
DEXA 1994: 641-650 |
| 16 | | Leonid Libkin,
Limsoon Wong:
New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions.
PODS 1994: 155-166 |
| 15 | | Leonid Libkin,
Limsoon Wong:
Conservativity of Nested Relational Calculi with Internal Generic Functions.
Inf. Process. Lett. 49(6): 273-280 (1994) |
| 14 | | Peter Buneman,
Leonid Libkin,
Dan Suciu,
Val Tannen,
Limsoon Wong:
Comprehension Syntax.
SIGMOD Record 23(1): 87-96 (1994) |
| 1993 |
|---|
| 13 | | Leonid Libkin,
Limsoon Wong:
Aggregate Functions, Conservative Extensions, and Linear Orders.
DBPL 1993: 282-294 |
| 12 | | Leonid Libkin,
Limsoon Wong:
Some Properties of Query Languages for Bags.
DBPL 1993: 97-114 |
| 11 | | Leonid Libkin,
Limsoon Wong:
Semantic Representations and Query Languages for Or-sets.
PODS 1993: 37-48 |
| 10 | | Leonid Libkin:
Direct product decompositions of lattices, closures and relation schemes.
Discrete Mathematics 112(1-3): 119-138 (1993) |
| 1992 |
|---|
| 9 | | János Demetrovics,
G. Hencsey,
Leonid Libkin,
Ilya B. Muchnik:
On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Database.
Acta Cybern. 10(3): 129-140 (1992) |
| 8 | | János Demetrovics,
G. Hencsey,
Leonid Libkin,
Ilya B. Muchnik:
Normal Form Relation Schemes: A New Characterization.
Acta Cybern. 10(3): 141-164 (1992) |
| 7 | | Leonid Libkin:
An elementary proof that upper and lower powerdomain constructions commute.
Bulletin of the EATCS 48: 175-177 (1992) |
| 6 | | János Demetrovics,
Leonid Libkin,
Ilya B. Muchnik:
Functional Dependencies in Relational Databases: A Lattice Point of View.
Discrete Applied Mathematics 40(2): 155-185 (1992) |
| 1991 |
|---|
| 5 | | Leonid Libkin:
A Relational Algebra for Complex Objects Based on Partial Information.
MFDBS 1991: 29-43 |
| 4 | | Achim Jung,
Leonid Libkin,
Hermann Puhlmann:
Decomposition of Domains.
MFPS 1991: 235-258 |
| 3 | | Joachim Biskup,
János Demetrovics,
Leonid Libkin,
Ilya B. Muchnik:
On Relational Database Schemes Having Unique Minimal Key.
Elektronische Informationsverarbeitung und Kybernetik 27(4): 217-225 (1991) |
| 1990 |
|---|
| 2 | | Georg Gottlob,
Leonid Libkin:
Investigation on Armstrong relations, dependency inference, and excluded functional dependencies.
Acta Cybern. 9(4): 385-402 (1990) |
| 1989 |
|---|
| 1 | | János Demetrovics,
Leonid Libkin,
Ilya B. Muchnik:
Functional Dependencies and the Semilattice of Closed Classes.
MFDBS 1989: 136-147 |
