Hierarchies over the Context-Free Languages. - Klaus Reinhardt (IMYCS, 1990)

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. - Klaus Reinhardt (ISAAC, 1992)

Prioritätszählerautomaten und die Synchronisation von Halbspursprachen. - Klaus Reinhardt (1994)

Empty Alternation. - Klaus-Jörn Lange; Klaus Reinhardt (MFCS, 1994)

On Confluent Semi-commutations: Decidability and Complexity Results - Volker Diekert; Edward Ochmanski; Klaus Reinhardt (Inf. Comput., 1994)

On the Synchronization of Semi-Traces. - Klaus Reinhardt (FCT, 1995)

On Codings of Traces. - Volker Diekert; Anca Muscholl; Klaus Reinhardt (STACS, 1995)

Optimal Average Case Sorting on Arrays. - Manfred Kunde; Rolf Niedermeier; Klaus Reinhardt; Peter Rossmanith (STACS, 1995)

The Tautologies over a Finite Set are Context-Free. - Michael Bertol; Klaus Reinhardt (Bull. EATCS, 1995)

Set Automata. - Klaus-Jörn Lange; Klaus Reinhardt (DMTCS, 1996)

Advocating Ownership. - Henning Fernau; Klaus-Jörn Lange; Klaus Reinhardt (FSTTCS, 1996)

Strict Sequential P-completeness. - Klaus Reinhardt (STACS, 1997)

On Some Recognizable Picture-Languages. - Klaus Reinhardt (MFCS, 1998)

Isolation, Matching, and Counting - Eric Allender; Klaus Reinhardt (Electron. Colloquium Comput. Complex., 1998)

Circuits and Context-Free Languages. - Pierre McKenzie; Klaus Reinhardt; V. Vinay (COCOON, 1999)

A Parallel Context-Free Derivation Hierarchy. - Klaus Reinhardt (FCT, 1999)

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. - Manfred Kunde; Rolf Niedermeier; Klaus Reinhardt; Peter Rossmanith (Algorithmica, 1999)

Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. - Eric Allender; Klaus Reinhardt; Shiyu Zhou (J. Comput. Syst. Sci., 1999)

Making Nondeterminism Unambiguous. - Klaus Reinhardt; Eric Allender (SIAM J. Comput., 2000)

The Complexity of Translating Logic to Finite Automata. - Klaus Reinhardt (Automata, Logics, and Infinite Games, 2001)

The #a = #b Pictures Are Recognizable. - Klaus Reinhardt (STACS, 2001)

Towards optimal locality in mesh-indexings. - Rolf Niedermeier; Klaus Reinhardt; Peter Sanders 001 (Discret. Appl. Math., 2002)

On the parameterized complexity of the generalized rush hour puzzle. - Henning Fernau; Torben Hagerup; Naomi Nishimura; Prabhakar Ragde; Klaus Reinhardt (CCCG, 2003)

Refining the Nonterminal Complexity of Graph-controlled Grammars. - Henning Fernau; Rudolf Freund; Marion Oswald; Klaus Reinhardt (DCFS, 2005)

Searching Paths of Constant Bandwidth. - Bernd Borchert; Klaus Reinhardt (SOFSEM, 2006)

Deterministically and Sudoku-Deterministically Recognizable Picture Languages. - Bernd Borchert; Klaus Reinhardt (LATA, 2007)

A quadratic distance bound on sliding between crossing-free spanning trees. - Oswin Aichholzer; Klaus Reinhardt (Comput. Geom., 2007)

A Tree-Height Hierarchy of Context-Free Languages. - Klaus Reinhardt (Int. J. Found. Comput. Sci., 2007)

Decidability of code properties. - Henning Fernau; Klaus Reinhardt; Ludwig Staiger (RAIRO Theor. Informatics Appl., 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)

Reachability in Petri Nets with Inhibitor Arcs. - Klaus Reinhardt (RP, 2008)

Few Product Gates But Many Zeros. - Bernd Borchert; Pierre McKenzie; Klaus Reinhardt (MFCS, 2009)

The Simple Reachability Problem in Switch Graphs. - Klaus Reinhardt (SOFSEM, 2009)

Few Product Gates but Many Zeroes. - Bernd Borchert; Pierre McKenzie; Klaus Reinhardt (Chic. J. Theor. Comput. Sci., 2013)

The Minimum Amount of Useful Space: New Results and New Directions. - Klaus Reinhardt; Abuzer Yakaryilmaz (Developments in Language Theory, 2014)

Building Optimized Packet Filters with COFFi. - Sven Hager; Frank Winkler; Björn Scheuermann 001; Klaus Reinhardt (FCCM, 2014)

MPFC: Massively Parallel Firewall Circuits. - Sven Hager; Frank Winkler; Björn Scheuermann 001; Klaus Reinhardt (LCN, 2014)

Classical and quantum realtime alternating automata. - H. Gökalp Demirci; Mika Hirvensalo; Klaus Reinhardt; A. C. Cem Say; Abuzer Yakaryilmaz (NCMA, 2014)

Regular Languages Are Church-Rosser Congruential. - Volker Diekert; Manfred Kufleitner; Klaus Reinhardt; Tobias Walter (J. ACM, 2015)

New Results on the Minimum Amount of Useful Space. - Zuzana Bednárová; Viliam Geffert; Klaus Reinhardt; Abuzer Yakaryilmaz (Int. J. Found. Comput. Sci., 2016)

Undecidability of the emptiness problem for context-free picture languages. - Daniel Prusa; Klaus Reinhardt (Theor. Comput. Sci., 2017)

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)

Brief Announcement: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. - Julia Meusel; Matthias Müller-Hannemann; Klaus Reinhardt (SAND, 2025)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. - Julia Meusel; Matthias Müller-Hannemann; Klaus Reinhardt (CoRR, 2025)