Klaus Reinhardt

Publication Activity (10 Years)

Years Active: 1990-2019
Publications (10 Years): 4

Top Venues

CoRR

Chic. J. Theor. Comput. Sci.

FCCM

Developments in Language Theory

University of Stuttgart, Germany (PHD)

Education History

University of Stuttgart, Germany

PHD

Publications

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

Klaus Reinhardt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Klaus Reinhardt