Volume 55, Number 1-3, 1982
- Ronald L. Rivest, Adi Shamir:
How to Reuse a ``Write-Once'' Memory.
1-19
- Paul M. B. Vitányi:
On Efficient Simulations of Multicounter Machines.
20-39
- R. Kannan:
Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets.
40-56
- Danny Dolev, Shimon Even, Richard M. Karp:
On the Security of Ping-Pong Protocols.
57-68
- Yuri Gurevich, Harry R. Lewis:
The Inference Problem for Template Dependencies.
69-79
- Andreas Blass, Yuri Gurevich:
On the Unique Satisfiability Problem.
80-88
- Klaus J. Berkling, Elfriede Fehr:
A Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages.
89-101
- Hans-Ulrich Simon:
A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions.
102-106
- Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks:
Fair Deriviations in Context-Free Grammars.
108-116
- Shimon Even, Timothy J. Long, Yacov Yacobi:
A Note on Deterministic and Nondeterministic Time Complexity.
117-124
- Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood:
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees.
125-174
- David Harel, Rivi Sherman:
Looping vs. Repeating in Dynamic Logic.
175-192
- Akira Ito, Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-Dimensional Alternating Turing Machines with Only Universal States.
193-221
- Ian F. Blake:
The Enumeration of Certain Run-Length Sequences.
222-236
- David L. Neuhoff, Paul C. Shields:
Channel Distances and Representation.
238-264
Copyright © Sun Nov 8 03:28:11 2009
by Michael Ley (ley@uni-trier.de)
