Searching for authors named "Klaus Reinhardt" – sorted by Relevance.
-
Sorting in-place with a worst case complexity of n log n --- 1:3n + O(log n) comparisons and ffln log n +O(1) transports
- + O(1) Transports ∗ Klaus Reinhardt Institut für Informatik, Universität Stuttgart Breitwiesenstr.22
- Cited by 6 (0 self) – Add To MetaCart
-
The #a = #b Pictures are Recognizable
- The #a = #b Pictures are Recognizable Klaus Reinhardt Wilhelm-Schickhard Institut fur Informatik
- Cited by 1 (0 self) – Add To MetaCart
-
A Parallel Context-Free Derivation Hierarchy
- A parallel context-free derivation hierarchy ? Klaus Reinhardt Wilhelm-Schickhard Institut f
- Cited by 1 (0 self) – Add To MetaCart
-
Strict sequential P--completeness
- Strict Sequential P-completeness ⋆ Klaus Reinhardt Wilhelm-Schickhard Institut für Informatik
- Cited by 2 (2 self) – Add To MetaCart
-
Counting and empty alternating pushdown automata
- Counting and empty alternating pushdown automata ∗ Klaus Reinhardt Universität Stuttgart, Institut
- Cited by 1 (1 self) – Add To MetaCart
-
On some Recognizable Picture-languages
- On some Recognizable Picture-languages ? Klaus Reinhardt Wilhelm-Schickhard Institut fur
- Cited by 4 (2 self) – Add To MetaCart
-
Reachability in Petri Nets with Inhibitor arcs
- Reachability in Petri Nets with Inhibitor arcs Klaus Reinhardt Wilhelm-Schickhard Institut fur
- Cited by 4 (0 self) – Add To MetaCart
-
Empty alternation
- Empty Alternation ⋆ Klaus-Jörn Lange Klaus Reinhardt Institut für Informatik, TU München Institut
- Cited by 2 (1 self) – Add To MetaCart
-
Circuits and Context-free Languages
- Circuits and Context-free Languages Pierre McKenzie Klaus Reinhardt y V Vinay z February 8
- Cited by 2 (0 self) – Add To MetaCart
-
Set Automata
- Set Automata Klaus-Jorn Lange and Klaus Reinhardt ? Wilhelm-Schickhard Institut fur Informatik
- Cited by 1 (0 self) – Add To MetaCart

