The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Thomas Schwentick: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank Neven, Thomas Schwentick
    Query Automata. [Citation Graph (4, 14)][DBLP]
    PODS, 1999, pp:205-214 [Conf]
  2. Frank Neven, Thomas Schwentick
    Expressive and Efficient Pattern Languages for Tree-Structured Data. [Citation Graph (1, 17)][DBLP]
    PODS, 2000, pp:145-156 [Conf]
  3. Martin Grohe, Thomas Schwentick
    Locality of order-invariant first-order formulas. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Comput. Log., 2000, v:1, n:1, pp:112-130 [Journal]
  4. Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
    On the Complexity of Equational Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:337-352 [Conf]
  5. Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
    On the Power of Polynomial Time Bit-Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:200-207 [Conf]
  6. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
    On Positive P. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:162-170 [Conf]
  7. Clemens Lautemann, Thomas Schwentick, Denis Thérien
    Logics For Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:205-216 [Conf]
  8. Thomas Schwentick
    Padding and the Expressive Power of Existential Second-Order Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:461-477 [Conf]
  9. Thomas Schwentick
    Descriptive Complexity, Lower Bounds and Linear Time. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:9-28 [Conf]
  10. Nils Klarlund, Thomas Schwentick, Dan Suciu
    XML: Model, Schemas, Types, Logics, and Queries. [Citation Graph (0, 0)][DBLP]
    Logics for Emerging Applications of Databases, 2003, pp:1-41 [Conf]
  11. Frank Neven, Thomas Schwentick, Dan Suciu
    05061 Abstracts Collection - Foundations of Semistructured Data. [Citation Graph (0, 0)][DBLP]
    Foundations of Semistructured Data, 2005, pp:- [Conf]
  12. Frank Neven, Thomas Schwentick, Dan Suciu
    05061 Summary - Foundations of Semi-structured Data. [Citation Graph (0, 0)][DBLP]
    Foundations of Semistructured Data, 2005, pp:- [Conf]
  13. Thomas Eiter, Georg Gottlob, Thomas Schwentick
    Second-Order Logic over Strings: Regular and Non-regular Fragments. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:37-56 [Conf]
  14. Thomas Schwentick, Denis Thérien, Heribert Vollmer
    Partially-Ordered Two-Way Automata: A New Characterization of DA. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:239-250 [Conf]
  15. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:664-674 [Conf]
  16. Thomas Schwentick
    Graph Connectivity and Monadic NP [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:614-622 [Conf]
  17. Frank Neven, Thomas Schwentick
    Automata for Unary Queries on Trees. [Citation Graph (0, 0)][DBLP]
    Grundlagen von Datenbanken, 1999, pp:102-106 [Conf]
  18. Thomas Schwentick
    Logically defined queries on trees. [Citation Graph (0, 0)][DBLP]
    Grundlagen von Datenbanken, 2000, pp:96-100 [Conf]
  19. Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
    Expressive Power of Pebble Automata. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:157-168 [Conf]
  20. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
    The Many Faces of a Translation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:890-901 [Conf]
  21. Frank Neven, Thomas Schwentick
    On the Power of Tree-Walking Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:547-560 [Conf]
  22. Thomas Schwentick
    Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:405-416 [Conf]
  23. Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
    Counting in Trees for Free. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1136-1149 [Conf]
  24. Frank Neven, Thomas Schwentick
    XPath Containment in the Presence of Disjunction, DTDs, and Variables. [Citation Graph (0, 0)][DBLP]
    ICDT, 2003, pp:312-326 [Conf]
  25. Wim Martens, Frank Neven, Thomas Schwentick
    Which XML Schemas Admit 1-Pass Preorder Typing? [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:68-82 [Conf]
  26. 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]
  27. Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
    Two-Variable Logic on Words with Data. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:7-16 [Conf]
  28. Martin Grohe, Thomas Schwentick
    Locality of Order-Invariant First-Order Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:437-445 [Conf]
  29. Wim Martens, Frank Neven, Thomas Schwentick
    Complexity of Decision Problems for Simple Regular Expressions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:889-900 [Conf]
  30. Frank Neven, Thomas Schwentick, Victor Vianu
    Towards Regular Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:560-572 [Conf]
  31. Thomas Schwentick
    On Diving in Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:660-669 [Conf]
  32. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
    String Operations in Query Languages. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  33. Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
    Two-variable logic on data trees and XML reasoning. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:10-19 [Conf]
  34. Thomas Schwentick
    Trees, Automata and XML. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:222- [Conf]
  35. Helmut Seidl, Thomas Schwentick, Anca Muscholl
    Numerical document queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:155-166 [Conf]
  36. Frank Neven, Thomas Schwentick
    Automata-and Logic-Based Pattern Languages for Tree-Structured Data. [Citation Graph (0, 0)][DBLP]
    Semantics in Databases, 2001, pp:160-178 [Conf]
  37. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:444-454 [Conf]
  38. Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick
    A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:143-152 [Conf]
  39. Anca Muscholl, Thomas Schwentick, Luc Segoufin
    Active Context-Free Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:452-464 [Conf]
  40. Thomas Schwentick
    On Bijections vs. Unary Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:415-426 [Conf]
  41. Thomas Schwentick
    Algebraic and Logical Characterizations of Deterministic Linear Time Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:463-474 [Conf]
  42. Thomas Schwentick, Klaus Barthelmann
    Local Normal Forms for First-Order Logic with Applications to Games and Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:444-454 [Conf]
  43. Volker Weber, Thomas Schwentick
    Dynamic Complexity Theory Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:256-268 [Conf]
  44. Thomas Schwentick, Volker Weber
    Bounded-Variable Fragments of Hybrid Logics. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:561-572 [Conf]
  45. Martin Grohe, Thomas Schwentick, Luc Segoufin
    When is the evaluation of conjunctive queries tractable? [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:657-666 [Conf]
  46. Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls
    Inference of Concise DTDs from XML Data. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:115-126 [Conf]
  47. Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick
    Expressiveness of XSDs: from practice to theory, there and back again. [Citation Graph (0, 0)][DBLP]
    WWW, 2005, pp:712-721 [Conf]
  48. Thomas Schwentick
    On Winning Ehrenfeucht Games and Monadic NP. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:79, n:1, pp:61-92 [Journal]
  49. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The descriptive complexity approach to LOGCFL [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  50. Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche
    Solving equations in the relational algebra [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  51. Thomas Schwentick, Klaus Barthelmann
    Local Normal Forms for First-Order Logic with Applications to Games and Automata. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:3, pp:109-124 [Journal]
  52. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The Descriptive Complexity Approach to LOGCFL [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:59, pp:- [Journal]
  53. Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
    Positive Versions of Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:147, n:2, pp:145-170 [Journal]
  54. Frank Neven, Thomas Schwentick
    On the power of tree-walking automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:86-103 [Journal]
  55. 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]
  56. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential second-order logic over graphs: Charting the tractability frontier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:312-362 [Journal]
  57. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
    The Power of the Middle Bit of a #P Function. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:456-467 [Journal]
  58. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
    The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:629-652 [Journal]
  59. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
    The many faces of a translation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:163-179 [Journal]
  60. Thomas Schwentick
    Automata for XML - A survey. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:3, pp:289-315 [Journal]
  61. Frank Neven, Thomas Schwentick
    On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:3, pp:- [Journal]
  62. Arnaud Durand, Clemens Lautemann, Thomas Schwentick
    Subclasses of Binary NP. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1998, v:8, n:2, pp:189-207 [Journal]
  63. Anca Muscholl, Thomas Schwentick, Luc Segoufin
    Active Context-Free Games. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:237-276 [Journal]
  64. Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche
    Solving Equations in the Relational Algebra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1052-1066 [Journal]
  65. Etienne Grandjean, Thomas Schwentick
    Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:196-230 [Journal]
  66. Thomas Schwentick
    XPath query containment. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2004, v:33, n:1, pp:101-109 [Journal]
  67. Frank Neven, Thomas Schwentick
    Query automata over finite trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:633-674 [Journal]
  68. Frank Neven, Thomas Schwentick, Victor Vianu
    Finite state machines for strings over infinite alphabets. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:3, pp:403-435 [Journal]
  69. Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex
    Expressiveness and complexity of XML Schema. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:3, pp:770-813 [Journal]
  70. Henrik Björklund, Wim Martens, Thomas Schwentick
    Conjunctive Query Containment over Trees. [Citation Graph (0, 0)][DBLP]
    DBPL, 2007, pp:66-80 [Conf]
  71. Henrik Björklund, Thomas Schwentick
    On Notions of Regularity for Data Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:88-99 [Conf]
  72. Georg Gottlob, Zoltán Miklós, Thomas Schwentick
    Generalized hypertree decompositions: np-hardness and tractable variants. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:13-22 [Conf]
  73. Gjergji Kasneci, Thomas Schwentick
    The complexity of reasoning about pattern-based XML schemas. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:155-164 [Conf]
  74. Frank Neven, Thomas Schwentick
    On the complexity of XPath containment in the presence of disjunction, DTDs, and variables [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  75. Volker Weber, Thomas Schwentick
    Dynamic Complexity Theory Revisited. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:355-377 [Journal]

  76. Tree Projections: Game Characterization and Computational Aspects. [Citation Graph (, )][DBLP]


  77. The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. [Citation Graph (, )][DBLP]


  78. Two-Variable Logic with Two Order Relations - (Extended Abstract). [Citation Graph (, )][DBLP]


  79. 06451 Executive Summary -- Circuits, Logic, and Games . [Citation Graph (, )][DBLP]


  80. 06451 Abstracts Collection -- Circuits, Logic, and Games . [Citation Graph (, )][DBLP]


  81. Optimizing Conjunctive Queries over Trees Using Schema Information. [Citation Graph (, )][DBLP]


  82. On the Hybrid Extension of CTL and CTL+. [Citation Graph (, )][DBLP]


  83. Schema design for XML repositories: complexity and tractability. [Citation Graph (, )][DBLP]


  84. A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). [Citation Graph (, )][DBLP]


  85. Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  86. The Dynamic Complexity of Formal Languages. [Citation Graph (, )][DBLP]


  87. Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  88. Complexity of Hybrid Logics over Transitive Frames [Citation Graph (, )][DBLP]


  89. Dynamic Complexity of Formal Languages [Citation Graph (, )][DBLP]


  90. On the Hybrid Extension of CTL and CTL+ [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.024secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002