dblp.uni-trier.dewww.uni-trier.de

Klaus Reinhardt

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
33EEKlaus Reinhardt: The Simple Reachability Problem in Switch Graphs. SOFSEM 2009: 461-472
2008
32EEKlaus Reinhardt: Reachability in Petri Nets with Inhibitor Arcs. Electr. Notes Theor. Comput. Sci. 223: 239-264 (2008)
2007
31EEOswin Aichholzer, Klaus Reinhardt: A quadratic distance bound on sliding between crossing-free spanning trees. Comput. Geom. 37(3): 155-161 (2007)
30EEKlaus Reinhardt: A Tree-Height Hierarchy of Context-Free Languages. Int. J. Found. Comput. Sci. 18(6): 1383-1394 (2007)
29 Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. Journal of Automata, Languages and Combinatorics 12(1-2): 117-138 (2007)
2006
28EEBernd Borchert, Klaus Reinhardt: Searching Paths of Constant Bandwidth. SOFSEM 2006: 187-196
2003
27 Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt: On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9
2002
26 Rolf Niedermeier, Klaus Reinhardt, Peter Sanders: Towards optimal locality in mesh-indexings. Discrete Applied Mathematics 117(1-3): 211-237 (2002)
2001
25EEKlaus Reinhardt: The Complexity of Translating Logic to Finite Automata. Automata, Logics, and Infinite Games 2001: 231-238
24EEKlaus Reinhardt: The #a = #b Pictures Are Recognizable. STACS 2001: 527-538
2000
23 Klaus Reinhardt, Eric Allender: Making Nondeterminism Unambiguous. SIAM J. Comput. 29(4): 1118-1131 (2000)
1999
22EEPierre McKenzie, Klaus Reinhardt, V. Vinay: Circuits and Context-Free Languages. COCOON 1999: 194-203
21 Henning Fernau, Klaus Reinhardt, Ludwig Staiger: Decidability of code properties. Developments in Language Theory 1999: 153-163
20EEKlaus Reinhardt: A Parallel Context-Free Derivation Hierarchy. FCT 1999: 441-450
19EEManfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica 25(4): 438-458 (1999)
18 Eric Allender, Klaus Reinhardt, Shiyu Zhou: Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. J. Comput. Syst. Sci. 59(2): 164-181 (1999)
1998
17EEEric Allender, Klaus Reinhardt: Isolation, Matching, and Counting. IEEE Conference on Computational Complexity 1998: 92-100
16EEKlaus Reinhardt: On Some Recognizable Picture-Languages. MFCS 1998: 760-770
15EEEric Allender, Klaus Reinhardt: Isolation, Matching, and Counting Electronic Colloquium on Computational Complexity (ECCC) 5(19): (1998)
1997
14 Rolf Niedermeier, Klaus Reinhardt, Peter Sanders: Towards Optimal Locality in Mesh-Indexings. FCT 1997: 364-375
13EEKlaus Reinhardt, Eric Allender: Making Nondeterminism Unambiguous. FOCS 1997: 244-253
12 Klaus Reinhardt: Strict Sequential P-completeness. STACS 1997: 329-338
11EEKlaus Reinhardt, Eric Allender: Making Nondeterminism Unambiguous Electronic Colloquium on Computational Complexity (ECCC) 4(14): (1997)
1996
10 Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt: Advocating Ownership. FSTTCS 1996: 286-297
1995
9 Klaus Reinhardt: On the Synchronization of Semi-Traces. FCT 1995: 393-403
8 Volker Diekert, Anca Muscholl, Klaus Reinhardt: On Codings of Traces. STACS 1995: 385-396
7 Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Average Case Sorting on Arrays. STACS 1995: 503-514
6 Michael Bertol, Klaus Reinhardt: The Tautologies over a Finite Set are Context-Free. Bulletin of the EATCS 57: (1995)
1994
5 Klaus-Jörn Lange, Klaus Reinhardt: Empty Alternation. MFCS 1994: 494-503
4 Volker Diekert, Edward Ochmanski, Klaus Reinhardt: On Confluent Semi-commutations: Decidability and Complexity Results Inf. Comput. 110(1): 164-182 (1994)
1992
3 Klaus Reinhardt: Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(logn) Comparisons and epsilon n log n + O(1) Transports. ISAAC 1992: 489-498
1991
2 Volker Diekert, Edward Ochmanski, Klaus Reinhardt: On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241
1990
1 Klaus Reinhardt: Hierarchies over the Context-Free Languages. IMYCS 1990: 214-224

Coauthor Index

1Oswin Aichholzer [31]
2Eric Allender [11] [13] [15] [17] [18] [23]
3Michael Bertol [6]
4Bernd Borchert [28]
5Volker Diekert [2] [4] [8]
6Henning Fernau [10] [21] [27] [29]
7Rudolf Freund [29]
8Torben Hagerup [27]
9Manfred Kunde [7] [19]
10Klaus-Jörn Lange [5] [10]
11Pierre McKenzie [22]
12Anca Muscholl [8]
13Rolf Niedermeier [7] [14] [19] [26]
14Naomi Nishimura [27]
15Edward Ochmanski [2] [4]
16Marion Oswald [29]
17Prabhakar Ragde [27]
18Peter Rossmanith [7] [19]
19Peter Sanders [14] [26]
20Ludwig Staiger [21]
21V. Vinay [22]
22Shiyu Zhou [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)