JCSS, Volume 32
Volume 32, Number 1, February 1986
Shuo-Yen Robert Li: Binary Trees and Uniform Distribution of Traffic Cutback. 1-14- Péter Gács: Reliable Computation with Cellular Automata. 15-78
- Dennis de Champeaux: About the Paterson-Wegman Linear Unification Algorithm. 79-90
- Ingo Wegener: Time-Space Trade-offs for Branching Programs. 91-96
- Pawel Urzyczyn: "During" Cannot be Expressed by "After". 97-104
- Louis E. Rosier, Hsu-Chun Yen: A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. 105-135
Volume 32, Number 2, April 1986
- Bernard Chazelle: Reporting and Counting Segment Intersections. 156-182
- Ravi B. Boppana: Threshold Functions and Bounded Depth Monotone Circuits. 222-229
- Danny Dolev, Joseph Y. Halpern, H. Raymond Strong: On the Possibility and Impossibility of Achieving Clock Synchronization. 230-250
- Michael Ben-Or, Dexter Kozen, John H. Reif: The Complexity of Elementary Algebra and Geometry. 251-264
Volume 32, Number 3, June 1986
- Gary L. Miller: Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. 265-279
- Juhani Karhumäki, Yael Maon: A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language. 315-322
- Bernard R. Hodgson, Clement F. Kent: Uniform Normal Form for General Time-Bounded Complexity Classes. 363-369
- James C. Owings: Effective Choice Functions and Index Sets. 370-373
- Bogdan S. Chlebus: Domino-Tiling Games. 374-392
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team