Klaus Reinhardt

According to our database1, Klaus Reinhardt
  • authored at least 51 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Undecidability of the emptiness problem for context-free picture languages.
Theor. Comput. Sci., 2017

2016
New Results on the Minimum Amount of Useful Space.
Int. J. Found. Comput. Sci., 2016

2015
Regular Languages Are Church-Rosser Congruential.
J. ACM, 2015

2014
The minimum amount of useful space: New results and new directions.
CoRR, 2014

Classical and quantum realtime alternating automata.
CoRR, 2014

Classical and quantum realtime alternating automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

MPFC: Massively Parallel Firewall Circuits.
Proceedings of the IEEE 39th Conference on Local Computer Networks, 2014

Building Optimized Packet Filters with COFFi.
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.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Few Product Gates but Many Zeroes.
Chicago J. Theor. Comput. Sci., 2013

2012
Regular Languages are Church-Rosser Congruential
CoRR, 2012

Regular Languages Are Church-Rosser Congruential.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2009
The Simple Reachability Problem in Switch Graphs.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Few Product Gates But Many Zeros.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
Reachability in Petri Nets with Inhibitor Arcs.
Electr. Notes Theor. Comput. Sci., 2008

2007
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
Journal of Automata, Languages and Combinatorics, 2007

Decidability of code properties.
ITA, 2007

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

A quadratic distance bound on sliding between crossing-free spanning trees.
Comput. Geom., 2007

Deterministically and Sudoku-Deterministically Recognizable Picture Languages.
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.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005
Refining the Nonterminal Complexity of Graph-controlled Grammars.
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.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Towards optimal locality in mesh-indexings.
Discrete Applied Mathematics, 2002

2001
The #a = #b Pictures Are Recognizable.
Proceedings of the STACS 2001, 2001

The Complexity of Translating Logic to Finite Automata.
Proceedings of the Automata, 2001

2000
Making Nondeterminism Unambiguous.
SIAM J. Comput., 2000

1999
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds.
J. Comput. Syst. Sci., 1999

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.
Algorithmica, 1999

A Parallel Context-Free Derivation Hierarchy.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Decidability of code properties.
Proceedings of the Developments in Language Theory, 1999

Circuits and Context-Free Languages.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Isolation, Matching, and Counting
Electronic Colloquium on Computational Complexity (ECCC), 1998

On Some Recognizable Picture-Languages.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Isolation, Matching, and Counting.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997
Making Nondeterminism Unambiguous
Electronic Colloquium on Computational Complexity (ECCC), 1997

Strict Sequential P-completeness.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Making Nondeterminism Unambiguous.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Towards Optimal Locality in Mesh-Indexings.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

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

Set Automata.
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.
Bulletin of the EATCS, 1995

Optimal Average Case Sorting on Arrays.
STACS, 1995

On Codings of Traces.
STACS, 1995

On the Synchronization of Semi-Traces.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
On Confluent Semi-commutations: Decidability and Complexity Results
Inf. Comput., April, 1994

Empty Alternation.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Prioritätszählerautomaten und die Synchronisation von Halbspursprachen.
PhD thesis, 1994

1992
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.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
On Confluent Semi-Commutations - Decidability and Complexity Results.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Hierarchies over the Context-Free Languages.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990


  Loading...