BibSLEIGH — Leonid

Travelled to:

1 × Croatia
1 × Cyprus
1 × Denmark
1 × Greece
1 × Italy
1 × Japan
1 × Portugal
1 × Switzerland
1 × United Kingdom
2 × Austria
2 × France
22 × USA
4 × Canada
4 × Poland

Collaborated with:

∅ M.Benedikt P.Barceló M.Arenas L.Wong D.Figueira W.Fan C.Sirangelo T.Griffin J.L.Reutter L.Segoufin D.Vrgoc F.Murlak A.W.To S.Kolahi F.Neven T.Schwentick F.Geerts T.Tan A.Gheerbrant M.Romero R.Chirkova C.David S.Amano R.Machlin C.A.Hurtado P.T.Wood A.Poggi R.Fagin M.Grohe L.Hella J.Nurmonen G.Dong L.S.Colby I.S.Mumick H.Trickey R.Alur K.Etessami N.Immerman

Talks about:

queri (23) languag (13) data (12) logic (11) xml (9) relat (8) constraint (7) model (7) databas (6) answer (6)

Person: Leonid Libkin

DBLP: Libkin:Leonid

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

Wrote 55 papers:

LICS-2015-FigueiraL #graph #logic #performance #query: Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
KR-2014-Libkin: Certain Answers as Objects and Knowledge (LL).
LICS-CSL-2014-FigueiraL #logic: Pattern logics and auxiliary relations (DF, LL), p. 10.
PODS-2014-FanGL #big data #independence #on the #query: On scale independence for querying big data (WF, FG, LL), pp. 51–62.
PODS-2014-Libkin #how #semistructured data #what: Incomplete data: what went wrong, and how to fix it (LL), pp. 1–13.
DLT-2013-LibkinTV #database #graph #query #regular expression #word: Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
PODS-2013-GheerbrantLS #evaluation #question: When is naive evaluation possible? (AG, LL, CS), pp. 75–86.
PODS-2013-LibkinRV #adaptation #graph #query #rdf: Trial for RDF: adapting graph query languages for RDF data (LL, JLR, DV), pp. 201–212.
LICS-2012-BarceloFL #graph #logic #problem: Graph Logics with Rational Relations and the Generalized Intersection Problem (PB, DF, LL), pp. 115–124.
PODS-2012-BarceloLR #approximate #performance #query: Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.
CIKM-2011-ChirkovaLR #xml: Tractable XML data exchange via relations (RC, LL, JLR), pp. 1629–1638.
PODS-2011-BarceloLR #graph #query: Querying graph patterns (PB, LL, JLR), pp. 199–210.
PODS-2011-Libkin #modelling: Incomplete information and certain answers in general data models (LL), pp. 59–70.
FoSSaCS-2010-ToL #algorithm #decidability #infinity #ltl #model checking: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems (AWT, LL), pp. 221–236.
PODS-2010-BarceloHLW #query: Expressive languages for path queries over graph-structured data (PB, CAH, LL, PTW), pp. 3–14.
PODS-2010-DavidLM #query #xml: Certain answers for XML queries (CD, LL, FM), pp. 191–202.
PODS-2009-AmanoLM #xml: XML schema mappings (SA, LL, FM), pp. 33–42.
PODS-2009-BarceloLPS #modelling #query #xml: XML with incomplete information: models, properties, and query answering (PB, LL, AP, CS), pp. 237–246.
PODS-2009-Libkin #database #finite: The finite model theory toolbox of a database theoretician (LL), pp. 65–76.
PODS-2008-LibkinS: Data exchange and schema mappings in open and closed worlds (LL, CS), pp. 139–148.
ICALP-2007-ArenasBL #automaton #fixpoint #regular expression #word: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (MA, PB, LL), pp. 888–900.
LICS-2007-AlurABEIL #first-order #logic #word: First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.
PODS-2006-KolahiL #dependence #normalisation #on the: On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF (SK, LL), pp. 114–123.
PODS-2006-Libkin: Data exchange and incomplete information (LL), pp. 60–69.
ICALP-2005-Libkin #logic #overview #perspective: Logics for Unranked Trees: An Overview (LL), pp. 35–50.
LICS-2005-BarceloL #logic: Temporal Logics over Unranked Trees (PB, LL), pp. 31–40.
PODS-2005-ArenasL #consistency #query #xml: XML data exchange: consistency and query answering (MA, LL), pp. 13–24.
CSL-2004-ArenasBL #finite #game studies #locality #modelling: Game-Based Notions of Locality Over Finite Models (MA, PB, LL), pp. 175–189.
PODS-2004-ArenasBLF #consistency #query: Locally Consistent Transformations and Query Answering in Data Exchange (MA, PB, RF, LL), pp. 229–240.
LICS-2003-LibkinN #logic #query: Logical Definability and Query Languages over Unranked Trees (LL, FN), pp. 178–187.
PODS-2003-ArenasL #approach #normalisation #relational #xml: An information-theoretic approach to normal forms for relational and XML data (MA, LL), pp. 15–26.
LICS-2002-BenediktL #algebra #automaton #logic #query: Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.
PODS-2002-ArenasFL #consistency #on the #specification #verification #xml: On Verifying Consistency of XML Specifications (MA, WF, LL), pp. 259–270.
PODS-2002-ArenasL #documentation #normalisation #xml: A Normal Form for XML Documents (MA, LL), pp. 85–96.
LICS-2001-BenediktLSS #approach #string: A Model-Theoretic Approach to Regular String Relations (MB, LL, TS, LS), pp. 431–440.
PODS-2001-BenediktLSS #query #string: String Operations in Query Languages (MB, LL, TS, LS).
PODS-2001-FanL #constraints #on the #xml: On XML Integrity Constraints in the Presence of DTDs (WF, LL).
ICALP-2000-Libkin #constraints #independence #quantifier: Variable Independence, Quantifier Elimination, and Constraint Representations (LL), pp. 260–271.
PODS-2000-BenediktGLS #constraints #database #query #reachability: Reachability and Connectivity Queries in Constraint Databases (MB, MG, LL, LS), pp. 104–115.
LICS-1999-HellaLNW #logic: Logics with Aggregate Operators (LH, LL, JN, LW), pp. 35–44.
LICS-1999-Libkin #bound #invariant #logic #query: Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LL), pp. 316–325.
PODS-1999-BenediktL #approximate #constraints #query: Exact and Approximate Aggregation in Constraint Query (MB, LL), pp. 102–113.
LICS-1998-Libkin #logic #on the: On Counting Logics and Local Properties (LL), pp. 501–512.
PODS-1998-BenediktL #constraints #query: Safe Constraint Queries (MB, LL), pp. 99–108.
LICS-1997-Libkin #finite #locality #modelling #on the: On the Forms of Locality over Finite Models (LL), pp. 204–215.
PODS-1997-BenediktL #database #relational: Languages for Relational Databases over Interpreted Structures (MB, LL), pp. 87–98.
LICS-1996-BenediktL #constraints #on the #query: On the Structure of Queries in Constraint Query Languages (MB, LL), pp. 25–34.
PODS-1996-BenediktDLW #constraints #power of #query #relational: Relational Expressive Power of Constraint Query Languages (MB, GD, LL, LW), pp. 5–16.
PODS-1996-BenediktGL #database #transaction: Verifiable Properties of Database Transactions (MB, TG, LL), pp. 117–127.
SIGMOD-1996-ColbyGLMT #algorithm #maintenance: Algorithms for Deferred View Maintenance (LSC, TG, LL, ISM, HT), pp. 469–480.
SIGMOD-1996-LibkinMW #array #design #implementation #multi #optimisation #query: A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques (LL, RM, LW), pp. 228–239.
PODS-1995-Libkin #database #normalisation #semistructured data: Normalizing Incomplete Databases (LL), pp. 219–230.
SIGMOD-1995-GriffinL #incremental #maintenance: Incremental Maintenance of Views with Duplicates (TG, LL), pp. 328–339.
PODS-1994-LibkinW #set: New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions (LL, LW), pp. 155–166.
PODS-1993-LibkinW #query #semantics: Semantic Representations and Query Languages for Or-sets (LL, LW), pp. 37–48.