bibliography libkin
- Leonid Libkin and Limsoon Wong.
Unary quantifiers, transitive closure, and relations of large
degree.
In Symp. on Theoretical Aspects of Computer Science (STACS'98),
to appear.
- Leonid Libkin.
Models of approximation in databases.
Theoretical Computer Science,
190 (1998), 167-210.
- Michael Benedikt, Guozhu Dong, Leonid Libkin and Limsoon Wong.
Relational expressive power of constraint query languages.
Journal of the ACM, to appear.
(Note: Preliminary version in PODS'96, pages 5-16.)
- Leonid Libkin and Limsoon Wong.
On the power of aggregation in relational query
languages.
In Database Programming Languages (DBPL'97),
to appear.
- Leonid Libkin and Limsoon Wong.
Incremental recomputation of recursive queries with nested sets
and aggregate functions.
In Database Programming Languages (DBPL'97),
to appear.
- Leonid Libkin and Limsoon Wong.
Query languages for bags and aggregate functions.
Journal of Computer and System Sciences,
55 (2) (1997), 241-272.
- Leonid Libkin.
On the forms of locality over finite models.
In Proceedings of IEEE Symposium on Logic in
Computer Science (LICS'97),
pages 204-215.
- Timothy Griffin, Leonid Libkin and Howard Trickey.
An improved algorithm for incremental recomputation of
active relational expressions.
IEEE Transactions on Knowledge and Data Engineering,
9 (3) (1997), 508-511.
- Michael Benedikt and Leonid Libkin.
Languages for relational databases over interpreted structures.
In Proceedings of the
16th Symposium on Principles of Database Systems (PODS'97),
pages 87-98.
- Guozhu Dong, Leonid Libkin and Limsoon Wong.
Local properties of query languages.
In Proceedings of the 6th International Conference on Database
Theory (ICDT'97),
Springer LNCS 1186, pp. 140-154.
- Latha Colby and Leonid Libkin.
Tractable iteration mechanisms for bag languages.
In Proceedings of the 6th International Conference on Database
Theory (ICDT'97),
Springer LNCS 1186, pp. 461-475.
- Stephane Grumbach, Leonid Libkin, Tova Milo and Limsoon Wong.
Query languages for bags: expressive power and complexity.
SIGACT News,
(Database Theory Column), June 1996, pages 30-37.
- Michael Benedikt and Leonid Libkin.
On the structure of queries in constraint query languages.
In Proceedings of IEEE Symposium on Logic in
Computer Science (LICS'96),
pages 25-34.
- Michael Benedikt, Timothy Griffin and Leonid Libkin.
Verifiable properties of database transactions.
In Proceedings of the
15th Symposium on Principles of Database Systems (PODS'96),
pages 117-127.
- Leonid Libkin, Rona Machlin and Limsoon Wong.
A query language for multidimensional arrays: design,
implementation and optimization techniques.
In Proceedings of the
ACM SIGMOD International Conference on Management of Data (SIGMOD'96),
pages 228-239.
- Latha Colby, Timothy Griffin, Leonid Libkin, Inderpal Mumick and
Howard Trickey.
Algorithms for deferred view maintenance.
In Proceedings of the
ACM SIGMOD International Conference on Management of Data (SIGMOD'96),
pages 469-480.
- Leonid Libkin.
Query language primitives for programming with incomplete
databases.
In Proceedings of DBPL'95.
- Guozhu Dong, Leonid Libkin and Limsoon Wong.
On impossibility of decremental recomputation of recursive
queries in relational calculus and SQL.
In Proceedings of DBPL'95.
- Leonid Libkin and Limsoon Wong.
Semantic representations and query languages for or-sets.
Journal of Computer and System Sciences,
52 (1) (1996), 125-142. (Note: Preliminary version in PODS'93,
pp. 37-48.)
- Leonid Libkin and Limsoon Wong.
On representation and querying incomplete information
in databases with bags.
Information
Processing Letters,
56 (4) (1995), 209-214.
- Leonid Libkin and Vladimir Gurvich.
Trees as semilattices.
Discrete
Mathematics,
145 (1995), 321-327.
- Leonid Libkin.
Approximation in databases.
In Proceedings of the
International Conference on Database Theory (ICDT'95),
Springer LNCS 893, pp. 411-424.
- Leonid Libkin.
A semantics-based approach to design of query languages for
databases with partial information.
In Proceedings of the
Workshop
on Semantics in Databases,
Prague, 1995, pp. 63-80.
- Leonid Libkin.
Normalizing incomplete databases.
In Proceedings of the
14th Symposium on Principles of Database Systems (PODS'95),
pp. 219-230.
- Timothy Griffin and Leonid Libkin.
Incremental maintenance of views with duplicates.
In Proceedings of the
ACM SIGMOD International
Conference on Management of Data (SIGMOD'95),
pp. 328-339.
- Elsa Gunter and Leonid Libkin.
Interfacing HOL90 with a functional database query language.
In Proceedings of the
International Workshop on Higher Order
Logic Theorem Proving and its Applications, 1995,
Springer LNCS 971, pp. 328-339.
- Leonid Libkin.
Direct decompositions of atomistic algebraic lattices.
Algebra Universalis,
33 (1995), 127-135.
- Leonid Libkin.
n-distributivity, dimension and Caratheodory's theorem.
Algebra Universalis,
34 (1995), 72-95.
- Leonid Libkin and Limsoon Wong.
Conservativity of nested relational calculi with internal
generic functions.
Information Processing Letters,
49 (1994), 273-280.
- Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen and Limsoon Wong.
Comprehension syntax.
SIGMOD Record,
23 (1994), 87-96.
- Leonid Libkin and Limsoon Wong.
Some properties of query languages for bags.
In Proceedings of the
Workshop on Database Programming
Languages,
Springer Verlag, 1994, pp. 97--114.
- Leonid Libkin and Limsoon Wong.
Aggregate functions, conservative extension and linear order.
In Proceedings of the
Workshop on Database Programming
Languages,
Springer Verlag, 1994, pp. 282--294.
- Leonid Libkin and Limsoon Wong.
New techniques for studying set languages, bag languages,
and aggregate functions.
In Proceedings of the
13th
Symposium on Principles of Database Systems (PODS'94),
pp. 155--166.
- Elsa Gunter and Leonid Libkin.
OR-SML: A functional database programming language with
support for disjunctive information.
In Proceedings of the
International Conference on Database and Expert Systems
Applications,
Springer LNCS 856, pp. 641-650.
- Leonid Libkin and Ilya Muchnik.
The lattice of subsemilattices of a semilattice.
Algebra Universalis,
31 (1994), 252--255.
- Leonid Libkin.
Aspects of Partial Information in Databases (PhD Thesis).
University of Pennsylvania, 1994.
- Leonid Libkin.
Direct product decompositions of lattices, closures and relation
schemes.
Discrete Mathematics,
112 (1993), 119-138.
- Leonid Libkin.
A remark about algebraicity in complete partial orders.
Journal of Pure and Applied Algebra,
86 (1993), 75-77.
- Janos Demetrovics, Gusztav Hencsey, Leonid Libkin and Ilya Muchnik.
On the interaction between closure operations and choice
functions with applications to relational databases.
Acta Cybernetica,
10 (3) (1992), 129-139.
- Janos Demetrovics, Gusztav Hencsey, Leonid Libkin and Ilya Muchnik.
Normal form relation schemes: a new characterization.
Acta Cybernetica,
10 (3) (1992), 141-153.
- Janos Demetrovics, Leonid Libkin and Ilya Muchnik.
Functional dependencies in relational databases: a lattice
point of view.
Discrete Applied Mathematics,
40 (1992), 155-185.
- Leonid Libkin.
An elementary proof that upper and lower powerdomain
constructions commute.
Bulletin of the EATCS,
48 (1992), 175-177.
- Achim Jung, Leonid Libkin and Hermann Puhlmann.
Decomposition of domains.
In Proceedings of the Conference on
Mathematical Foundations of Programming Semantics (MFPS'91),
Springer LNCS 598, pp. 235-258.
- Vladimir Gurvich and Leonid Libkin.
Quasiconvex analysis on semilattices and absolutely
determined matrices.
Soviet Mathematics Doklady,
44 (1) (1992), 20-25.
- Leonid Libkin.
Parallel axiom in convexity lattices.
Periodica Mathematica Hungarica,
24 (1) (1992), 1-12.
- Leonid Libkin and Ilya Muchnik.
Separatory sublattices and subsemilattices.
Studia Scientiarum Mathematicarum Hungarica,
27 (1992), 471-477.
- Leonid Libkin.
A relational algebra for complex objects based on partial
information.
In Proceedings of the Conference on
Mathematical Fundamentals of Database Systems (MFDBS'91),
Springer LNCS 495, pp. 29-43.
- Joachim Biskup, Janos Demetrovics, Leonid Libkin and Ilya Muchnik.
On relational database schemes having unique minimal key.
Journal of Information Processing and Cybernetics,
27 (4) (1991), 217-225.
- Leonid Libkin.
Separability in lattices.
In Ordered Sets and Lattices (Russian),
Saratov, 1991, pp. 78-88.
- Vladimir Gurvich and Leonid Libkin.
Absolutely determined matrices.
Mathematical Social Science,
20 (1) (1990), 1-18.
- Georg Gottlob and Leonid Libkin.
Investigations on Armstrong relations, dependency inference and
excluded functional dependencies.
Acta Cybernetica,
9 (4) (1990), 385-402.
- Leonid Libkin, Ilya Muchnik and Leonid Schvartzer.
Quasilinear monotone systems.
Automation and Remote Control,
50 (9) (1989), 1249-1259.
- Vladimir Gurvich and Leonid Libkin.
Quasilinear set-functions and absolute definite matrices.
Automation and Remote Control,
50 (12) (1989), 1706-1709.
- Leonid Libkin and Ilya Muchnik.
Halfspaces and hyperplanes in convexity lattices.
Institute of Mathematics,
Budapest, Hungary, 1989.
- Janos Demetrovics, Leonid Libkin and Ilya Muchnik.
Functional dependencies and the semilattice of closed
classes.
In Proceedings of the Conference on
Mathematical Fundamentals of Database Systems (MFDBS'89),
Springer LNCS 364, pp. 136-147.
- Leonid Libkin.
Recognition of choice functions.
Automation and Remote Control,
49 (10) (1988), 1355-1358.
- Leonid Libkin.
Minimal sets of choice functions generating the basic classes.
Automation and Remote Control,
49 (12) (1988), 1662-1665.
- Leonid Libkin and Ilya Muchnik.
Separatory subsemilattices and their properties.
MTA SZTAKI Kozlemenyek,
39 (1988), 83-92.
- Leonid Libkin.
Separation theorems for lattices.
MTA SZTAKI Kozlemenyek,
39 (1988), 93-100.
- Leonid Libkin and Ilya Muchnik.
On a subsemilattice-lattice of a semilattice.
MTA SZTAKI Kozlemenyek,
39 (1988), 101-110.
- Leonid Libkin and Ilya Muchnik.
Pseudocriteria induced by set-functions.
In Proceedings of the
Conference on Decision-Making (Russian),
Moscow, 1988, pp. 124-125.
- Leonid Libkin.
Algebraic methods for construction and analysis of the
choice function classes.
In Fuzzy Sets and
Individual Choice (Russian),
Moscow, 1987, pp. 46-53.
Go to the Computing Sciences
Research Center home page.
Modified: October 17, 1997.
Copyright © 1997<
/a>
Lucent Technologies. All rights reserved.