Thomas Schwentick Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenrik Björklund, Thomas Schwentick: On notions of regularity for data languages. Theor. Comput. Sci. 411(4-5): 702-715 (2010)
2009
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick: Tree Projections: Game Characterization and Computational Aspects. Graph Theory, Computational Intelligence and Thought 2009: 217-226
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmet Kara, Volker Weber, Martin Lange, Thomas Schwentick: On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWouter Gelade, Marcel Marquardt, Thomas Schwentick: The Dynamic Complexity of Formal Languages. STACS 2009: 481-492
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmet Kara, Martin Lange, Thomas Schwentick, Volker Weber: On the Hybrid Extension of CTL and CTL+ CoRR abs/0906.2541: (2009)
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. J. ACM 56(3): (2009)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56(6): (2009)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Henrik Björklund: Volker Weber. Journal of Logic, Language and Information 18(4): 433 (2009)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Dan Suciu: Foreword. Theory Comput. Syst. 44(4): 501-502 (2009)
2008
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenrik Björklund, Wim Martens, Thomas Schwentick: Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). STACS 2008: 17-18
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Dan Suciu: Introduction to ICDT 2007 special section. ACM Trans. Database Syst. 33(4): (2008)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of Hybrid Logics over Transitive Frames CoRR abs/0806.4130: (2008)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWouter Gelade, Marcel Marquardt, Thomas Schwentick: Dynamic Complexity of Formal Languages CoRR abs/0812.1915: (2008)
2007
82no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: Circuits, Logic, and Games, 08.11. - 10.11.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
81no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Dan Suciu: Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings Springer 2007
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive Query Containment over Trees. DBPL 2007: 66-80
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenrik Björklund, Thomas Schwentick: On Notions of Regularity for Data Languages. FCT 2007: 88-99
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: np-hardness and tractable variants. PODS 2007: 13-22
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGjergji Kasneci, Thomas Schwentick: The complexity of reasoning about pattern-based XML schemas. PODS 2007: 155-164
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Volker Weber: Bounded-Variable Fragments of Hybrid Logics. STACS 2007: 561-572
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Automata for XML - A survey. J. Comput. Syst. Sci. 73(3): 289-315 (2007)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007)
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVolker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. Theory Comput. Syst. 40(4): 355-377 (2007)
2006
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin: Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David: Two-Variable Logic on Words with Data. LICS 2006: 7-16
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls: Inference of Concise DTDs from XML Data. VLDB 2006: 115-126
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables CoRR abs/cs/0606065: (2006)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3): (2006)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006)
2005
61no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick, Dan Suciu: Foundations of Semistructured Data, 6.-11. February 2005 IBFI, Schloss Dagstuhl, Germany 2005
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKumar Neeraj Verma, Helmut Seidl, Thomas Schwentick: On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick, Dan Suciu: 05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick, Dan Suciu: 05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVolker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. STACS 2005: 256-268
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721
2004
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl: Counting in Trees for Free. ICALP 2004: 1136-1149
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Trees, Automata and XML. PODS 2004: 222
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. STACS 2004: 452-464
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick, Victor Vianu: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: XPath query containment. SIGMOD Record 33(1): 101-109 (2004)
2003
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326
45no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNils Klarlund, Thomas Schwentick, Dan Suciu: XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Thomas Schwentick, Anca Muscholl: Numerical document queries. PODS 2003: 155-166
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003)
2002
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEtienne Grandjean, Thomas Schwentick: Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. SIAM J. Comput. 32(1): 196-230 (2002)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002)
2001
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Eiter, Georg Gottlob, Thomas Schwentick: Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001: 37-56
37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick, Victor Vianu: Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: String Operations in Query Languages. PODS 2001
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Grohe, Thomas Schwentick, Luc Segoufin: When is the evaluation of conjunctive queries tractable? STOC 2001: 657-666
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving equations in the relational algebra CoRR cs.LO/0106034: (2001)
31no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)
2000
30no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Logically defined queries on trees. Grundlagen von Datenbanken 2000: 96-100
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: On the Power of Tree-Walking Automata. ICALP 2000: 547-560
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The Many Faces of a Translation. ICALP 2000: 890-901
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: On Diving in Trees. MFCS 2000: 660-669
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Grohe, Thomas Schwentick: Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1(1): 112-130 (2000)
1999
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neven, Thomas Schwentick: Query Automata. PODS 1999: 205-214
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Nicole Schweikardt, Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discrete Mathematics & Theoretical Computer Science 3(3): 109-124 (1999)
1998
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Descriptive Complexity, Lower Bounds and Linear Time. CSL 1998: 9-28
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Grohe, Thomas Schwentick: Locality of Order-Invariant First-Order Formulas. MFCS 1998: 437-445
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. STACS 1998: 444-454
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL CoRR cs.CC/9809114: (1998)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL Electronic Colloquium on Computational Complexity (ECCC) 5(59): (1998)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Thomas Schwentick, Iain A. Stewart: Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998)
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArnaud Durand, Clemens Lautemann, Thomas Schwentick: Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998)
1997
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Padding and the Expressive Power of Existential Second-Order Logics. CSL 1997: 461-477
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Algebraic and Logical Characterizations of Deterministic Linear Time Classes. STACS 1997: 463-474
1996
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Thomas Schwentick, Iain A. Stewart: On Positive P. IEEE Conference on Computational Complexity 1996: 162-170
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: On Bijections vs. Unary Functions. STACS 1996: 415-426
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Logic 79(1): 61-92 (1996)
1995
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. ICALP 1995: 405-416
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán: The Power of the Middle Bit of a #P Function. J. Comput. Syst. Sci. 50(3): 456-467 (1995)
1994
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Thomas Schwentick, Denis Thérien: Logics For Context-Free Languages. CSL 1994: 205-216
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick: Graph Connectivity and Monadic NP FOCS 1994: 614-622
1993
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Structure in Complexity Theory Conference 1993: 200-207
1992
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Bit-Reductions Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28: (1992)

Coauthor Index

1Klaus Barthelmann [16] [19]
2Michael Benedikt [35] [37] [42]
3Geert Jan Bex [55] [66] [67]
4Joachim Biskup [32] [48]
5Henrik Björklund [79] [80] [87] [90] [97]
6Mikolaj Bojanczyk [68] [69] [70] [92]
7Jan Van den Bussche [32] [48]
8Claire David [68] [69]
9Arnaud Durand [12]
10Thomas Eiter [38]
11Wouter Gelade [83] [94]
12Georg Gottlob [30] [38] [49] [78] [91] [96]
13Etienne Grandjean [41]
14Gianluigi Greco [96]
15Frederic Green [5]
16Martin Grohe [17] [24] [34]
17Peter Habermehl [54]
18Ulrich Hertrampf [1] [2]
19Ahmet Kara [93] [95]
20Gjergji Kasneci [77]
21Nils Klarlund [45]
22Johannes Köbler [5]
23Phokion G. Kolaitis [30] [49]
24Martin Lange [93] [95]
25Clemens Lautemann [1] [2] [4] [9] [12] [13] [14] [15] [20] [21] [31]
26Leonid Libkin [35] [37] [42]
27Marcel Marquardt [83] [94]
28Wim Martens [53] [55] [57] [66] [74] [80] [87] [89]
29Pierre McKenzie [14] [15] [20] [27] [31] [64]
30Zoltán Miklós [78] [91] [96]
31Martin Mundhenk [84]
32Anca Muscholl [44] [51] [54] [62] [68] [69] [92]
33Frank Neven [22] [23] [25] [28] [33] [36] [40] [43] [46] [50] [53] [55] [57] [58] [59] [61] [63] [65] [66] [67] [74] [89]
34Jan Paredaens [32] [48]
35Kenneth W. Regan [5]
36Mathias Samuelides [70]
37Francesco Scarcello [96]
38Thomas Schneider [84]
39Nicole Schweikardt [21]
40Luc Segoufin [34] [35] [37] [42] [51] [62] [68] [69] [70] [92]
41Helmut Seidl [44] [54] [60]
42Iain A. Stewart [9] [13]
43Dan Suciu [45] [58] [59] [61] [81] [85] [88]
44Denis Thérien [4] [27] [39] [64] [71] [72] [82]
45Jacobo Torán [5]
46Karl Tuyls [67]
47Kumar Neeraj Verma [60]
48Victor Vianu [36] [50]
49Heribert Vollmer [1] [2] [14] [15] [20] [27] [31] [39] [64] [71] [72] [82]
50Klaus W. Wagner [1] [2]
51Volker Weber [56] [73] [76] [84] [93] [95]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)