The following pages link to Leonid O. Libkin (Q923676):
Displaying 50 items.
- (Q269319) (redirect page) (← links)
- Certain answers over incomplete XML documents: extending tractability boundary (Q269320) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- On the aggregation problem for synthesized web services (Q389232) (← links)
- Data exchange and schema mappings in open and closed worlds (Q532371) (← links)
- (Q582892) (redirect page) (← links)
- Recognition of choice functions (Q582893) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- Finite model theory and its applications. (Q703863) (← links)
- Elements of finite model theory. (Q703864) (← links)
- Quasilinear set functions and absolute definite matrices (Q750324) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Absolutely determined matrices (Q923677) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Disjoint pattern matching and implication in strings (Q990133) (← links)
- A collapse result for constraint queries over structures of small degree (Q1007620) (← links)
- Functional dependencies in relational databases: A lattice point of view (Q1202888) (← links)
- Parallel axiom in convexity lattices (Q1203431) (← links)
- Direct product decompositions of lattices, closures and relation schemes (Q1210557) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- The lattice of subsemilattices of a semilattice (Q1319055) (← links)
- Conservativity of nested relational calculi with internal generic functions (Q1321813) (← links)
- Direct decompositions of atomistic algebraic lattices (Q1344845) (← links)
- On representation and querying incomplete information in databases with bags (Q1350296) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- Models of approximation in databases (Q1389445) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- (Q1575138) (redirect page) (← links)
- Local properties of query languages (Q1575140) (← links)
- On the orthographic dimension of definable sets (Q1603462) (← links)
- Tractable XML data exchange via relations (Q1762192) (← links)
- Static analysis and query answering for incomplete data trees with constraints (Q1799308) (← links)
- Minimal sets of choice functions generating the basic classes (Q1813794) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Trees as semilattices (Q1901055) (← links)
- \(n\)-distributivity, dimension and Carathéodory's theorem (Q1902543) (← links)
- Semantic representations and query languages for or-sets (Q1915510) (← links)
- Parameterized regular expressions and their languages (Q1944774) (← links)
- Propositional and predicate logics of incomplete information (Q2060732) (← links)
- Regular expressions for data words (Q2353403) (← links)
- A remark about algebraicity in complete partial orders (Q2366057) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- Certain answers as objects and knowledge (Q2634471) (← links)
- Quasilinear monotone systems (Q2639781) (← links)
- (Q2754149) (← links)
- Order-Invariant Types and Their Applications (Q2800972) (← links)
- Graph Logics with Rational Relations (Q2846573) (← links)
