| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Michael Benedikt Michael Benedikt, Wenfei Fan , Gabriel M. Kuper : Structural Properties of XPath Fragments. ICDT 2003 : 79-95 Richard Hull , Michael Benedikt, Vassilis Christophides , Jianwen Su : E-services: a look behind the curtain. PODS 2003 : 1-14 Michael Benedikt, Chee Yong Chan , Wenfei Fan , Juliana Freire , Rajeev Rastogi : Capturing both Types and Constraints in Data Integration. SIGMOD Conference 2003 : 277-288 Michael Benedikt, Leonid Libkin , Thomas Schwentick , Luc Segoufin : Definable relations and first-order query languages over strings. J. ACM 50 (5): 694-751 (2003) Michael Benedikt, Martin Grohe , Leonid Libkin , Luc Segoufin : Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66 (1): 169-206 (2003) Michael Benedikt, H. Jerome Keisler : Definability with a predicate for a semi-linear set. J. Symb. Log. 68 (1): 319-351 (2003) Michael Benedikt, Leonid Libkin : Tree Extension Algebras: Logics, Automata, and Query Languages. LICS 2002 : 203- Michael Benedikt, Chee Yong Chan , Wenfei Fan , Rajeev Rastogi , Shihui Zheng , Aoying Zhou : DTD-Directed Publishing with Attribute Translation Grammars. VLDB 2002 : 838-849 Michael Benedikt, Leonid Libkin : Aggregate Operators in Constraint Query Languages. J. Comput. Syst. Sci. 64 (3): 628-654 (2002) Michael Benedikt, Patrice Godefroid , Thomas W. Reps : Model Checking of Unrestricted Hierarchical State Machines. ICALP 2001 : 652-666 Michael Benedikt, Leonid Libkin , Thomas Schwentick , Luc Segoufin : A Model-Theoretic Approach to Regular String Relations. LICS 2001 : 431- Michael Benedikt, Leonid Libkin , Thomas Schwentick , Luc Segoufin : String Operations in Query Languages. PODS 2001 Michael Benedikt, H. Jerome Keisler : Definability over Linear Constraints. CSL 2000 : 217-231 Michael Benedikt, Leonid Libkin : Query Safety with Constraints. Constraint Databases 2000 : 109-129 Michael Benedikt, Leonid Libkin : Expressive Power: The Finite Case. Constraint Databases 2000 : 55-87 Michael Benedikt, Martin Grohe , Leonid Libkin , Luc Segoufin : Reachability and Connectivity Queries in Constraint Databases. PODS 2000 : 104-115 Michael Benedikt, Leonid Libkin : Relational queries over interpreted structures. J. ACM 47 (4): 644-680 (2000) Michael Benedikt, Leonid Libkin : Safe Constraint Queries. SIAM J. Comput. 29 (5): 1652-1682 (2000) Michael Benedikt, Thomas W. Reps , Shmuel Sagiv : A Decidable Logic for Describing Linked Data Structures. ESOP 1999 : 2-19 Michael Benedikt, Leonid Libkin : Exact and Approximate Aggregation in Constraint Query. PODS 1999 : 102-113 Michael Benedikt: Hierarchies of Measure-Theoretic Ultrafilters. Ann. Pure Appl. Logic 97 (1-3): 203-219 (1999) John T. Baldwin , Michael Benedikt: Embedded Finite Models, Stability Theory and the Impact of Order. LICS 1998 : 490-500 Michael Benedikt, Leonid Libkin : Safe Constraint Queries. PODS 1998 : 99-108 Michael Benedikt, Timothy Griffin , Leonid Libkin : Verifiable Properties of Database Transactions. Inf. Comput. 147 (1): 57-88 (1998) Michael Benedikt, Guozhu Dong , Leonid Libkin , Limsoon Wong : Relational Expressive Power of Constraint Query Languages. J. ACM 45 (1): 1-34 (1998) Michael Benedikt: Ultrafilters which Extend Measures. J. Symb. Log. 63 (2): 638-662 (1998) Michael Benedikt, H. Jerome Keisler : Expressive Power of Unary Counters. ICDT 1997 : 291-305 Michael Benedikt, Leonid Libkin : Languages for Relational Databases over Interpreted Structures. PODS 1997 : 87-98 Michael Benedikt, H. Jerome Keisler : Expressive Power of Unary Counters. Structures in Logic and Computer Science 1997 : 34-50 Michael Benedikt, Leonid Libkin : On the Structure of Queries in Constraint Query Languages. LICS 1996 : 25-34 Michael Benedikt, Timothy Griffin , Leonid Libkin : Verifiable Properties of Database Transactions. PODS 1996 : 117-127 Michael Benedikt, Guozhu Dong , Leonid Libkin , Limsoon Wong : Relational Expressive Power of Constraint Query Languages. PODS 1996 : 5-16 1 [ 11 ] 2 [ 25 ] [ 30 ] 3 [ 31 ] 4 [ 1 ] [ 8 ] 5 [ 25 ] [ 30 ] [ 32 ] 6 [ 30 ] 7 [ 23 ] 8 [ 2 ] [ 9 ] 9 [ 17 ] [ 28 ] 10 [ 31 ] 11 [ 4 ] [ 6 ] [ 20 ] [ 27 ] 12 [ 32 ] 13 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 8 ] [ 9 ] [ 10 ] [ 13 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 21 ] [ 22 ] [ 24 ] [ 26 ] [ 28 ] [ 29 ] 14 [ 25 ] [ 30 ] 15 [ 14 ] [ 23 ] 16 [ 14 ] 17 [ 21 ] [ 22 ] [ 29 ] 18 [ 17 ] [ 21 ] [ 22 ] [ 28 ] [ 29 ] 19 [ 31 ] 20 [ 1 ] [ 8 ] 21 [ 25 ] 22 [ 25 ]  ©2004 Association for Computing Machinery |
