Leonid Libkin - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Regular Languages of Nested Words: Fixed Points, Automata, and SynchronizationMarcelo Arenas, Pablo Barceló, Leonid Libkin. mst, 49(3):639-670, 2011. [doi]

Querying graph patternsPablo Barceló, Leonid Libkin, Juan L. Reutter. pods 2011: 199-210 [doi]

Efficient reasoning about data trees via integer linear programmingClaire David, Leonid Libkin, Tony Tan. icdt 2011: 18-29 [doi]

A Direct Translation from XPath to Nondeterministic AutomataNadime Francis, Claire David, Leonid Libkin. amw 2011: [doi]

Closed world data exchangeAndré Hernich, Leonid Libkin, Nicole Schweikardt. tods, 36(2):14, 2011. [doi]

Incomplete information and certain answers in general data modelsLeonid Libkin. pods 2011: 59-70 [doi]

Data exchange and schema mappings in open and closed worldsLeonid Libkin, Cristina Sirangelo. jcss, 77(3):542-571, 2011. [doi]

2010

Relational and XML Data ExchangeMarcelo Arenas, Pablo Barceló, Leonid Libkin, Filip Murlak. Synthesis Lectures on Data Management, Morgan & Claypool Publishers, 2010. [doi]

XML with incomplete informationPablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo. JACM, 58(1):4, 2010. [doi]

On Incomplete XML Documents with Integrity ConstraintsPablo Barceló, Leonid Libkin, Juan L. Reutter. amw 2010: [doi]

Expressive languages for path queries over graph-structured dataPablo Barceló, Carlos A. Hurtado, Leonid Libkin, Peter T. Wood. pods 2010: 3-14 [doi]

Certain answers for XML queriesClaire David, Leonid Libkin, Filip Murlak. pods 2010: 191-202 [doi]

On the Satisfiability of Two-Variable Logic over Data WordsClaire David, Leonid Libkin, Tony Tan. lpar 2010: 248-262 [doi]

On the aggregation problem for synthesized web servicesTing Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu. icdt 2010: 242-251 [doi]

On the tradeoff between mapping and querying power in XML data exchangeShun ichi Amano, Claire David, Leonid Libkin, Filip Murlak. icdt 2010: 155-164 [doi]

An information-theoretic analysis of worst-case redundancy in database designSolmaz Kolahi, Leonid Libkin. tods, 35(1), 2010. [doi]

Disjoint pattern matching and implication in stringsLeonid Libkin, Cristina Sirangelo. ipl, 110(4):143-147, 2010. [doi]

Reasoning about XML with temporal logics and automataLeonid Libkin, Cristina Sirangelo. japll, 8(2):210-232, 2010. [doi]

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite SystemsAnthony Widjaja To, Leonid Libkin. fossacs 2010: 221-236 [doi]

2009

2008

First-Order and Temporal Logics for Nested WordsRajeev Alur, Marcelo Arenas, Pablo BarcelÃ³, Kousha Etessami, Neil Immerman, Leonid Libkin. lmcs, 4(4), 2008. [doi]

On the Complexity of Verifying Consistency of XML SpecificationsMarcelo Arenas, Wenfei Fan, Leonid Libkin. siamcomp, 38(3):841-880, 2008. [doi]

Game-based notions of locality over finite modelsMarcelo Arenas, Pablo Barceló, Leonid Libkin. APAL, 152(1-3):3-30, 2008. [doi]

XML data exchange: Consistency and query answeringMarcelo Arenas, Leonid Libkin. JACM, 55(2), 2008. [doi]

Introduction to the PODS 2007 special sectionLeonid Libkin. tods, 33(4), 2008. [doi]

Reasoning about XML with Temporal Logics and AutomataLeonid Libkin, Cristina Sirangelo. lpar 2008: 97-112 [doi]

Data exchange and schema mappings in open and closed worldsLeonid Libkin, Cristina Sirangelo. pods 2008: 139-148 [doi]

Recurrent Reachability Analysis in Regular Model CheckingAnthony Widjaja To, Leonid Libkin. lpar 2008: 198-213 [doi]

2007

First-Order and Temporal Logics for Nested WordsRajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin. lics 2007: 151-160 [doi]

Combining Temporal Logics for Querying XML DocumentsMarcelo Arenas, Pablo Barceló, Leonid Libkin. icdt 2007: 359-373 [doi]

Regular Languages of Nested Words: Fixed Points, Automata, and SynchronizationMarcelo Arenas, Pablo Barceló, Leonid Libkin. icalp 2007: 888-900 [doi]

Logical definability and query languages over ranked and unranked treesMichael Benedikt, Leonid Libkin, Frank Neven. tocl, 8(2), 2007. [doi]

PrefaceThomas Eiter, Leonid Libkin. TCS, 371(3):147, 2007. [doi]

XML design for relational storageSolmaz Kolahi, Leonid Libkin. WWW 2007: 1083-1092 [doi]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, ChinaLeonid Libkin, editor, ACM, 2007.

Normalization Theory for XMLLeonid Libkin. xsym 2007: 1-13 [doi]

2006

2005

Consistency of XML SpecificationsMarcelo Arenas, Wenfei Fan, Leonid Libkin. dagstuhl 2005: 15-41 [doi]

An information-theoretic approach to normal forms for relational and XML dataMarcelo Arenas, Leonid Libkin. JACM, 52(2):246-283, 2005. [doi]

XML data exchange: consistency and query answeringMarcelo Arenas, Leonid Libkin. pods 2005: 13-24 [doi]

Temporal Logics over Unranked TreesPablo Barceló, Leonid Libkin. lics 2005: 31-40 [doi]

Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, ProceedingsThomas Eiter, Leonid Libkin, editors, Volume 3363 of Lecture Notes in Computer Science, Springer, 2005.

Logics for Unranked Trees: An OverviewLeonid Libkin. icalp 2005: 35-50 [doi]

2004

2003

An information-theoretic approach to normal forms for relational and XML dataMarcelo Arenas, Leonid Libkin. pods 2003: 15-26 [doi]

Definable relations and first-order query languages over stringsMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. JACM, 50(5):694-751, 2003. [doi]

Reachability and connectivity queries in constraint databasesMichael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin. jcss, 66(1):169-206, 2003. [doi]

Incremental recomputation in local languagesGuozhu Dong, Leonid Libkin, Limsoon Wong. iandc, 181(2):88-98, 2003. [doi]

Logical Definability and Query Languages over Unranked TreesLeonid Libkin, Frank Neven. lics 2003: 178-187 [doi]

Expressive power of SQLLeonid Libkin. TCS, 296(3):379-404, 2003. [doi]

A collapse result for constraint queries over structures of small degreeLeonid Libkin. ipl, 86(5):277-281, 2003. [doi]

Variable independence for first-order definable constraintsLeonid Libkin. tocl, 4(4):431-451, 2003. [doi]

2002

EditorialMartín Abadi, Leonid Libkin, Frank Pfenning. tocl, 3(3):335-335, 2002. [doi]

A Normal Form for XML DocumentsMarcelo Arenas, Leonid Libkin. pods 2002: 85-96 [doi]

On Verifying Consistency of XML SpecificationsMarcelo Arenas, Wenfei Fan, Leonid Libkin. pods 2002: 259-270 [doi]

What s Hard about XML Schema Constraints?Marcelo Arenas, Wenfei Fan, Leonid Libkin. DEXA 2002: 269-278 [doi]

Tree Extension Algebras: Logics, Automata, and Query LanguagesMichael Benedikt, Leonid Libkin. lics 2002: 203 [doi]

Aggregate Operators in Constraint Query LanguagesMichael Benedikt, Leonid Libkin. jcss, 64(3):628-654, 2002. [doi]

On XML integrity constraints in the presence of DTDsWenfei Fan, Leonid Libkin. JACM, 49(3):368-406, 2002. [doi]

Lower bounds for invariant queries in logics with countingLeonid Libkin, Limsoon Wong. TCS, 288(1):153-180, 2002.

2001

String Operations in Query LanguagesMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. pods 2001: [doi]

A Model-Theoretic Approach to Regular String RelationsMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. lics 2001: 431

On the orthographic dimension of definable setsStavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin. ipl, 79(3):141-145, 2001. [doi]

On XML Integrity Constraints in the Presence of DTDsWenfei Fan, Leonid Libkin. pods 2001: [doi]

Logics with aggregate operatorsLauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong. JACM, 48(4):880-907, 2001. [doi]

Logics capturing local propertiesLeonid Libkin. tocl, 2(1):135-153, 2001. [doi]

Expressive Power of SQLLeonid Libkin. icdt 2001: 1-21 [doi]

Reminiscences on Influential PapersKenneth A. Ross, Stefano Ceri, Luis Gravano, Per-Åke Larson, Leonid Libkin, Tova Milo. SIGMOD, 30(1):55-57, 2001. [doi]

2000

Expressive Power: The Finite CaseMichael Benedikt, Leonid Libkin. cdb 2000: 55-87

Relational queries over interpreted structuresMichael Benedikt, Leonid Libkin. JACM, 47(4):644-680, 2000. [doi]

Reachability and Connectivity Queries in Constraint DatabasesMichael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin. pods 2000: 104-115 [doi]

Query Safety with ConstraintsMichael Benedikt, Leonid Libkin. cdb 2000: 109-129

Safe Constraint QueriesMichael Benedikt, Leonid Libkin. siamcomp, 29(5):1652-1682, 2000.

Aggregate Languages for Constraint DatabasesJan Chomicki, Leonid Libkin. cdb 2000: 131-154

Local properties of query languagesGuozhu Dong, Leonid Libkin, Limsoon Wong. TCS, 239(2):277-308, 2000. [doi]

IntroductionGabriel M. Kuper, Leonid Libkin, Jan Paredaens. cdb 2000: 1-16

Constraint DatabasesGabriel M. Kuper, Leonid Libkin, Jan Paredaens, editors, Springer, 2000.

Logics with counting and local propertiesLeonid Libkin. tocl, 1(1):33-59, 2000. [doi]

Logics Capturing Local PropertiesLeonid Libkin. STACS 2000: 217-229 [doi]

Variable Independence, Quantifier Elimination, and Constraint RepresentationsLeonid Libkin. icalp 2000: 260-271 [doi]

1999

Exact and Approximate Aggregation in Constraint QueryMichael Benedikt, Leonid Libkin. pods 1999: 102-113 [doi]

Notions of Locality and Their Logical Characterizations over Finite ModelsLauri Hella, Leonid Libkin, Juha Nurmonen. JSYML, 64(4):1751-1773, 1999.

Logics with Aggregate OperatorsLauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong. lics 1999: 35-44 [doi]

Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant QueriesLeonid Libkin. lics 1999: 316-325 [doi]

Database Principles Column - IntroductionLeonid Libkin. SIGMOD, 28(4):29, 1999. [doi]

What you can and cannot say in SQL or proving folk theorems in database theoryLeonid Libkin. bda 1999: 425

On the Power of Incremental Evaluation in SQL-Like LanguagesLeonid Libkin, Limsoon Wong. DBPL 2000: 17-30 [doi]

Some Remarks on Variable Independence, Closure, and Orthographic Dimension in Constraint DatabasesLeonid Libkin. SIGMOD, 28(4):24-28, 1999. [doi]

PreviousNext