default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Reinhardt
Person information
- affiliation: University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j15]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)- 2017
- [j14]Daniel Prusa, Klaus Reinhardt:
Undecidability of the emptiness problem for context-free picture languages. Theor. Comput. Sci. 679: 118-125 (2017) - 2016
- [j13]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): 259-282 (2016) - 2015
- [j12]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. J. ACM 62(5): 39:1-39:20 (2015) - 2014
- [c31]Klaus Reinhardt, Abuzer Yakaryilmaz:
The Minimum Amount of Useful Space: New Results and New Directions. Developments in Language Theory 2014: 315-326 - [c30]Sven Hager, Frank Winkler, Björn Scheuermann, Klaus Reinhardt:
Building Optimized Packet Filters with COFFi. FCCM 2014: 105 - [c29]Sven Hager, Frank Winkler, Björn Scheuermann, Klaus Reinhardt:
MPFC: Massively Parallel Firewall Circuits. LCN 2014: 305-313 - [c28]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. NCMA 2014: 101-114 - [i6]Klaus Reinhardt, Abuzer Yakaryilmaz:
The minimum amount of useful space: New results and new directions. CoRR abs/1405.2892 (2014) - [i5]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. CoRR abs/1407.0334 (2014) - 2013
- [j11]Bernd Borchert, Pierre McKenzie, Klaus Reinhardt:
Few Product Gates but Many Zeroes. Chic. J. Theor. Comput. Sci. 2013 (2013) - 2012
- [c27]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. ICALP (2) 2012: 177-188 - [i4]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages are Church-Rosser Congruential. CoRR abs/1202.1148 (2012)
2000 – 2009
- 2009
- [c26]Bernd Borchert, Pierre McKenzie, Klaus Reinhardt:
Few Product Gates But Many Zeros. MFCS 2009: 162-174 - [c25]Klaus Reinhardt:
The Simple Reachability Problem in Switch Graphs. SOFSEM 2009: 461-472 - 2008
- [c24]Klaus Reinhardt:
Reachability in Petri Nets with Inhibitor Arcs. RP 2008: 239-264 - 2007
- [j10]Oswin Aichholzer, Klaus Reinhardt:
A quadratic distance bound on sliding between crossing-free spanning trees. Comput. Geom. 37(3): 155-161 (2007) - [j9]Klaus Reinhardt:
A Tree-Height Hierarchy of Context-Free Languages. Int. J. Found. Comput. Sci. 18(6): 1383-1394 (2007) - [j8]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. RAIRO Theor. Informatics Appl. 41(3): 243-259 (2007) - [j7]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): 117-138 (2007) - [c23]Bernd Borchert, Klaus Reinhardt:
Deterministically and Sudoku-Deterministically Recognizable Picture Languages. LATA 2007: 175-186 - 2006
- [c22]Bernd Borchert, Klaus Reinhardt:
Searching Paths of Constant Bandwidth. SOFSEM 2006: 187-196 - 2005
- [c21]Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121 - 2003
- [c20]Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9 - 2002
- [j6]Rolf Niedermeier, Klaus Reinhardt, Peter Sanders:
Towards optimal locality in mesh-indexings. Discret. Appl. Math. 117(1-3): 211-237 (2002) - 2001
- [c19]Klaus Reinhardt:
The Complexity of Translating Logic to Finite Automata. Automata, Logics, and Infinite Games 2001: 231-238 - [c18]Klaus Reinhardt:
The #a = #b Pictures Are Recognizable. STACS 2001: 527-538 - 2000
- [j5]Klaus Reinhardt, Eric Allender:
Making Nondeterminism Unambiguous. SIAM J. Comput. 29(4): 1118-1131 (2000)
1990 – 1999
- 1999
- [j4]Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith:
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica 25(4): 438-458 (1999) - [j3]Eric Allender, Klaus Reinhardt, Shiyu Zhou:
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. J. Comput. Syst. Sci. 59(2): 164-181 (1999) - [c17]Pierre McKenzie, Klaus Reinhardt, V. Vinay:
Circuits and Context-Free Languages. COCOON 1999: 194-203 - [c16]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. Developments in Language Theory 1999: 153-163 - [c15]Klaus Reinhardt:
A Parallel Context-Free Derivation Hierarchy. FCT 1999: 441-450 - 1998
- [c14]Eric Allender, Klaus Reinhardt:
Isolation, Matching, and Counting. CCC 1998: 92-100 - [c13]Klaus Reinhardt:
On Some Recognizable Picture-Languages. MFCS 1998: 760-770 - [i3]Eric Allender, Klaus Reinhardt:
Isolation, Matching, and Counting. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c12]Rolf Niedermeier, Klaus Reinhardt, Peter Sanders:
Towards Optimal Locality in Mesh-Indexings. FCT 1997: 364-375 - [c11]Klaus Reinhardt, Eric Allender:
Making Nondeterminism Unambiguous. FOCS 1997: 244-253 - [c10]Klaus Reinhardt:
Strict Sequential P-completeness. STACS 1997: 329-338 - [i2]Klaus Reinhardt, Eric Allender:
Making Nondeterminism Unambiguous. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c9]Klaus-Jörn Lange, Klaus Reinhardt:
Set Automata. DMTCS 1996: 321-329 - [c8]Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt:
Advocating Ownership. FSTTCS 1996: 286-297 - 1995
- [j2]Michael Bertol, Klaus Reinhardt:
The Tautologies over a Finite Set are Context-Free. Bull. EATCS 57 (1995) - [c7]Klaus Reinhardt:
On the Synchronization of Semi-Traces. FCT 1995: 393-403 - [c6]Volker Diekert, Anca Muscholl, Klaus Reinhardt:
On Codings of Traces. STACS 1995: 385-396 - [c5]Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith:
Optimal Average Case Sorting on Arrays. STACS 1995: 503-514 - 1994
- [b1]Klaus Reinhardt:
Prioritätszählerautomaten und die Synchronisation von Halbspursprachen. University of Stuttgart, Germany, 1994, pp. 1-77 - [j1]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-commutations: Decidability and Complexity Results. Inf. Comput. 110(1): 164-182 (1994) - [c4]Klaus-Jörn Lange, Klaus Reinhardt:
Empty Alternation. MFCS 1994: 494-503 - 1992
- [c3]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. ISAAC 1992: 489-498 - 1991
- [c2]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241 - 1990
- [c1]Klaus Reinhardt:
Hierarchies over the Context-Free Languages. IMYCS 1990: 214-224 - [i1]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On confluent semi-commutations: decidability and complexity results. Forschungsberichte, TU Munich TUM I 9041: 1-18 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
