JCSS, Volume 26

Volume 26, Number 1, February 1983

Douglas Comer: Effects of Updates on Optimality in Tries. 1-13 BibTeX
Michel Latteux: Langages à un Compteur. 14-33 BibTeX
Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg: Context Free Normal Systems and ETOL Systems. 34-46 BibTeX
Oscar H. Ibarra, Brian S. Leininger: On the Zero-Inequivalence Problem for Loop Programs. 47-64 BibTeX
David A. Carlson, John E. Savage: Size-Space Tradeoffs for Oblivious Computations. 65-81 BibTeX
Jürgen Albert, Derick Wood: Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages. 82-91 BibTeX
Dave Riffelmacher: Multiplicative Complexity and Algebraic Structure. 92-106 BibTeX
Toshimasa Watanabe, Akira Nakamura: On the Transformation Semigroups of Finite Automata. 107-138 BibTeX
John J. Grefenstette: Network Structure and the Firing Squad Synchronization Problem. 139-152 BibTeX

Esko Ukkonen: Lower Bounds on the Size of Deterministic Parsers. 153-170 BibTeX
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier: On the Equality of Grammatical Families. 171-196 BibTeX
Takao Asano, Tomio Hirata: Edge-Contraction Problems. 197-208 BibTeX
Ker-I Ko: On Self-Reducibility and Weak P-Selectivity. 209-221 BibTeX
David Harel, Amir Pnueli, Jonathan Stavi: Propositional Dynamic Logic of Nonregular Programs. 222-243 BibTeX
Seppo Sippu, Eljas Soisalon-Soininen: On the Complexity of LL(k) Testing. 244-268 BibTeX
Maurice Tchuente: Computation of Boolean Functions on Networks of Binary Automata. 269-277 BibTeX

Selected Papers of STOC 1981

Zvi Galil, Joel I. Seiferas: Time-Space-Optimal String Matching. 280-294 BibTeX
David E. Muller, Paul E. Schupp: Groups, the Theory of Ends, and Context-Free Languages. 295-310 BibTeX
Deborah Joseph: Polynomial Time Computations in Models of ET. 311-338 BibTeX
Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller: An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. 339-361 BibTeX
Daniel Dominic Sleator, Robert Endre Tarjan: A Data Structure for Dynamic Trees. 362-391 BibTeX
Faith E. Fich: Lower Bounds for the Cycle Detection Problem. 392-409 BibTeX
K. N. Venkataraman, Ann Yasuhara, Frank M. Hawrusik: A View of Computability on Term Algebras. 410-471 BibTeX