![]() | ![]() |
| 2012 | ||
|---|---|---|
| 80 | Maurizio Lenzerini, Michael Benedikt: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, May 20-24, 2012 ACM 2012 | |
| 79 | Michael Benedikt, Tim Furche, Andreas Savvides, Pierre Senellart: ProFoUnd: program-analysis-based form understanding. WWW (Companion Volume) 2012: 313-316 | |
| 78 | Michael Benedikt, Pierre Bourhis, Clemens Ley: Querying Schemas With Access Restrictions CoRR abs/1203.6403: (2012) | |
| 77 | Michael Benedikt, Pierre Bourhis, Clemens Ley: Querying Schemas With Access Restrictions. PVLDB 5(7): 634-645 (2012) | |
| 2011 | ||
| 76 | Michael Benedikt, Rastislav Lenhardt, James Worrell: Two Variable vs. Linear Temporal Logic in Model Checking and Games. CONCUR 2011: 497-511 | |
| 75 | Michael Benedikt, Gabriele Puppis, Cristian Riveros: The Cost of Traveling between Languages. ICALP (2) 2011: 234-245 | |
| 74 | Huy Vu, Michael Benedikt: Complexity of higher-order queries. ICDT 2011: 208-219 | |
| 73 | Michael Benedikt, Gabriele Puppis, Cristian Riveros: Regular Repair of Specifications. LICS 2011: 335-344 | |
| 72 | Michael Benedikt, Georg Gottlob, Pierre Senellart: Determining relevance of accesses at runtime. PODS 2011: 211-222 | |
| 71 | Michael Benedikt, Georg Gottlob, Pierre Senellart: Determining Relevance of Accesses at Runtime (Extended Version) CoRR abs/1104.0553: (2011) | |
| 70 | Huy Vu, Michael Benedikt: HOMES: A Higher-Order Mapping Evaluation System. PVLDB 4(12): 1399-1402 (2011) | |
| 2010 | ||
| 69 | Michael Benedikt, Clemens Ley, Gabriele Puppis: What You Must Remember When Processing Data Words. AMW 2010 | |
| 68 | Michael Benedikt, Clemens Ley, Gabriele Puppis: Automata vs. Logics on Data Words. CSL 2010: 110-124 | |
| 67 | Michael Benedikt: Analysis of declarative updates: invited talk. EDBT/ICDT Workshops 2010 | |
| 66 | Michael Benedikt, Gabriele Puppis, Huy Vu: Positive higher-order queries. PODS 2010: 27-38 | |
| 65 | Michael Benedikt, Georg Gottlob: The Impact of Virtual Views on Containment. PVLDB 3(1): 297-308 (2010) | |
| 64 | Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, Pierre Senellart: Probabilistic XML via Markov Chains. PVLDB 3(1): 770-781 (2010) | |
| 63 | Michael Benedikt, James Cheney: Destabilizers and Independence of XML Updates. PVLDB 3(1): 906-917 (2010) | |
| 62 | Michael Benedikt, Daniela Florescu, Philippa Gardner, Giovanna Guerrini, Marco Mesiti, Emmanuel Waller: Report on the EDBT/ICDT 2010 workshop on updates in XML. SIGMOD Record 39(1): 54-57 (2010) | |
| 2009 | ||
| 61 | Michael Benedikt, James Cheney: Semantics, Types and Effects for XML Updates. DBPL 2009: 1-17 | |
| 60 | Clemens Ley, Michael Benedikt: How big must complete XML query languages be? ICDT 2009: 183-200 | |
| 59 | Michael Benedikt, Luc Segoufin: Regular tree languages definable in FO and in FOmod. ACM Trans. Comput. Log. 11(1): (2009) | |
| 58 | Michael Benedikt, Christoph Koch: From XQuery to relational logics. ACM Trans. Database Syst. 34(4): (2009) | |
| 57 | Michael Benedikt, Luc Segoufin: Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. 74(1): 168-186 (2009) | |
| 56 | Michael Benedikt, James Cheney: Schema-Based Independence Analysis for XML Updates. PVLDB 2(1): 61-72 (2009) | |
| 2008 | ||
| 55 | Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild: Stream firewalling of xml constraints. SIGMOD Conference 2008: 487-498 | |
| 54 | Michael Benedikt, Christoph Koch: XPath leashed. ACM Comput. Surv. 41(1): (2008) | |
| 53 | Michael Benedikt, Wenfei Fan, Floris Geerts: XPath satisfiability in the presence of DTDs. J. ACM 55(2): (2008) | |
| 52 | 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 | Michael Benedikt, Alan Jeffrey: Efficient and Expressive Tree Filters. FSTTCS 2007: 461-472 | |
| 50 | Michael Benedikt, Leonid Libkin, Frank Neven: Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2): (2007) | |
| 49 | Sihem Amer-Yahia, Michael Benedikt, Philip Bohannon: Challenges in Searching Online Communities. IEEE Data Eng. Bull. 30(2): 23-31 (2007) | |
| 48 | Michael Benedikt: Database Theory 2004. J. Comput. Syst. Sci. 73(3): 243-244 (2007) | |
| 2006 | ||
| 47 | Michael Benedikt, Philip Bohannon, Glenn Bruns: Data Cleaning for Decision Support. CleanDB 2006 | |
| 46 | Michael Benedikt, Christoph Koch: Interpreting Tree-to-Tree Queries. ICALP (2) 2006: 552-564 | |
| 45 | 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 | Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas: Verification of Tree Updates for Optimization. CAV 2005: 379-393 | |
| 43 | Michael Benedikt, Luc Segoufin: Towards a Characterization of Order-Invariant Queries over Tame Structures. CSL 2005: 276-291 | |
| 42 | Michael Benedikt, Irini Fundulaki: XML Subtree Queries: Specification and Composition. DBPL 2005: 138-153 | |
| 41 | Michael Benedikt: An Insider's Guide to Logic in Telecommunications Data. LICS 2005: 104-105 | |
| 40 | Michael Benedikt, Wenfei Fan, Floris Geerts: XPath satisfiability in the presence of DTDs. PODS 2005: 25-36 | |
| 39 | Michael Benedikt, Luc Segoufin: Regular Tree Languages Definable in FO. STACS 2005: 327-339 | |
| 38 | Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas: Adding Updates to XQuery: Semantics, Optimization, and Static Analysis. XIME-P 2005 | |
| 37 | 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 | Michael Benedikt, Wenfei Fan, Gabriel M. Kuper: Structural properties of XPath fragments. Theor. Comput. Sci. 336(1): 3-31 (2005) | |
| 2004 | ||
| 35 | Michael Benedikt, Glenn Bruns: On Guard: Producing Run-Time Checks from Integrity Constraints. AMAST 2004: 27-41 | |
| 34 | 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 | Michael Benedikt, Wenfei Fan, Gabriel M. Kuper: Structural Properties of XPath Fragments. ICDT 2003: 79-95 | |
| 32 | Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su: E-services: a look behind the curtain. PODS 2003: 1-14 | |
| 31 | 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 | 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 | 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 | Michael Benedikt, Leonid Libkin: Tree Extension Algebras: Logics, Automata, and Query Languages. LICS 2002: 203- | |
| 26 | 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 | Michael Benedikt, Leonid Libkin: Aggregate Operators in Constraint Query Languages. J. Comput. Syst. Sci. 64(3): 628-654 (2002) | |
| 2001 | ||
| 24 | 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-440 | |
| 22 | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: String Operations in Query Languages. PODS 2001 | |
| 2000 | ||
| 21 | 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 | Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin: Reachability and Connectivity Queries in Constraint Databases. PODS 2000: 104-115 | |
| 17 | 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 | Michael Benedikt, Thomas W. Reps, Shmuel Sagiv: A Decidable Logic for Describing Linked Data Structures. ESOP 1999: 2-19 | |
| 14 | 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 | 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 | 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 | 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 | Michael Benedikt, H. Jerome Keisler: Expressive Power of Unary Counters. ICDT 1997: 291-305 | |
| 5 | 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 | Michael Benedikt, Timothy Griffin, Leonid Libkin: Verifiable Properties of Database Transactions. PODS 1996: 117-127 | |
| 1 | Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong: Relational Expressive Power of Constraint Query Languages. PODS 1996: 5-16 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page