The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Benedikt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  51. Automata vs. Logics on Data Words. [Citation Graph (, )][DBLP]


  52. Semantics, Types and Effects for XML Updates. [Citation Graph (, )][DBLP]


  53. Analysis of declarative updates: invited talk. [Citation Graph (, )][DBLP]


  54. Efficient and Expressive Tree Filters. [Citation Graph (, )][DBLP]


  55. How big must complete XML query languages be? [Citation Graph (, )][DBLP]


  56. Positive higher-order queries. [Citation Graph (, )][DBLP]


  57. Stream firewalling of xml constraints. [Citation Graph (, )][DBLP]


  58. What You Must Remember When Processing Data Words. [Citation Graph (, )][DBLP]


  59. XPath leashed. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002