bibliography libkin



  1. Leonid Libkin, Algebraic methods for constructing and analysis of the choice function classes, Fuzzy Sets and Individual Choice, pp. 46--53, Institute for System Studies, Moscow, 1987, (In Russian) .
  2. Leonid Libkin and Ilya Muchnik, Pseudocriteria induced by set-functions, Proc. of the Conference on Decision-Making, Ed. O.~Larichev, pp. 124--125, Moscow Russia, December 1988, (In Russian) .
  3. Leonid Libkin and Ilya Muchnik, Separatory subsemilattices and their properties, MTA SZTAKI K o zlem e nyek, Vol. 39, pp. 83--92, 1988.
  4. Leonid Libkin, Separation theorems for lattices, MTA SZTAKI K o zlem e nyek, Vol. 39, pp. 93--100, 1988.
  5. Leonid Libkin and Ilya Muchnik, On a subsemilattice-lattice of a semilattice, MTA SZTAKI K o zlem e nyek, Vol. 39, pp. 101--110, 1988.
  6. Leonid Libkin, Recognition of choice functions, Automation and Remote Control, Vol. 49, 10, pp. 1355--1358, 1988.
  7. Leonid Libkin, Minimal sets of choice functions generating the basic classes, Automation and Remote Control, Vol. 49, 12, pp. 1662--1665, 1988.
  8. Leonid Libkin and Ilya Muchnik and Leonid Shwartzer, Quasilinear monotone systems, Automation and Remote Control, Vol. 50, 9, pp. 1249--1259, 1989.
  9. Leonid Libkin and Vladimir Gurvich, Quasilinear set-functions and absolute definite matrices, Automation and Remote Control, Vol. 50, 12, pp. 1706--1709, 1989.
  10. Leonid Libkin and Ilya Muchnik, Halfspaces and hyperplanes in convexity lattices, Institute of Mathematics Budapest Hungary, 1989.
  11. Leonid Libkin and Ilya Muchnik, Separatory sublattices of relatively complemented lattices, Proceedings of the Armenian Computer Center, pp. 83--85, Yerevan Armenia, 1990, (In Russian) .
  12. Vladimir Gurvich and Leonid Libkin, Absolutely determined matrices, Mathematical Social Science, Vol. 20, 1, pp. 1--18, 1990.
  13. Georg Gottlob and Leonid Libkin, Investigations on A rmstrong relations dependency inference and excluded functional dependencies, Acta Cybernetica, Vol. 9, 4, pp. 385--402, 1990.
  14. Leonid Libkin, Separability in lattices, Ordered Sets and Lattices, Ed. V.~Salii, pp. 78--88, Saratov University Press, Saratov Russia, 1991, (In Russian English translation available) .
  15. Joachim Biskup and J a nos Demetrovics and Leonid Libkin and Ilya Muchnik, On relational database schemes having unique minimal key, Journal of Information Processing and Cybernetics EIK, Vol. 27, 4, pp. 217--225, 1991.
  16. Leonid Libkin, A relational algebra for complex objects based on partial information, Proc. of the Symp. on Math. Fundamentals of Database Systems (MFDBS), Ed. B.~Thalheim, Vol. 495, pp. 136-147, Springer-Verlag Lecture Notes in Computer Science, Rostock Germany, May 1991.
  17. Leonid Libkin and Vladimir Gurvich, Quasiconvex analysis on semilattices and absolutely determined matrices, Soviet Mathematics Doklady, Vol. 44, 1, pp. 20--25, 1992.
  18. Leonid Libkin, Parallel axiom in convexity lattices, Periodica Mathematica Hungarica, Vol. 24, 1, pp. 1--12, 1992.
  19. Leonid Libkin and Ilya Muchnik, Separatory sublattices and subsemilattices, Studia Scientiarum Mathematicarum Hungarica, Vol. 27, pp. 471--477, 1992.
  20. J a nos Demetrovics and Gusztav Hencsey and Leonid Libkin and Ilya Muchnik, On the interaction between closure operations and choice functions with applications to relational databases, Acta Cybernetica, Vol. 10, 3, pp. 129--139, 1992.
  21. J a nos Demetrovics and Gusztav Hencsey and Leonid Libkin and Ilya Muchnik, Normal form relation schemes a new characterization, Acta Cybernetica, Vol. 10, 3, pp. 141--153, 1992.
  22. J a nos Demetrovics and Leonid Libkin and Ilya Muchnik, Functional dependencies in relational databases a lattice point of view, Discrete Applied Mathematics, Vol. 40, pp. 155--185, 1992, (Preliminary version in Proceedings of MFDBS 89 LNCS vol. 364.) .
  23. Leonid Libkin, An elementary proof that upper and lower powerdomain constructions commute, Bulletin of the EATCS, Vol. 48, pp. 175--177, 1992.
  24. Achim Jung and Leonid Libkin and Hermann Puhlmann, Decomposition of domains, Proc. of the Symp. on Math. Foundations of Programming Semantics (MFPS-91), Ed. S.~Brookes, Vol. 598, pp. 235--258, Springer-Verlag Lecture Notes in Computer Science, Pittsburgh Pennsylvania, 1992.
  25. Leonid Libkin, Direct product decompositions of lattices closures and relation schemes, Discrete Mathematics, Vol. 112, pp. 119--138, 1993.
  26. Leonid Libkin, A remark about algebraicity in complete partial orders, Journal of Pure and Applied Algebra, Vol. 86, pp. 75--77, 1993.
  27. Peter Buneman and Leonid Libkin and Dan Suciu and Val Tannen and Limsoon Wong, Comprehension syntax, SIGMOD Record, Vol. 23, pp. 87--96, March 1994.
  28. Leonid Libkin and Ilya Muchnik, The lattice of subsemilattices of a semilattice, Algebra Universalis, Vol. 31, pp. 252--255, 1994.
  29. Leonid Libkin and Limsoon Wong, Conservativity of nested relational calculi with internal generic functions, Information Processing Letters, Vol. 49, pp. 273--290, 1994.
  30. Leonid Libkin and Limsoon Wong, Some properties of query languages for bags, Proc. of the 4th Workshop on Database Programming Languages (DBPL), Ed. C.~Beeri A.~Ohori and D.~Shasha, pp. 97--114, Springer Verlag, Manhattan NY, 1994.
  31. Leonid Libkin and Limsoon Wong, Aggregate functions conservative extension and linear order, Proc. of the 4th Workshop on Database Programming Languages (DBPL), Ed. C.~Beeri A.~Ohori and D.~Shasha, pp. 282--294, Springer Verlag, Manhattan NY, 1994.
  32. Leonid Libkin and Limsoon Wong, New techniques for studying set languages bag languages and aggregate functions, Proc. of the 13th Symp. on Principles of Database Systems (PODS), Ed. V.~Vianu, pp. 155--166, ACM Press, Minneapolis MN, 1994.
  33. Leonid Libkin, Aspects of Partial Information in Databases, University of Pennsylvania, 1994, (Available as UPenn technical report MS-CIS-94-41 L&C 85.) .
  34. Leonid Libkin and Elsa Gunter, OR-SML A functional database programming language with support for disjunctive information, Proc. of the 5th Internat. Conf. on Database and Expert Systems Applications (DEXA), Ed. D.~Karagiannis, Vol. 856, pp. 641--650, Springer-Verlag Lecture Notes in Computer Science, Athens Greece, September 1994.
  35. Leonid Libkin and Vladimir Gurvich, Trees as semilattices, Discrete Mathematics, Vol. 145, pp. 321--327, 1995.
  36. Leonid Libkin, Direct decompositions of atomistic algebraic lattices, Algebra Universalis, Vol. 33, pp. 127--135, 1995.
  37. Leonid Libkin, Approximation in Databases, Proc. of the Internat. Conf. on Database Theory (ICDT), Ed. M.~Vardi and G.~Gottlob, Vol. 893, pp. 411--424, Springer-Verlag Lecture Notes in Computer Science, Prague Czech Republic, January 1995.
  38. Leonid Libkin, n -distributivity dimension and C arath e odory s theorem, Algebra Universalis, Vol. 34, pp. 72--95, 1995.
  39. Elsa Gunter and Leonid Libkin, Interfacing HOL90 with a functional query language, Proc. of the Internat. Workshop on Higher Order Logic Theorem Proving, Ed. E.T.~Schubert, Vol. 971, pp. 328--339, Springer-Verlag Lecture Notes in Computer Science, September 1995.
  40. Leonid Libkin, Normalizing incomplete databases, Proc. of the 14th Symp. on Principles of Database Systems (PODS), Ed. Serge Abiteboul, pp. 219--230, ACM Press, San Jose CA, 1995.
  41. Timothy Griffin and Leonid Libkin, Incremental maintenance of views with duplicates, Proc. of the Int.~Conference on Management of Data (SIGMOD), Ed. M.~Carey, pp. 328--339, ACM Press, San Jose CA, 1995.
  42. Leonid Libkin and Limsoon Wong, On representation and querying incomplete information in databases with bags, Information Processing Letters, Vol. 56, pp. 209--214, 1995.
  43. Leonid Libkin and Limsoon Wong, Semantic representations and query languages for or-sets, Journal of Computer and Systems Science, Vol. 52, pp. 125--142, 1996, (Preliminary version in PODS 93) .
  44. Leonid Libkin, Query language primitives for programming with incomplete databases, Proc. of the Workshop on Database Programming Languages, Ed. P.~Atzeni and V.~Tannen, Springer Workshops in Computing, Gubbio Italy, 1995.
  45. Guozhu Dong and Leonid Libkin and Limsoon Wong, On impossibility of incremental recomputation of recursive queries in relational calculus and SQL, Proc. of the Workshop on Database Programming Languages, Ed. P.~Atzeni and V.~Tannen, Springer Workshops in Computing, Gubbio Italy, 1995.
  46. Latha Colby and Timothy Griffin and Leonid Libkin and Inderpal Mumick and Howard Trickey, Algorithms for deferred view maintenance, Proc. of the Int.~Conference on Management of Data (SIGMOD), Ed. H.V.~Jagadish, pp. 469--480, ACM Press, Montreal, 1996.
  47. Leonid Libkin and Rona Machlin and Limsoon Wong, A query language for multidimensional arrays: design implementation and optimization techniques, Proc. of the Int.~Conference on Management of Data (SIGMOD), Ed. H.V.~Jagadish, pp. 228--239, ACM Press, Montreal, 1996.
  48. Michael Benedikt and Timothy Griffin and Leonid Libkin, Verifiable properties of database transactions, Proc. of the 15th Symp. on Principles of Database Systems (PODS), Ed. R.~Hull, pp. 117--127, ACM Press, Montreal, 1996.
  49. Michael Benedikt and Leonid Libkin, On the structure of queries in constraint query languages, Proc. of the 11th Symp. on Logic in Computer Science (LICS), pp. 25--34, IEEE Press, New Brunswick, 1996.
  50. Stephane Grumbach and Leonid Libkin and Tova Milo and Limsoon Wong, Query languages for bags: expressive power and complexity, SIGACT News, Vol. 27, pp. 30--37, 1996.
  51. Guozhu Dong and Leonid Libkin and Limsoon Wong, Local properties of query languages, Proc. of the Internat. Conf. on Database Theory (ICDT), Ed. F.~Afrati and Ph.~Kolaitis, pp. 140-154, Springer-Verlag Lecture Notes in Computer Science 1186, Delphi Greece, January 1997.
  52. Latha Colby and Leonid Libkin, Tractable iteration mechanisms for bag languages, Proc. of the Internat. Conf. on Database Theory (ICDT), Ed. F.~Afrati and Ph.~Kolaitis, pp. 461-475, Springer-Verlag Lecture Notes in Computer Science 1186, Delphi Greece, January 1997.
  53. Michael Benedikt and Leonid Libkin, Languages for relational databases over interpreted structures, Proc. of the 16th Symp. on Principles of Database Systems (PODS), pp. 87-98, ACM Press, Tucson AZ, 1997.
  54. Leonid Libkin, On the forms of locality over finite models, Proc. of the 12th Symp. on Logic in Computer Science (LICS), pp. 204-215, IEEE Press, Warsaw Poland, 1997.
  55. Timothy Griffin and Leonid Libkin and Howard Trickey, An improved algorithm for incremental recomputation of active relational expressions, IEEE Transactions on Knowledge and Data Engineering, Vol. 9, pp. 508-511, 1997.
  56. Leonid Libkin and Limsoon Wong, Query languages for bags and aggregate functions, Journal of Computer and System Sciences, Vol. 55, 2, pp. 241-272, 1997.
  57. Leonid Libkin, Models of approximation in databases, Theoretical Computer Science, Vol. 190, pp. 167-210, 1998.
  58. , Semantics in Databases, Ed. Leonid Libkin and Bernhard Thalheim, Springer Verlag LNCS volume 1358, 1998.
  59. Leonid Libkin, A semantics-based approach to design of query languages for databases with partial information, Semantics in Databases, pp. 170-208, Springer-Verlag Lecture Notes in Computer Science 1358, 1998.
  60. Leonid Libkin and Limsoon Wong, Unary quantifiers transitive closure and relations of large degree, Proc. of the 15th Symp. on Theoretical Aspects of Computer Science (STACS 98), pp. 183-193, Springer-Verlag Lecture Notes in Computer Science 1373, Paris France, 1998.
  61. Michael Benedikt and Leonid Libkin, Safe constraint queries, Proc. of the 17th Symp. on Principles of Database Systems (PODS), pp. 99-108, ACM Press, Seattle WA, 1998.
  62. Leonid Libkin, On counting logics and local properties, Proc. of the 13th Symp. on Logic in Computer Science (LICS), pp. 501-512, IEEE Press, Indianapolis IN, 1998.
  63. Leonid Libkin and Limsoon Wong, Incremental recomputation of recursive queries with nested sets and aggregate functions, Proc. of Database Programming Languages (DBPL 97), pp. 222-238, Springer-Verlag Lecture Notes in Computer Science 1369, Estes Park CO, 1998.
  64. Leonid Libkin and Limsoon Wong, On the power of aggregation in relational query languages, Proc. of Database Programming Languages (DBPL 97), pp. 260-280, Springer-Verlag Lecture Notes in Computer Science 1369, Estes Park CO, 1998.
  65. Michael Benedikt and Guozhu Dong and Leonid Libkin and Limsoon Wong, Relational expressive power of constraint query languages, Journal of the ACM, Vol. 45, pp. 1-34, 1998, (Preliminary version in PODS 96 pp. 5-16) .
  66. Michael Benedikt and Timothy Griffin and Leonid Libkin, Verifiable properties of database transactions, Information and Computation, Vol. 147, pp. 57--88, 1998, (Preliminary version in PODS 96) .
  67. Michael Benedikt and Leonid Libkin, Exact and approximate aggregation in constraint query languages, Proc. of the 18th Symp. on Principles of Database Systems (PODS), pp. 102-113, ACM Press, Philadelphia PA, 1999.
  68. Lauri Hella and Leonid Libkin and Juha Nurmonen and Limsoon Wong, Logics with aggregate operators, Proc. of the 14th Symp. on Logic in Computer Science (LICS), pp. 35--44, IEEE Press, Trento Italy, 1999.
  69. Leonid Libkin, Logics with counting auxiliary relations and lower bounds for invariant queries, Proc. of the 14th Symp. on Logic in Computer Science (LICS), pp. 316--325, IEEE Press, Trento Italy, 1999.
  70. Leonid Libkin and Juha Nurmonen, Counting and locality over finite structures: a survey, Generalized Quantifiers and Computation, Ed. J.~Vaananen, pp. 18--50, Springer-Verlag Lecture Notes in Computer Science 1754, 1999.
  71. Guozhu Dong and Leonid Libkin and Jianwen Su and Limsoon Wong, Maintaining transitive closure of graphs in SQL, Int. Journal of Information Technology, (to appear) .
  72. Gabriel Kuper and Leonid Libkin and Jan Paredaens eds., Constraint Databases, Springer Verlag, 1999.
  73. Gabriel Kuper and Leonid Libkin and Jan Paredaens, Introduction, Constraint Databases, Ed. Gabriel Kuper and Leonid Libkin and Jan Paredaens, Springer Verlag, 1999.
  74. Michael Benedikt and Leonid Libkin, Expressive power: the finite case, Constraint Databases, Ed. Gabriel Kuper and Leonid Libkin and Jan Paredaens, Springer Verlag, 1999.
  75. Michael Benedikt and Leonid Libkin, Query safety with constraints, Constraint Databases, Ed. Gabriel Kuper and Leonid Libkin and Jan Paredaens, Springer Verlag, 1999.
  76. Jan Chomicki and Leonid Libkin, Aggregate languages for constraint databases, Constraint Databases, Ed. Gabriel Kuper and Leonid Libkin and Jan Paredaens, Springer Verlag, 1999.
  77. Guozhu Dong and Leonid Libkin and Limsoon Wong, Local properties of query languages, Theoretical Computer Science, (to appear. Extended abstract in ICDT 97) .
  78. Lauri Hella and Leonid Libkin and Juha Nurmonen, Notions of locality and their logical characterizations over finite models, Journal of Symbolic Logic, (to appear. Extended abstract in LICS 97) .
  79. Michael Benedikt and Leonid Libkin, Safe constraint queries, SIAM Journal on Computing, (To appear. Extended abstract in PODS 98 pages 99--108) .
  80. Michael Benedikt and Leonid Libkin, Relational queries over interpreted structures, Journal of the ACM, (To appear. Full version of LICS 96 and PODS 97) .

Go to the Computing Sciences Research Center home page.
Modified: December, 1997.
Copyright © 1997 Lucent Technologies. All rights reserved.