default search action
Theoretical Computer Science, Volume 29
Volume 29, 1984
- Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Average Case Optimality for Linear Problems. 1-25 - Ewa Orlowska, Zdzislaw Pawlak:
Representation of Nondeterministic Information. 27-39 - Grzegorz Rozenberg, R. Verraedt:
On Simulation and Propagating E0L Forms. 41-48 - Aviezri S. Fraenkel:
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. 49-73 - Greg N. Frederickson:
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. 75-85 - Ryszard Janicki:
Nets, Sequential Components and Concurrency Relations. 87-121 - Oscar H. Ibarra, Sam M. Kim:
Characterizations and Computational Complexity of Systolic Trellis Automata. 123-153 - Tsutomu Kamimura, Adrian Tang:
Effectively Given Spaces. 155-166 - Jean-Louis Lassez, Michael J. Maher:
Closures and Fairness in the Semantics of Programming Logic. 167-184 - Emanuela Fachini, Margherita Napoli:
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems. 185-227 - J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker:
On Infinite Computations in Denotational Semantics. 229-230 - Tzilla Elrad, Nissim Francez:
A Weakest Precondition Semantics for Communicating Processes. 231-250 - Marisa Venturini Zilli:
Reduction Graphs in the Lambda Calculus. 251-275 - D. H. Potts:
Remarks on an Example of Jantzen. 277-284 - Juhani Karhumäki:
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids. 285-308 - Mario Coppo:
Completeness of Type Assignment in Continuous Lambda Models. 309-324 - Gerald S. Eisman:
On the Ratio of Growth Functions in EDT0L Languages. 325-349
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.