2013
162Graph Logics with Rational Relations. Pablo Barceló, Diego Figueira, Leonid Libkin. CoRR (abs/1304.4150) (2013). Web SearchBibTeXDownload
161Querying graph databases with XPath. Leonid Libkin, Wim Martens, Domagoj Vrgoc. ICDT 2013, 129-140. Web SearchBibTeXDownload
160Containment of pattern-based queries over data trees. Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens. ICDT 2013, 201-212. Web SearchBibTeXDownload
159On the aggregation problem for synthesized Web services. Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu. J. Comput. Syst. Sci. (79): 873-891 (2013). Web SearchBibTeXDownload
158Parameterized regular expressions and their languages. Pablo Barceló, Juan L. Reutter, Leonid Libkin. Theor. Comput. Sci. (474): 21-45 (2013). Web SearchBibTeXDownload
2012
157Efficient reasoning about data trees via integer linear programming. Claire David, Leonid Libkin, Tony Tan. ACM Trans. Database Syst. (37): 19 (2012). Web SearchBibTeXDownload
156Expressive Languages for Path Queries over Graph-Structured Data. Pablo Barceló, Leonid Libkin, Anthony Widjaja Lin, Peter T. Wood. ACM Trans. Database Syst. (37): 31 (2012). Web SearchBibTeXDownload
155On Low Treewidth Approximations of Conjunctive Queries. Pablo Barceló, Leonid Libkin, Miguel Romero. AMW 2012, 91-101. Web SearchBibTeXDownload
154Tractable XML data exchange via relations. Rada Chirkova, Leonid Libkin, Juan L. Reutter. Frontiers of Computer Science (6): 243-263 (2012). Web SearchBibTeXDownload
153Regular path queries on graphs with data. Leonid Libkin, Domagoj Vrgoc. ICDT 2012, 74-85. Web SearchBibTeXDownload
152On the complexity of query answering over incomplete XML documents. Amélie Gheerbrant, Leonid Libkin, Tony Tan. ICDT 2012, 169-181. Web SearchBibTeXDownload
151Graph Logics with Rational Relations and the Generalized Intersection Problem. Pablo Barceló, Diego Figueira, Leonid Libkin. LICS 2012, 115-124. Web SearchBibTeXDownload
150Regular Expressions for Data Words. Leonid Libkin, Domagoj Vrgoc. LPAR 2012, 274-288. Web SearchBibTeXDownload
149Efficient approximations of conjunctive queries. Pablo Barceló, Leonid Libkin, Miguel Romero. PODS 2012, 249-260. Web SearchBibTeXDownload
2011
148Closed world data exchange. André Hernich, Leonid Libkin, Nicole Schweikardt. ACM Trans. Database Syst. (36): 14 (2011). Web SearchBibTeXDownload
147A Direct Translation from XPath to Nondeterministic Automata. Nadime Francis, Claire David, Leonid Libkin. AMW 2011. Web SearchBibTeXDownload
146Tractable XML data exchange via relations. Rada Chirkova, Leonid Libkin, Juan L. Reutter. CIKM 2011, 1629-1638. Web SearchBibTeXDownload
145Parameterized Regular Expressions and their Languages. Pablo Barceló, Leonid Libkin, Juan L. Reutter. CoRR (abs/1107.0577) (2011). Web SearchBibTeXDownload
144Parameterized Regular Expressions and Their Languages. Pablo Barceló, Leonid Libkin, Juan L. Reutter. FSTTCS 2011, 351-362. Web SearchBibTeXDownload
143Efficient reasoning about data trees via integer linear programming. Claire David, Leonid Libkin, Tony Tan. ICDT 2011, 18-29. Web SearchBibTeXDownload
142Data exchange and schema mappings in open and closed worlds. Leonid Libkin, Cristina Sirangelo. J. Comput. Syst. Sci. (77): 542-571 (2011). Cited by 7Web SearchBibTeXDownload
141Incomplete information and certain answers in general data models. Leonid Libkin. PODS 2011, 59-70. Web SearchBibTeXDownload
140Querying graph patterns. Pablo Barceló, Leonid Libkin, Juan L. Reutter. PODS 2011, 199-210. Web SearchBibTeXDownload
139Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. Marcelo Arenas, Pablo Barceló, Leonid Libkin. Theory Comput. Syst. (49): 639-670 (2011). Cited by 6Web SearchBibTeXDownload
2010
138An information-theoretic analysis of worst-case redundancy in database design. Solmaz Kolahi, Leonid Libkin. ACM Trans. Database Syst. (35) (2010). Web SearchBibTeXDownload
137On Incomplete XML Documents with Integrity Constraints. Pablo Barceló, Leonid Libkin, Juan L. Reutter. AMW 2010. Web SearchBibTeXDownload
136Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. Anthony Widjaja To, Leonid Libkin. FOSSACS 2010, 221-236. Web SearchBibTeXDownload
135On the aggregation problem for synthesized web services. Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu. ICDT 2010, 242-251. Web SearchBibTeXDownload
134On the tradeoff between mapping and querying power in XML data exchange. Shun'ichi Amano, Claire David, Leonid Libkin, Filip Murlak. ICDT 2010, 155-164. Web SearchBibTeXDownload
133Disjoint pattern matching and implication in strings. Leonid Libkin, Cristina Sirangelo. Inf. Process. Lett. (110): 143-147 (2010). Web SearchBibTeXDownload
132XML with incomplete information. Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo. J. ACM (58): 4 (2010). Web SearchBibTeXDownload
131Reasoning about XML with temporal logics and automata. Leonid Libkin, Cristina Sirangelo. J. Applied Logic (8): 210-232 (2010). Web SearchBibTeXDownload
130On the Satisfiability of Two-Variable Logic over Data Words. Claire David, Leonid Libkin, Tony Tan. LPAR (Yogyakarta) 2010, 248-262. Web SearchBibTeXDownload
129Expressive languages for path queries over graph-structured data. Pablo Barceló, Carlos A. Hurtado, Leonid Libkin, Peter T. Wood. PODS 2010, 3-14. Web SearchBibTeXDownload
128Certain answers for XML queries. Claire David, Leonid Libkin, Filip Murlak. PODS 2010, 191-202. Web SearchBibTeXDownload
127Relational and XML Data Exchange. Marcelo Arenas, Pablo Barceló, Leonid Libkin, Filip Murlak. Relational and XML Data Exchange 2010. Web SearchBibTeXDownload
2009
126Algorithmic metatheorems for decidable LTL model checking over infinite systems. Anthony Widjaja To, Leonid Libkin. CoRR (abs/0910.4932) (2009). Web SearchBibTeXDownload
125Open and Closed World Assumptions in Data Exchange. Leonid Libkin, Cristina Sirangelo. Description Logics 2009. Web SearchBibTeXDownload
124Expressive Power of Query Languages. Leonid Libkin, Victor Vianu. Encyclopedia of Database Systems 2009, 1081-1083. Cited by 3Web SearchBibTeXDownload
123Introduction to PODS 2007 special section. Leonid Libkin, Victor Vianu. J. ACM (56) (2009). Web SearchBibTeXDownload
122XML with incomplete information: models, properties, and query answering. Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo. PODS 2009, 237-246. Web SearchBibTeXDownload
121XML schema mappings. Shun'ichi Amano, Leonid Libkin, Filip Murlak. PODS 2009, 33-42. Cited by 3Web SearchBibTeXDownload
120The finite model theory toolbox of a database theoretician. Leonid Libkin. PODS 2009, 65-76. Web SearchBibTeXDownload
2008
119Introduction to the PODS 2007 special section. Leonid Libkin. ACM Trans. Database Syst. (33) (2008). Web SearchBibTeXDownload
118Game-based notions of locality over finite models. Marcelo Arenas, Pablo Barceló, Leonid Libkin. Ann. Pure Appl. Logic (152): 3-30 (2008). Cited by 3Web SearchBibTeXDownload
117XML data exchange: Consistency and query answering. Marcelo Arenas, Leonid Libkin. J. ACM (55) (2008). Cited by 99Web SearchBibTeXDownload
116First-Order and Temporal Logics for Nested Words. Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin. Logical Methods in Computer Science (4) (2008). Cited by 21Web SearchBibTeXDownload
115Recurrent Reachability Analysis in Regular Model Checking. Anthony Widjaja To, Leonid Libkin. LPAR 2008, 198-213. Cited by 3Web SearchBibTeXDownload
114Reasoning about XML with Temporal Logics and Automata. Leonid Libkin, Cristina Sirangelo. LPAR 2008, 97-112. Cited by 9Web SearchBibTeXDownload
113Data exchange and schema mappings in open and closed worlds. Leonid Libkin, Cristina Sirangelo. PODS 2008, 139-148. Cited by 7Web SearchBibTeXDownload
112On the Complexity of Verifying Consistency of XML Specifications. Marcelo Arenas, Wenfei Fan, Leonid Libkin. SIAM J. Comput. (38): 841-880 (2008). Web SearchBibTeXDownload
2007
111Logical definability and query languages over ranked and unranked trees. Michael Benedikt, Leonid Libkin, Frank Neven. ACM Trans. Comput. Log. (8) (2007). Cited by 8Web SearchBibTeXDownload
110Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. Marcelo Arenas, Pablo Barceló, Leonid Libkin. ICALP 2007, 888-900. Cited by 6Web SearchBibTeXDownload
109Combining Temporal Logics for Querying XML Documents. Marcelo Arenas, Pablo Barceló, Leonid Libkin. ICDT 2007, 359-373. Cited by 7Web SearchBibTeXDownload
108First-Order and Temporal Logics for Nested Words. Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin. LICS 2007, 151-160. Cited by 21Web SearchBibTeXDownload
107XML design for relational storage. Solmaz Kolahi, Leonid Libkin. WWW 2007, 1083-1092. Cited by 3Web SearchBibTeXDownload
106Normalization Theory for XML. Leonid Libkin. XSym 2007, 1-13. Cited by 2Web SearchBibTeXDownload
2006
105Introduction to special ICDT section. Thomas Eiter, Leonid Libkin. ACM Trans. Database Syst. (31): 769 (2006). Web SearchBibTeXDownload
104Embedded Finite Models. Leonid Libkin. Bulletin of the EATCS (90): 134-149 (2006). Web SearchBibTeX
103Locality of Queries and Transformations. Marcelo Arenas. Electr. Notes Theor. Comput. Sci. (143): 115-127 (2006). Cited by 2Web SearchBibTeXDownload
102Logics for Unranked Trees: An Overview. Leonid Libkin. Logical Methods in Computer Science (2) (2006). Cited by 31Web SearchBibTeXDownload
101On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. Solmaz Kolahi, Leonid Libkin. PODS 2006, 114-123. Cited by 10Web SearchBibTeXDownload
100Data exchange and incomplete information. Leonid Libkin. PODS 2006, 60-69. Cited by 33Web SearchBibTeXDownload
2005
99Logics for Unranked Trees: An Overview. Leonid Libkin. ICALP 2005, 35-50. Cited by 31Web SearchBibTeXDownload
98Consistency of XML Specifications. Marcelo Arenas, Wenfei Fan, Leonid Libkin. Inconsistency Tolerance 2005, 15-41. Cited by 3Web SearchBibTeXDownload
97An information-theoretic approach to normal forms for relational and XML data. Marcelo Arenas, Leonid Libkin. J. ACM (52): 246-283 (2005). Cited by 92Web SearchBibTeXDownload
96Temporal Logics over Unranked Trees. Pablo Barceló, Leonid Libkin. LICS 2005, 31-40. Cited by 30Web SearchBibTeXDownload
95XML data exchange: consistency and query answering. Marcelo Arenas, Leonid Libkin. PODS 2005, 13-24. Web SearchBibTeXDownload
2004
94A normal form for XML documents. Marcelo Arenas, Leonid Libkin. ACM Trans. Database Syst. (29): 195-232 (2004). Cited by 328Web SearchBibTeXDownload
93Game-Based Notions of Locality Over Finite Models. Marcelo Arenas, Pablo Barceló, Leonid Libkin. CSL 2004, 175-189. Web SearchBibTeXDownload
92Efficient Incremental Validation of XML Documents. Denilson Barbosa, Alberto O. Mendelzon, Leonid Libkin, Laurent Mignet, Marcelo Arenas. ICDE 2004, 671-682. Cited by 63Web SearchBibTeXDownload
91Locally Consistent Transformations and Query Answering in Data Exchange. Marcelo Arenas, Pablo Barceló, Ronald Fagin, Leonid Libkin. PODS 2004, 229-240. Cited by 40Web SearchBibTeXDownload
2003
90Variable independence for first-order definable constraints. Leonid Libkin. ACM Trans. Comput. Log. (4): 431-451 (2003). Cited by 5Web SearchBibTeXDownload
89Incremental recomputation in local languages. Guozhu Dong, Leonid Libkin, Limsoon Wong. Inf. Comput. (181): 88-98 (2003). Cited by 5Web SearchBibTeXDownload
88A collapse result for constraint queries over structures of small degree. Leonid Libkin. Inf. Process. Lett. (86): 277-281 (2003). Cited by 3Web SearchBibTeXDownload
87Definable relations and first-order query languages over strings. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. J. ACM (50): 694-751 (2003). Cited by 23Web SearchBibTeXDownload
86Reachability and connectivity queries in constraint databases. Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin. J. Comput. Syst. Sci. (66): 169-206 (2003). Web SearchBibTeXDownload
85Logical Definability and Query Languages over Unranked Trees. Leonid Libkin, Frank Neven. LICS 2003, 178-187. Cited by 6Web SearchBibTeXDownload
84An information-theoretic approach to normal forms for relational and XML data. Marcelo Arenas, Leonid Libkin. PODS 2003, 15-26. Cited by 92Web SearchBibTeXDownload
83Expressive power of SQL. Leonid Libkin. Theor. Comput. Sci. (296): 379-404 (2003). Cited by 34Web SearchBibTeXDownload
2002
82What's Hard about XML Schema Constraints?. Marcelo Arenas, Wenfei Fan, Leonid Libkin. DEXA 2002, 269-278. Cited by 41Web SearchBibTeXDownload
81On XML integrity constraints in the presence of DTDs. Wenfei Fan, Leonid Libkin. J. ACM (49): 368-406 (2002). Cited by 235Web SearchBibTeXDownload
80Aggregate Operators in Constraint Query Languages. Michael Benedikt, Leonid Libkin. J. Comput. Syst. Sci. (64): 628-654 (2002). Cited by 6Web SearchBibTeXDownload
79Tree Extension Algebras: Logics, Automata, and Query Languages. Michael Benedikt, Leonid Libkin. LICS 2002, 203. Cited by 13Web SearchBibTeXDownload
78On Verifying Consistency of XML Specifications. Marcelo Arenas, Wenfei Fan, Leonid Libkin. PODS 2002, 259-270. Cited by 84Web SearchBibTeXDownload
77A Normal Form for XML Documents. Marcelo Arenas, Leonid Libkin. PODS 2002, 85-96. Cited by 2Web SearchBibTeXDownload
76Lower bounds for invariant queries in logics with counting. Leonid Libkin, Limsoon Wong. Theor. Comput. Sci. (288): 153-180 (2002). Cited by 8Web SearchBibTeXDownload
2001
75Logics capturing local properties. Leonid Libkin. ACM Trans. Comput. Log. (2): 135-153 (2001). Cited by 8Web SearchBibTeXDownload
74Expressive Power of SQL. Leonid Libkin. ICDT 2001, 1-21. Web SearchBibTeXDownload
73On the orthographic dimension of definable sets. Stavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin. Inf. Process. Lett. (79): 141-145 (2001). Cited by 3Web SearchBibTeXDownload
72Logics with aggregate operators. Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong. J. ACM (48): 880-907 (2001). Cited by 36Web SearchBibTeXDownload
71A Model-Theoretic Approach to Regular String Relations. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. LICS 2001, 431-440. Cited by 21Web SearchBibTeXDownload
70String Operations in Query Languages. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. PODS 2001. Cited by 12Web SearchBibTeXDownload
69On XML Integrity Constraints in the Presence of DTDs. Wenfei Fan, Leonid Libkin. PODS 2001. Cited by 2Web SearchBibTeXDownload
68Reminiscences on Influential Papers. Kenneth A. Ross, Amr El Abbadi, Sophie Cluet, Kaladhar Voruganti, Guy M. Lohman, Moshe Y. Vardi, Gultekin Özsoyoglu, Gerhard Weikum, Philip S. Yu, Timos K. Sellis, Patrick Valduriez. SIGMOD Record (30): 90-91 (2001). Web SearchBibTeXDownload
2000
67Logics with counting and local properties. Leonid Libkin. ACM Trans. Comput. Log. (1): 33-59 (2000). Cited by 17Web SearchBibTeXDownload
66Expressive Power: The Finite Case. Michael Benedikt, Leonid Libkin. Constraint Databases 2000, 55-87. Cited by 13Web SearchBibTeX
65Aggregate Languages for Constraint Databases. Jan Chomicki, Leonid Libkin. Constraint Databases 2000, 131-154. Cited by 4Web SearchBibTeX
64Query Safety with Constraints. Michael Benedikt, Leonid Libkin. Constraint Databases 2000, 109-129. Web SearchBibTeX
63Variable Independence, Quantifier Elimination, and Constraint Representations. Leonid Libkin. ICALP 2000, 260-271. Cited by 6Web SearchBibTeXDownload
62Relational queries over interpreted structures. Michael Benedikt, Leonid Libkin. J. ACM (47): 644-680 (2000). Cited by 30Web SearchBibTeXDownload
61Reachability and Connectivity Queries in Constraint Databases. Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin. PODS 2000, 104-115. Cited by 29Web SearchBibTeXDownload
60Safe Constraint Queries. Michael Benedikt, Leonid Libkin. SIAM J. Comput. (29): 1652-1682 (2000). Cited by 50Web SearchBibTeXDownload
59Logics Capturing Local Properties. Leonid Libkin. STACS 2000, 217-229. Web SearchBibTeXDownload
58Local properties of query languages. Guozhu Dong, Leonid Libkin, Limsoon Wong. Theor. Comput. Sci. (239): 277-308 (2000). Cited by 52Web SearchBibTeXDownload
1999
57On the Power of Incremental Evaluation in SQL-Like Languages. Leonid Libkin, Limsoon Wong. DBPL 1999, 17-30. Cited by 8Web SearchBibTeXDownload
56Notions of Locality and Their Logical Characterizations over Finite Models. Lauri Hella, Leonid Libkin, Juha Nurmonen. J. Symb. Log. (64): 1751-1773 (1999). Cited by 39Web SearchBibTeXDownload
55Logics with Aggregate Operators. Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong. LICS 1999, 35-44. Web SearchBibTeXDownload
54Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. Leonid Libkin. LICS 1999, 316-325. Cited by 5Web SearchBibTeXDownload
53Exact and Approximate Aggregation in Constraint Query. Michael Benedikt, Leonid Libkin. PODS 1999, 102-113. Cited by 16Web SearchBibTeXDownload
52What you can and cannot say in SQL or proving folk theorems in database theory. Leonid Libkin. Proc. 15èmes Journées Bases de Données Avancées, BDA 1999, 425. Web SearchBibTeX
51Query languages with arithmetic and constraint databases. Leonid Libkin. SIGACT News (30): 41-50 (1999). Web SearchBibTeXDownload
50Some Remarks on Variable Independence, Closure, and Orthographic Dimension in Constraint Databases. Leonid Libkin. SIGMOD Record (28): 24-28 (1999). Cited by 4Web SearchBibTeXDownload
49Database Principles Column - Introduction. Leonid Libkin. SIGMOD Record (28): 29 (1999). Web SearchBibTeXDownload
1998
48Verifiable Properties of Database Transactions. Michael Benedikt, Timothy Griffin, Leonid Libkin. Inf. Comput. (147): 57-88 (1998). Cited by 31Web SearchBibTeXDownload
47Relational Expressive Power of Constraint Query Languages. Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong. J. ACM (45): 1-34 (1998). Cited by 166Web SearchBibTeXDownload
46On Counting Logics and Local Properties. Leonid Libkin. LICS 1998, 501-512. Cited by 22Web SearchBibTeXDownload
45Safe Constraint Queries. Michael Benedikt, Leonid Libkin. PODS 1998, 99-108. Cited by 50Web SearchBibTeXDownload
44Unary Quantifiers, Transitive Closure, and Relations of Large Degree. Leonid Libkin, Limsoon Wong. STACS 1998, 183-193. Cited by 14Web SearchBibTeXDownload
43Models of Approximation in Databases. Leonid Libkin. Theor. Comput. Sci. (190): 167-210 (1998). Cited by 2Web SearchBibTeXDownload
1997
42Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions. Leonid Libkin, Limsoon Wong. DBPL 1997, 222-238. Cited by 20Web SearchBibTeXDownload
41On the Power of Aggregation in Relational Query Languages. Leonid Libkin, Limsoon Wong. DBPL 1997, 260-280. Cited by 21Web SearchBibTeXDownload
40Counting and Locality over Finite Structures: A Survey. Leonid Libkin, Juha Nurmonen. ESSLLI 1997, 18-50. Cited by 5Web SearchBibTeXDownload
39Local Properties of Query Languages. Guozhu Dong, Leonid Libkin, Limsoon Wong. ICDT 1997, 140-154. Web SearchBibTeXDownload
38Tractable Iteration Mechanisms for Bag Languages. Latha S. Colby, Leonid Libkin. ICDT 1997, 461-475. Cited by 5Web SearchBibTeXDownload
37An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions. Timothy Griffin, Leonid Libkin, Howard Trickey. IEEE Trans. Knowl. Data Eng. (9): 508-511 (1997). Cited by 33Web SearchBibTeXDownload
36Query Languages for Bags and Aggregate Functions. Leonid Libkin, Limsoon Wong. J. Comput. Syst. Sci. (55): 241-272 (1997). Cited by 84Web SearchBibTeXDownload
35On the Forms of Locality over Finite Models. Leonid Libkin. LICS 1997, 204-215. Cited by 34Web SearchBibTeXDownload
34Languages for Relational Databases over Interpreted Structures. Michael Benedikt, Leonid Libkin. PODS 1997, 87-98. Cited by 41Web SearchBibTeXDownload
1996
33Semantic Representations and Query Labguages for Or-Sets. Leonid Libkin, Limsoon Wong. J. Comput. Syst. Sci. (52): 125-142 (1996). Web SearchBibTeXDownload
32On the Structure of Queries in Constraint Query Languages. Michael Benedikt, Leonid Libkin. LICS 1996, 25-34. Cited by 54Web SearchBibTeXDownload
31Relational Expressive Power of Constraint Query Languages. Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong. PODS 1996, 5-16. Cited by 166Web SearchBibTeXDownload
30Verifiable Properties of Database Transactions. Michael Benedikt, Timothy Griffin, Leonid Libkin. PODS 1996, 117-127. Cited by 31Web SearchBibTeXDownload
29Query languages for bags: expressive power and complexity. Stéphane Grumbach, Leonid Libkin, Tova Milo, Limsoon Wong. SIGACT News (27): 30-44 (1996). Web SearchBibTeXDownload
28A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques. Leonid Libkin, Rona Machlin, Limsoon Wong. SIGMOD Conference 1996, 228-239. Cited by 96Web SearchBibTeXDownload
27Algorithms for Deferred View Maintenance. Latha S. Colby, Timothy Griffin, Leonid Libkin, Inderpal Singh Mumick, Howard Trickey. SIGMOD Conference 1996, 469-480. Cited by 196Web SearchBibTeXDownload
1995
26On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL. Guozhu Dong, Leonid Libkin, Limsoon Wong. DBPL 1995, 7. Cited by 18Web SearchBibTeX
25Query Language Primitives for Programming with Incomplete Databases. Leonid Libkin. DBPL 1995, 6. Web SearchBibTeX
24Trees as semilattices. Leonid Libkin, Vladimir Gurvich. Discrete Mathematics (145): 321-327 (1995). Cited by 4Web SearchBibTeXDownload
23Approximation in Databases. Leonid Libkin. ICDT 1995, 411-424. Cited by 20Web SearchBibTeXDownload
22On Representation and Querying Incomplete Information in Databases with Bags. Leonid Libkin, Limsoon Wong. Inf. Process. Lett. (56): 209-214 (1995). Cited by 18Web SearchBibTeXDownload
21Normalizing Incomplete Databases. Leonid Libkin. PODS 1995, 219-230. Cited by 24Web SearchBibTeXDownload
20A Semantics-based Approach to Design of Query Languages for Partial Information. Leonid Libkin. Semantics in Databases 1995, 170-208. Cited by 10Web SearchBibTeXDownload
19Incremental Maintenance of Views with Duplicates. Timothy Griffin, Leonid Libkin. SIGMOD Conference 1995, 328-339. Cited by 260Web SearchBibTeXDownload
18Interfacing HOL90 with a Functional Database Query Language. Elsa L. Gunter, Leonid Libkin. TPHOLs 1995, 170-185. Cited by 1Web SearchBibTeXDownload
1994
17OR-SML: A Functional Database Programming Language for Disjunctive Information and Its Applications. Elsa L. Gunter, Leonid Libkin. DEXA 1994, 641-650. Cited by 13Web SearchBibTeXDownload
16Conservativity of Nested Relational Calculi with Internal Generic Functions. Leonid Libkin, Limsoon Wong. Inf. Process. Lett. (49): 273-280 (1994). Cited by 30Web SearchBibTeXDownload
15New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions. Leonid Libkin, Limsoon Wong. PODS 1994, 155-166. Cited by 64Web SearchBibTeXDownload
14Comprehension Syntax. Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen, Limsoon Wong. SIGMOD Record (23): 87-96 (1994). Cited by 221Web SearchBibTeXDownload
1993
13Aggregate Functions, Conservative Extensions, and Linear Orders. Leonid Libkin, Limsoon Wong. DBPL 1993, 282-294. Cited by 49Web SearchBibTeX
12Some Properties of Query Languages for Bags. Leonid Libkin, Limsoon Wong. DBPL 1993, 97-114. Cited by 64Web SearchBibTeX
11Direct product decompositions of lattices, closures and relation schemes. Leonid Libkin. Discrete Mathematics (112): 119-138 (1993). Cited by 9Web SearchBibTeXDownload
10Semantic Representations and Query Languages for Or-sets. Leonid Libkin, Limsoon Wong. PODS 1993, 37-48. Cited by 64Web SearchBibTeXDownload
1992
9Normal Form Relation Schemes: A New Characterization. János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik. Acta Cybern. (10): 141-164 (1992). Cited by 6Web SearchBibTeXDownload
8On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Database. János Demetrovics, G. Hencsey, Leonid Libkin, Ilya B. Muchnik. Acta Cybern. (10): 129-140 (1992). Cited by 4Web SearchBibTeXDownload
7An elementary proof that upper and lower powerdomain constructions commute. Leonid Libkin. Bulletin of the EATCS (48): 175-177 (1992). Cited by 11Web SearchBibTeX
6Functional Dependencies in Relational Databases: A Lattice Point of View. János Demetrovics, Leonid Libkin, Ilya B. Muchnik. Discrete Applied Mathematics (40): 155-185 (1992). Cited by 50Web SearchBibTeX
1991
5On Relational Database Schemes Having Unique Minimal Key. Joachim Biskup, János Demetrovics, Leonid Libkin, Ilya B. Muchnik. Elektronische Informationsverarbeitung und Kybernetik (27): 217-225 (1991). Cited by 11Web SearchBibTeX
4A Relational Algebra for Complex Objects Based on Partial Information. Leonid Libkin. MFDBS 1991, 29-43. Cited by 2Web SearchBibTeXDownload
3Decomposition of Domains. Achim Jung, Leonid Libkin, Hermann Puhlmann. MFPS 1991, 235-258. Cited by 21Web SearchBibTeXDownload
1990
2Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. Georg Gottlob, Leonid Libkin. Acta Cybern. (9): 385-402 (1990). Cited by 41Web SearchBibTeX
1989
1Functional Dependencies and the Semilattice of Closed Classes. János Demetrovics, Leonid Libkin, Ilya B. Muchnik. MFDBS 1989, 136-147. Cited by 24Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-21 - details
2. ^ SIGMOD/PODS 2002 Conference - Retrieved 2013-05-12 - details
3. ^ Untitled Document - Retrieved 2013-05-13 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research