Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

52
(FIVE YEARS 0)

H-INDEX

9
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540582014, 9783540485667
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Expressiveness of efficient semi-deterministic choice constructs

1994 ◽  
pp. 106-117 ◽  
Author(s):  
Marc Gyssens ◽  
Jan Bussche ◽  
Dirk Gucht

Fast uniform analysis of Coupled-Context-Free languages

1994 ◽  
pp. 412-423 ◽  
Author(s):  
Günter Hotz ◽  
Gisela Pitsch
Keyword(s):  
Context Free

On the cutting edge of relativization: The resource bounded injury method

1994 ◽  
pp. 263-273 ◽  
Author(s):  
Harry Buhrman ◽  
Leen Torenvliet
Keyword(s):  
Cutting Edge

The Optimal Alphabetic Tree problem revisited

1994 ◽  
pp. 251-262 ◽  
Author(s):  
Teresa M. Przytycka ◽  
Lawrence L. Larmore

Determinizing asynchronous automata

1994 ◽  
pp. 130-141 ◽  
Author(s):  
Nils Klarlund ◽  
Madhavan Mukund ◽  
Milind Sohoni
Keyword(s):  
Asynchronous Automata

The average case complexity of the parallel prefix problem

1994 ◽  
pp. 593-604 ◽  
Author(s):  
Andreas Jakoby ◽  
Christian Schindelhauer ◽  
Rüdiger Reischuk ◽  
Stephan Weis
Keyword(s):  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Parallel Prefix

Least solutions of equations over N

1994 ◽  
pp. 400-411 ◽  
Author(s):  
Helmut Seidl
Keyword(s):  
Solutions Of Equations

Average-case analysis of pattern-matching in trees under the BST probability model

1994 ◽  
pp. 178-190 ◽  
Author(s):  
José -Ramón Sánchez-Couso ◽  
María -Inés Fernández-Camacho
Keyword(s):  
Pattern Matching ◽  
Probability Model ◽  
Case Analysis ◽  
Average Case Analysis ◽  
Average Case
Load More ...
Sign in / Sign up

Export Citation Format

Share Document