JCSS, Volume 23

Volume 23, Number 1, August 1981

Hermann A. Maurer, Arto Salomaa, Derick Wood: Completeness of Context-Free Grammar Forms. 1-10 BibTeX
Gérard P. Huet: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. 11-21 BibTeX
Katsuhiko Nakamura: Synchronous to Asynchronous Transformation of Polyautomata. 22-37 BibTeX
Arthur G. Werschulz: On Maximal Order for Local and Global Numerical Problems. 38-48 BibTeX
Ralph-Johan Back: On Correct Refinement of Programs. 49-68 BibTeX
Jean H. Gallier: Recursion-Closed Algebraic Theories. 69-105 BibTeX
Martin Tompa: Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. 106 BibTeX , see JCSS 20(2): 118-132 (1980)

Selected Papers from STOC 1980

Wolfgang J. Paul, Joel I. Seiferas, Janos Simon: An Information-Theoretic Approach to Time Bounds for On-Line Computation. 108-126 BibTeX
Martin Tompa: An Optimal Solution to a Wire-Routing Problem. 127-150 BibTeX
Nicholas Pippenger: Pebbling with an Auxiliary Pushdown. 151-165 BibTeX
Mark H. Overmars, Jan van Leeuwen: Maintenance of Configurations in the Plane. 166-204 BibTeX
Deborah Joseph, Paul Young: Independence Results in Computer Science? 205-222 BibTeX , Corrigendum JCSS 24(3): 378 (1982)
Hartmut Ehrig, Bernd Mahr: Complexity of Algebraic Implementations for Abstract Data Types. 223-253 BibTeX
Nancy A. Lynch: Upper Bounds for Static Resource Allocation in a Distributed System. 254-278 BibTeX
Albert R. Meyer, Rohit Parikh: Definability in Dynamic Logic. 279-298 BibTeX

Rüdiger Valk, Guy Vidal-Naquet: Petri Nets and Regular Languages. 299-325 BibTeX
Alan L. Selman: Some Observations on NP, Real Numbers and P-Selective Sets. 326-332 BibTeX
Lawrence Snyder: Theft and Conspiracy in the Take-Grant Protection Model. 333-347 BibTeX
Ernst L. Leiss: The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata. 348-354 BibTeX
Michael L. Fredman, Dennis J. Volper: Query Time Versus Redundancy Trade-Offs for Range Queries. 355-365 BibTeX
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda: The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. 366-382 BibTeX
Luigia Carlucci Aiello, Gianfranco Prini: An Efficient Interpreter for the Lambda-Calculus. 383-424 BibTeX