nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Author Index for Volume 169
|
|
|
2001 |
169 |
2 |
p. 298- 1 p. |
artikel |
2 |
Bounded Queries, Approximations, and the Boolean Hierarchy
|
Chang, Richard |
|
2001 |
169 |
2 |
p. 129-159 31 p. |
artikel |
3 |
Computing a Context-Free Grammar-Generating Series
|
Litow, Bruce |
|
2001 |
169 |
2 |
p. 174-185 12 p. |
artikel |
4 |
Context-Free Series on Trees
|
Bozapalidis, Symeon |
|
2001 |
169 |
2 |
p. 186-229 44 p. |
artikel |
5 |
Most Sequences Are Stochastic
|
V'yugin, V.V |
|
2001 |
169 |
2 |
p. 252-263 12 p. |
artikel |
6 |
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata
|
Hromkovič, Juraj |
|
2001 |
169 |
2 |
p. 284-296 13 p. |
artikel |
7 |
Papers to Appear in Forthcoming Issues
|
|
|
2001 |
169 |
2 |
p. 297- 1 p. |
artikel |
8 |
Quorum Systems Constructed from Combinatorial Designs
|
Colbourn, Charles J |
|
2001 |
169 |
2 |
p. 160-173 14 p. |
artikel |
9 |
SGML and XML Document Grammars and Exceptions
|
Kilpeläinen, Pekka |
|
2001 |
169 |
2 |
p. 230-251 22 p. |
artikel |
10 |
The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers,
|
Drewes, Frank |
|
2001 |
169 |
2 |
p. 264-283 20 p. |
artikel |