Lower bounds on the complexity of real-time branching programs
RAIRO-Theor. Inf. Appl., 22 4 (1988) 447-459
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Mathematical Foundations of Computer Science 2002
Jan Kára and Daniel Král’Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2002 2420 411 (2002)
https://doi.org/10.1007/3-540-45687-2_34
STACS 2000
Juraj Hromkovič and Martin SauerhoffLecture Notes in Computer Science, STACS 2000 1770 145 (2000)
https://doi.org/10.1007/3-540-46541-3_12
STACS 97
Stephan WaackLecture Notes in Computer Science, STACS 97 1200 201 (1997)
https://doi.org/10.1007/BFb0023460
Efficient data structures for Boolean functions
Ingo WegenerDiscrete Mathematics 136 (1-3) 347 (1994)
https://doi.org/10.1016/0012-365X(95)90790-R
On the parallel complexity of linear groups
St. WaackRAIRO - Theoretical Informatics and Applications 25 (4) 323 (1991)
https://doi.org/10.1051/ita/1991250403231
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Matthias Krause, Christoph Meinel and Stephan WaackTheoretical Computer Science 86 (2) 267 (1991)
https://doi.org/10.1016/0304-3975(91)90021-S
Coxeter groups and nonuniform complexity
Bernd GrawAdvances in Applied Mathematics 12 (2) 115 (1991)
https://doi.org/10.1016/0196-8858(91)90010-G
Mathematical Foundations of Computer Science 1990
Stephan WaackLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1990 452 492 (1990)
https://doi.org/10.1007/BFb0029647
Fundamentals of Computation Theory
Bernd GrawLecture Notes in Computer Science, Fundamentals of Computation Theory 380 209 (1989)
https://doi.org/10.1007/3-540-51498-8_20
Fundamentals of Computation Theory
Matthias Krause and Stephan WaackLecture Notes in Computer Science, Fundamentals of Computation Theory 380 287 (1989)
https://doi.org/10.1007/3-540-51498-8_28