Volume 29,
1984
- Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Average Case Optimality for Linear Problems.
1-25 BibTeX
- Ewa Orlowska, Zdzislaw Pawlak:
Representation of Nondeterministic Information.
27-39 BibTeX
- Grzegorz Rozenberg, R. Verraedt:
On Simulation and Propagating E0L Forms.
41-48 BibTeX
- Aviezri S. Fraenkel:
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches.
49-73 BibTeX
- Greg N. Frederickson:
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.
75-85 BibTeX
- Ryszard Janicki:
Nets, Sequential Components and Concurrency Relations.
87-121 BibTeX
- Oscar H. Ibarra, Sam M. Kim:
Characterizations and Computational Complexity of Systolic Trellis Automata.
123-153 BibTeX
- Tsutomu Kamimura, Adrian Tang:
Effectively Given Spaces.
155-166 BibTeX
- Jean-Louis Lassez, Michael J. Maher:
Closures and Fairness in the Semantics of Programming Logic.
167-184 BibTeX
- Emanuela Fachini, Margherita Napoli:
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems.
185-227 BibTeX
- J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker:
On Infinite Computations in Denotational Semantics.
229-230 BibTeX
- Tzilla Elrad, Nissim Francez:
A Weakest Precondition Semantics for Communicating Processes.
231-250 BibTeX
- Marisa Venturini Zilli:
Reduction Graphs in the Lambda Calculus.
251-275 BibTeX
- D. H. Potts:
Remarks on an Example of Jantzen.
277-284 BibTeX
- Juhani Karhumäki:
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids.
285-308 BibTeX
- Mario Coppo:
Completeness of Type Assignment in Continuous Lambda Models.
309-324 BibTeX
- Gerald S. Eisman:
On the Ratio of Growth Functions in EDT0L Languages.
325-349 BibTeX
Copyright © Sun May 17 00:23:50 2009
by Michael Ley (ley@uni-trier.de)
