Klaus Reinhardt

56 papers A* 2A 5B 10C 4Misc 2Journal 22Unranked 10
YearRankTypeTitle / Venue / Authors
2025 — conf
Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases.
SAND
Julia Meusel, Matthias Müller-Hannemann, Klaus Reinhardt
2025 C conf
Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases.
ATMOS
Julia Meusel, Matthias Müller-Hannemann, Klaus Reinhardt
2025 J jnl
Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases.
CoRR
Julia Meusel, Matthias Müller-Hannemann, Klaus Reinhardt
2019 J jnl
Alternating, private alternating, and quantum alternating realtime automata.
Log. Methods Comput. Sci.
Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2017 J jnl
Undecidability of the emptiness problem for context-free picture languages.
Theor. Comput. Sci.
Daniel Prusa, Klaus Reinhardt
2016 J jnl
New Results on the Minimum Amount of Useful Space.
Int. J. Found. Comput. Sci.
Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz
2015 J jnl
Regular Languages Are Church-Rosser Congruential.
J. ACM
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
2014 Misc conf
Building Optimized Packet Filters with COFFi.
FCCM
Sven Hager, Frank Winkler, Björn Scheuermann, Klaus Reinhardt
2014 — conf
Classical and quantum realtime alternating automata.
NCMA
H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2014 J jnl
Classical and quantum realtime alternating automata.
CoRR
H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2014 B conf
MPFC: Massively Parallel Firewall Circuits.
LCN
Sven Hager, Frank Winkler, Björn Scheuermann, Klaus Reinhardt
2014 C conf
The Minimum Amount of Useful Space: New Results and New Directions.
Developments in Language Theory
Klaus Reinhardt, Abuzer Yakaryilmaz
2014 J jnl
The minimum amount of useful space: New results and new directions.
CoRR
Klaus Reinhardt, Abuzer Yakaryilmaz
2013 J jnl
Few Product Gates but Many Zeroes.
Chic. J. Theor. Comput. Sci.
Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
2012 — conf
Regular Languages Are Church-Rosser Congruential.
ICALP (2)
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
2012 J jnl
Regular Languages are Church-Rosser Congruential
CoRR
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
2009 B conf
Few Product Gates But Many Zeros.
MFCS
Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
2009 B conf
The Simple Reachability Problem in Switch Graphs.
SOFSEM
Klaus Reinhardt
2008 — conf
Reachability in Petri Nets with Inhibitor Arcs.
RP
Klaus Reinhardt
2007 J jnl
A Tree-Height Hierarchy of Context-Free Languages.
Int. J. Found. Comput. Sci.
Klaus Reinhardt
2007 J jnl
A quadratic distance bound on sliding between crossing-free spanning trees.
Comput. Geom.
Oswin Aichholzer, Klaus Reinhardt
2007 J jnl
Decidability of code properties.
RAIRO Theor. Informatics Appl.
Henning Fernau, Klaus Reinhardt, Ludwig Staiger
2007 C conf
Deterministically and Sudoku-Deterministically Recognizable Picture Languages.
LATA
Bernd Borchert, Klaus Reinhardt
2007 J jnl
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
J. Autom. Lang. Comb.
Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt
2006 B conf
Searching Paths of Constant Bandwidth.
SOFSEM
Bernd Borchert, Klaus Reinhardt
2005 — conf
Refining the Nonterminal Complexity of Graph-controlled Grammars.
DCFS
Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt
2003 — conf
On the parameterized complexity of the generalized rush hour puzzle.
CCCG
Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
2002 J jnl
Towards optimal locality in mesh-indexings.
Discret. Appl. Math.
Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
2001 A conf
The #a = #b Pictures Are Recognizable.
STACS
Klaus Reinhardt
2001 — conf
The Complexity of Translating Logic to Finite Automata.
Automata, Logics, and Infinite Games
Klaus Reinhardt
2000 J jnl
Making Nondeterminism Unambiguous.
SIAM J. Comput.
Klaus Reinhardt, Eric Allender
1999 B conf
A Parallel Context-Free Derivation Hierarchy.
FCT
Klaus Reinhardt
1999 Misc conf
Circuits and Context-Free Languages.
COCOON
Pierre McKenzie, Klaus Reinhardt, V. Vinay
1999 C conf
Decidability of code properties.
Developments in Language Theory
Henning Fernau, Klaus Reinhardt, Ludwig Staiger
1999 J jnl
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds.
J. Comput. Syst. Sci.
Eric Allender, Klaus Reinhardt, Shiyu Zhou
1999 J jnl
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.
Algorithmica
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1998 J jnl
Isolation, Matching, and Counting
Electron. Colloquium Comput. Complex.
Eric Allender, Klaus Reinhardt
1998 A conf
Isolation, Matching, and Counting.
CCC
Eric Allender, Klaus Reinhardt
1998 B conf
On Some Recognizable Picture-Languages.
MFCS
Klaus Reinhardt
1997 J jnl
Making Nondeterminism Unambiguous
Electron. Colloquium Comput. Complex.
Klaus Reinhardt, Eric Allender
1997 A* conf
Making Nondeterminism Unambiguous.
FOCS
Klaus Reinhardt, Eric Allender
1997 A conf
Strict Sequential P-completeness.
STACS
Klaus Reinhardt
1997 B conf
Towards Optimal Locality in Mesh-Indexings.
FCT
Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
1996 — conf
Advocating Ownership.
FSTTCS
Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
1996 — conf
Set Automata.
DMTCS
Klaus-Jörn Lange, Klaus Reinhardt
1995 A conf
On Codings of Traces.
STACS
Volker Diekert, Anca Muscholl, Klaus Reinhardt
1995 B conf
On the Synchronization of Semi-Traces.
FCT
Klaus Reinhardt
1995 A conf
Optimal Average Case Sorting on Arrays.
STACS
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
1995 J jnl
The Tautologies over a Finite Set are Context-Free.
Bull. EATCS
Michael Bertol, Klaus Reinhardt
1994 B conf
Empty Alternation.
MFCS
Klaus-Jörn Lange, Klaus Reinhardt
1994 J jnl
On Confluent Semi-commutations: Decidability and Complexity Results
Inf. Comput.
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1994 — —
Prioritätszählerautomaten und die Synchronisation von Halbspursprachen.
Klaus Reinhardt
1992 B conf
Sorting
ISAAC
Klaus Reinhardt
1991 A* conf
On Confluent Semi-Commutations - Decidability and Complexity Results.
ICALP
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1990 — conf
Hierarchies over the Context-Free Languages.
IMYCS
Klaus Reinhardt
1990 J jnl
On confluent semi-commutations: decidability and complexity results
Forschungsberichte, TU Munich
Volker Diekert, Edward Ochmanski, Klaus Reinhardt