Klaus Reinhardt

According to our database, Klaus Reinhardt authored at least 42 papers between 1990 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Alternating, private alternating, and quantum alternating realtime automata.

Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz

Log. Methods Comput. Sci., 2019

2017

Undecidability of the emptiness problem for context-free picture languages.

Daniel Prusa, Klaus Reinhardt

Theor. Comput. Sci., 2017

2016

New Results on the Minimum Amount of Useful Space.

Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz

Int. J. Found. Comput. Sci., 2016

2015

Regular Languages Are Church-Rosser Congruential.

Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter

J. ACM, 2015

2014

Classical and quantum realtime alternating automata.

H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

MPFC: Massively Parallel Firewall Circuits.

Sven Hager, Frank Winkler, Björn Scheuermann, Klaus Reinhardt

Proceedings of the IEEE 39th Conference on Local Computer Networks, 2014

Building Optimized Packet Filters with COFFi.

Sven Hager, Frank Winkler, Björn Scheuermann, Klaus Reinhardt

Proceedings of the 22nd IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2014

The Minimum Amount of Useful Space: New Results and New Directions.

Klaus Reinhardt, Abuzer Yakaryilmaz

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

Few Product Gates but Many Zeroes.

Bernd Borchert, Pierre McKenzie, Klaus Reinhardt

Chic. J. Theor. Comput. Sci., 2013

2009

The Simple Reachability Problem in Switch Graphs.

Klaus Reinhardt

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Few Product Gates But Many Zeros.

Bernd Borchert, Pierre McKenzie, Klaus Reinhardt

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Reachability in Petri Nets with Inhibitor Arcs.

Klaus Reinhardt

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

2007

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.

Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt

J. Autom. Lang. Comb., 2007

Decidability of code properties.

Henning Fernau, Klaus Reinhardt, Ludwig Staiger

RAIRO Theor. Informatics Appl., 2007

A Tree-Height Hierarchy of Context-Free Languages.

Klaus Reinhardt

Int. J. Found. Comput. Sci., 2007

A quadratic distance bound on sliding between crossing-free spanning trees.

Oswin Aichholzer, Klaus Reinhardt

Comput. Geom., 2007

Deterministically and Sudoku-Deterministically Recognizable Picture Languages.

Bernd Borchert, Klaus Reinhardt

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

Searching Paths of Constant Bandwidth.

Bernd Borchert, Klaus Reinhardt

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005

Refining the Nonterminal Complexity of Graph-controlled Grammars.

Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2003

On the parameterized complexity of the generalized rush hour puzzle.

Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Towards optimal locality in mesh-indexings.

Rolf Niedermeier, Klaus Reinhardt, Peter Sanders

Discret. Appl. Math., 2002

2001

The #a = #b Pictures Are Recognizable.

Klaus Reinhardt

Proceedings of the STACS 2001, 2001

The Complexity of Translating Logic to Finite Automata.

Klaus Reinhardt

Proceedings of the Automata, 2001

2000

Making Nondeterminism Unambiguous.

Klaus Reinhardt, Eric Allender

SIAM J. Comput., 2000

1999

Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds.

Eric Allender, Klaus Reinhardt, Shiyu Zhou

J. Comput. Syst. Sci., 1999

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.

Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith

Algorithmica, 1999

A Parallel Context-Free Derivation Hierarchy.

Klaus Reinhardt

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Circuits and Context-Free Languages.

Pierre McKenzie, Klaus Reinhardt, V. Vinay

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Isolation, Matching, and Counting

Eric Allender, Klaus Reinhardt

Electron. Colloquium Comput. Complex., 1998

On Some Recognizable Picture-Languages.

Klaus Reinhardt

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Strict Sequential P-completeness.

Klaus Reinhardt

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996

Advocating Ownership.

Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

Set Automata.

Klaus-Jörn Lange, Klaus Reinhardt

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

The Tautologies over a Finite Set are Context-Free.

Michael Bertol, Klaus Reinhardt

Bull. EATCS, 1995

Optimal Average Case Sorting on Arrays.

Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith

Proceedings of the STACS 95, 1995

On Codings of Traces.

Volker Diekert, Anca Muscholl, Klaus Reinhardt

Proceedings of the STACS 95, 1995

On the Synchronization of Semi-Traces.

Klaus Reinhardt

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

On Confluent Semi-commutations: Decidability and Complexity Results

Volker Diekert, Edward Ochmanski, Klaus Reinhardt

Inf. Comput., April, 1994

Empty Alternation.

Klaus-Jörn Lange, Klaus Reinhardt

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Prioritätszählerautomaten und die Synchronisation von Halbspursprachen.

Klaus Reinhardt

PhD thesis, 1994

1992

Sorting <i>In-Place</i> with a <i>Worst Case</i> Complexity of <i>n</i> log <i>n</i>-1.3<i>n</i> + <i>O</i>(log<i>n</i>) Comparisons and epsilon <i>n</i> log <i>n</i> + <i>O</i>(1) Transports.

Klaus Reinhardt

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1990

Hierarchies over the Context-Free Languages.

Klaus Reinhardt

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990