[Edit]

Leonid Libkin
(ALIAS: L. Libkin) [FOAF]  [Follow]

Position: Professor
Affiliation: Department of Computer Science University of Toronto
Address: Department of Computer Science 6 King's College Road Pratt Building, Room PT398A University of Toronto Toronto, Ontario M5S 3H5
Phone: (416) 978-4158
Fax: (416) 978-1455
Email:
Homepage: http://www.cs.toronto.edu/~libkin/
[Edit]
Statistics: H-index: 40 (See all experts' h-index.)
total citation number: 6578
highest-cited paper: A normal form for XML documents (2004) at ACM Trans. Database Syst. (Cited By 358)

Research Interest:

Query Languages, Constraint Query Languages, constraint databases, XML Specifications, Bag Languages

Show Temporal Interests (Do you want to see the change of his/her research interests?)


Publications: [Edit disambiguation Result]

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