The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Klaus Reinhardt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
    On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:6-9 [Conf]
  2. Eric Allender, Klaus Reinhardt
    Isolation, Matching, and Counting. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:92-100 [Conf]
  3. Pierre McKenzie, Klaus Reinhardt, V. Vinay
    Circuits and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:194-203 [Conf]
  4. Klaus Reinhardt
    The Complexity of Translating Logic to Finite Automata. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:231-238 [Conf]
  5. Henning Fernau, Klaus Reinhardt
    Decidability of code properties. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:153-163 [Conf]
  6. Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
    Towards Optimal Locality in Mesh-Indexings. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:364-375 [Conf]
  7. Klaus Reinhardt
    On the Synchronization of Semi-Traces. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:393-403 [Conf]
  8. Klaus Reinhardt
    A Parallel Context-Free Derivation Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:441-450 [Conf]
  9. Klaus Reinhardt, Eric Allender
    Making Nondeterminism Unambiguous. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:244-253 [Conf]
  10. Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
    Advocating Ownership. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:286-297 [Conf]
  11. Volker Diekert, Edward Ochmanski, Klaus Reinhardt
    On Confluent Semi-Commutations - Decidability and Complexity Results. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:229-241 [Conf]
  12. Klaus Reinhardt
    Hierarchies over the Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:214-224 [Conf]
  13. Klaus Reinhardt
    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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:489-498 [Conf]
  14. Klaus-Jörn Lange, Klaus Reinhardt
    Empty Alternation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:494-503 [Conf]
  15. Klaus Reinhardt
    On Some Recognizable Picture-Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:760-770 [Conf]
  16. Bernd Borchert, Klaus Reinhardt
    Searching Paths of Constant Bandwidth. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:187-196 [Conf]
  17. Volker Diekert, Anca Muscholl, Klaus Reinhardt
    On Codings of Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:385-396 [Conf]
  18. Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
    Optimal Average Case Sorting on Arrays. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:503-514 [Conf]
  19. Klaus Reinhardt
    The #a = #b Pictures Are Recognizable. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:527-538 [Conf]
  20. Klaus Reinhardt
    Strict Sequential P-completeness. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:329-338 [Conf]
  21. Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
    Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:4, pp:438-458 [Journal]
  22. Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
    Towards optimal locality in mesh-indexings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:211-237 [Journal]
  23. Michael Bertol, Klaus Reinhardt
    The Tautologies over a Finite Set are Context-Free. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:57, n:, pp:- [Journal]
  24. Klaus Reinhardt, Eric Allender
    Making Nondeterminism Unambiguous [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:14, pp:- [Journal]
  25. Volker Diekert, Edward Ochmanski, Klaus Reinhardt
    On Confluent Semi-commutations: Decidability and Complexity Results [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:164-182 [Journal]
  26. Eric Allender, Klaus Reinhardt, Shiyu Zhou
    Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:164-181 [Journal]
  27. Klaus Reinhardt, Eric Allender
    Making Nondeterminism Unambiguous. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1118-1131 [Journal]
  28. Oswin Aichholzer, Klaus Reinhardt
    A quadratic distance bound on sliding between crossing-free spanning trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:155-161 [Journal]

  29. Few Product Gates But Many Zeros. [Citation Graph (, )][DBLP]


  30. The Simple Reachability Problem in Switch Graphs. [Citation Graph (, )][DBLP]


  31. Reachability in Petri Nets with Inhibitor Arcs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002