| 2009 |
|---|
| 56 | EE | Clemens Ley,
Michael Benedikt:
How big must complete XML query languages be?
ICDT 2009: 183-200 |
| 2008 |
|---|
| 55 | EE | Michael Benedikt,
Alan Jeffrey,
Ruy Ley-Wild:
Stream firewalling of xml constraints.
SIGMOD Conference 2008: 487-498 |
| 54 | EE | Michael Benedikt,
Christoph Koch:
XPath leashed.
ACM Comput. Surv. 41(1): (2008) |
| 53 | EE | Michael Benedikt,
Wenfei Fan,
Floris Geerts:
XPath satisfiability in the presence of DTDs.
J. ACM 55(2): (2008) |
| 52 | EE | Sihem Amer-Yahia,
Michael Benedikt,
Laks V. S. Lakshmanan,
Julia Stoyanovich:
Efficient network aware search in collaborative tagging sites.
PVLDB 1(1): 710-721 (2008) |
| 2007 |
|---|
| 51 | EE | Michael Benedikt,
Alan Jeffrey:
Efficient and Expressive Tree Filters.
FSTTCS 2007: 461-472 |
| 50 | EE | Michael Benedikt,
Leonid Libkin,
Frank Neven:
Logical definability and query languages over ranked and unranked trees.
ACM Trans. Comput. Log. 8(2): (2007) |
| 49 | EE | Sihem Amer-Yahia,
Michael Benedikt,
Philip Bohannon:
Challenges in Searching Online Communities.
IEEE Data Eng. Bull. 30(2): 23-31 (2007) |
| 48 | EE | Michael Benedikt:
Database Theory 2004.
J. Comput. Syst. Sci. 73(3): 243-244 (2007) |
| 2006 |
|---|
| 47 | EE | Michael Benedikt,
Philip Bohannon,
Glenn Bruns:
Data Cleaning for Decision Support.
CleanDB 2006 |
| 46 | EE | Michael Benedikt,
Christoph Koch:
Interpreting Tree-to-Tree Queries.
ICALP (2) 2006: 552-564 |
| 45 | EE | Michael Benedikt,
Bart Kuijpers,
Christof Löding,
Jan Van den Bussche,
Thomas Wilke:
A characterization of first-order topological properties of planar spatial data.
J. ACM 53(2): 273-305 (2006) |
| 2005 |
|---|
| 44 | EE | Michael Benedikt,
Angela Bonifati,
Sergio Flesca,
Avinash Vyas:
Verification of Tree Updates for Optimization.
CAV 2005: 379-393 |
| 43 | EE | Michael Benedikt,
Luc Segoufin:
Towards a Characterization of Order-Invariant Queries over Tame Structures.
CSL 2005: 276-291 |
| 42 | EE | Michael Benedikt,
Irini Fundulaki:
XML Subtree Queries: Specification and Composition.
DBPL 2005: 138-153 |
| 41 | EE | Michael Benedikt:
An Insider's Guide to Logic in Telecommunications Data.
LICS 2005: 104-105 |
| 40 | EE | Michael Benedikt,
Wenfei Fan,
Floris Geerts:
XPath satisfiability in the presence of DTDs.
PODS 2005: 25-36 |
| 39 | EE | Michael Benedikt,
Luc Segoufin:
Regular Tree Languages Definable in FO.
STACS 2005: 327-339 |
| 38 | EE | Michael Benedikt,
Angela Bonifati,
Sergio Flesca,
Avinash Vyas:
Adding Updates to XQuery: Semantics, Optimization, and Static Analysis.
XIME-P 2005 |
| 37 | EE | Rajeev Alur,
Michael Benedikt,
Kousha Etessami,
Patrice Godefroid,
Thomas W. Reps,
Mihalis Yannakakis:
Analysis of recursive state machines.
ACM Trans. Program. Lang. Syst. 27(4): 786-818 (2005) |
| 36 | EE | Michael Benedikt,
Wenfei Fan,
Gabriel M. Kuper:
Structural properties of XPath fragments.
Theor. Comput. Sci. 336(1): 3-31 (2005) |
| 2004 |
|---|
| 35 | EE | Michael Benedikt,
Glenn Bruns:
On Guard: Producing Run-Time Checks from Integrity Constraints.
AMAST 2004: 27-41 |
| 34 | EE | Michael Benedikt,
Christof Löding,
Jan Van den Bussche,
Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data.
PODS 2004: 107-114 |
| 2003 |
|---|
| 33 | EE | Michael Benedikt,
Wenfei Fan,
Gabriel M. Kuper:
Structural Properties of XPath Fragments.
ICDT 2003: 79-95 |
| 32 | EE | Richard Hull,
Michael Benedikt,
Vassilis Christophides,
Jianwen Su:
E-services: a look behind the curtain.
PODS 2003: 1-14 |
| 31 | EE | Michael Benedikt,
Chee Yong Chan,
Wenfei Fan,
Juliana Freire,
Rajeev Rastogi:
Capturing both Types and Constraints in Data Integration.
SIGMOD Conference 2003: 277-288 |
| 30 | EE | Michael Benedikt,
Leonid Libkin,
Thomas Schwentick,
Luc Segoufin:
Definable relations and first-order query languages over strings.
J. ACM 50(5): 694-751 (2003) |
| 29 | EE | Michael Benedikt,
Martin Grohe,
Leonid Libkin,
Luc Segoufin:
Reachability and connectivity queries in constraint databases.
J. Comput. Syst. Sci. 66(1): 169-206 (2003) |
| 28 | | Michael Benedikt,
H. Jerome Keisler:
Definability with a predicate for a semi-linear set.
J. Symb. Log. 68(1): 319-351 (2003) |
| 2002 |
|---|
| 27 | EE | Michael Benedikt,
Leonid Libkin:
Tree Extension Algebras: Logics, Automata, and Query Languages.
LICS 2002: 203- |
| 26 | EE | Michael Benedikt,
Chee Yong Chan,
Wenfei Fan,
Rajeev Rastogi,
Shihui Zheng,
Aoying Zhou:
DTD-Directed Publishing with Attribute Translation Grammars.
VLDB 2002: 838-849 |
| 25 | EE | Michael Benedikt,
Leonid Libkin:
Aggregate Operators in Constraint Query Languages.
J. Comput. Syst. Sci. 64(3): 628-654 (2002) |
| 2001 |
|---|
| 24 | EE | Michael Benedikt,
Patrice Godefroid,
Thomas W. Reps:
Model Checking of Unrestricted Hierarchical State Machines.
ICALP 2001: 652-666 |
| 23 | | Michael Benedikt,
Leonid Libkin,
Thomas Schwentick,
Luc Segoufin:
A Model-Theoretic Approach to Regular String Relations.
LICS 2001: 431- |
| 22 | EE | Michael Benedikt,
Leonid Libkin,
Thomas Schwentick,
Luc Segoufin:
String Operations in Query Languages.
PODS 2001 |
| 2000 |
|---|
| 21 | EE | Michael Benedikt,
H. Jerome Keisler:
Definability over Linear Constraints.
CSL 2000: 217-231 |
| 20 | | Michael Benedikt,
Leonid Libkin:
Query Safety with Constraints.
Constraint Databases 2000: 109-129 |
| 19 | | Michael Benedikt,
Leonid Libkin:
Expressive Power: The Finite Case.
Constraint Databases 2000: 55-87 |
| 18 | EE | Michael Benedikt,
Martin Grohe,
Leonid Libkin,
Luc Segoufin:
Reachability and Connectivity Queries in Constraint Databases.
PODS 2000: 104-115 |
| 17 | EE | Michael Benedikt,
Leonid Libkin:
Relational queries over interpreted structures.
J. ACM 47(4): 644-680 (2000) |
| 16 | | Michael Benedikt,
Leonid Libkin:
Safe Constraint Queries.
SIAM J. Comput. 29(5): 1652-1682 (2000) |
| 1999 |
|---|
| 15 | EE | Michael Benedikt,
Thomas W. Reps,
Shmuel Sagiv:
A Decidable Logic for Describing Linked Data Structures.
ESOP 1999: 2-19 |
| 14 | EE | Michael Benedikt,
Leonid Libkin:
Exact and Approximate Aggregation in Constraint Query.
PODS 1999: 102-113 |
| 13 | | Michael Benedikt:
Hierarchies of Measure-Theoretic Ultrafilters.
Ann. Pure Appl. Logic 97(1-3): 203-219 (1999) |
| 1998 |
|---|
| 12 | | John T. Baldwin,
Michael Benedikt:
Embedded Finite Models, Stability Theory and the Impact of Order.
LICS 1998: 490-500 |
| 11 | EE | Michael Benedikt,
Leonid Libkin:
Safe Constraint Queries.
PODS 1998: 99-108 |
| 10 | | Michael Benedikt,
Timothy Griffin,
Leonid Libkin:
Verifiable Properties of Database Transactions.
Inf. Comput. 147(1): 57-88 (1998) |
| 9 | EE | Michael Benedikt,
Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Relational Expressive Power of Constraint Query Languages.
J. ACM 45(1): 1-34 (1998) |
| 8 | | Michael Benedikt:
Ultrafilters which Extend Measures.
J. Symb. Log. 63(2): 638-662 (1998) |
| 1997 |
|---|
| 7 | EE | David L. Atkins,
Thomas Ball,
Michael Benedikt,
Glenn Bruns,
Kenneth C. Cox,
Peter Mataga,
Kenneth Rehor:
Experience with a Domain Specific Language for Form-based Services.
DSL 1997: 37-50 |
| 6 | EE | Michael Benedikt,
H. Jerome Keisler:
Expressive Power of Unary Counters.
ICDT 1997: 291-305 |
| 5 | EE | Michael Benedikt,
Leonid Libkin:
Languages for Relational Databases over Interpreted Structures.
PODS 1997: 87-98 |
| 4 | | Michael Benedikt,
H. Jerome Keisler:
Expressive Power of Unary Counters.
Structures in Logic and Computer Science 1997: 34-50 |
| 1996 |
|---|
| 3 | | Michael Benedikt,
Leonid Libkin:
On the Structure of Queries in Constraint Query Languages.
LICS 1996: 25-34 |
| 2 | EE | Michael Benedikt,
Timothy Griffin,
Leonid Libkin:
Verifiable Properties of Database Transactions.
PODS 1996: 117-127 |
| 1 | EE | Michael Benedikt,
Guozhu Dong,
Leonid Libkin,
Limsoon Wong:
Relational Expressive Power of Constraint Query Languages.
PODS 1996: 5-16 |
