JCSS, Volume 29

Volume 29, Number 1, August 1984

Luc Devroye: Exponential Bounds for the Running Time of a Selection Algorithm. 1-7 BibTeX
David A. Plaisted: Complete Problems in the First-Order Predicate Calculus. 8-35 BibTeX
Kokichi Sugihara: An n log n Algorithm for Determining the Congruity of Polyhedra. 36-47 BibTeX
Jan K. Pachl: Finding Pseudoperipheral Nodes in Graphs. 48-53 BibTeX
Michel Latteux, Grzegorz Rozenberg: Commutative One-Counter Languages are Regular. 54-57 BibTeX
Tsong Yueh Chen: On the Fixpoints of Nondeterministic Recursive Definitions. 58-79 BibTeX
Fred Kröger: A Generalized Nexttime Operator in Temporal Logic. 80-98 BibTeX
Douglas R. Troeger: Weak Equivalence in a Class of Structured Program Schemes. 99-117 BibTeX
Walter J. Savitch, Patrick W. Dymond: Consistency in Nondeterministic Storage. 118-132 BibTeX

W. J. Hsu, M. W. Du: New Algorithms for the LCS Problem. 133-152 BibTeX
Antonio Restivo, Christophe Reutenauer: On Cancellation Properties of Languages which are Supports of Ration Power Series. 153-159 BibTeX
Albert R. Meyer, Jerzy Tiuryn: Equivalences among Logics of Programs. 160-170 BibTeX
Hiromi Miyajima, Masateru Harao, Shoichi Noguchi: Indecomposable Maps in Tessellation Structures of Arbitrary Dimension. 171-182 BibTeX
Yaacov Yesha: Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer. 183-197 BibTeX
Sara Porat, Michael Yoeli: Towards a Hierarchy of Nets. 198-206 BibTeX
Shojiro Muro, Tiko Kameda, Toshimi Minoura: Multi-version Concurrency Control Scheme for a Database System. 207-224 BibTeX
Simeon C. Ntafos, Teofilo F. Gonzalez: On the Computational Complexity of Path Cover Problems. 225-242 BibTeX
John E. Savage: The Performance of Multilective VLSI Algorithms. 243-273 BibTeX
John H. Reif: The Complexity of Two-Player Games of Incomplete Information. 274-301 BibTeX

Paul M. B. Vitányi: On Two-Tape Real-Time Computation and Queues. 303-311 BibTeX
Tatsuya Motoki: An Application of Cohen's Result on Star Height to the Theory of Control Structures. 312-329 BibTeX
Mikhail J. Atallah, Uzi Vishkin: Finding Euler Tours in Parallel. 330-337 BibTeX
Nathan Goodman, Oded Shmueli, Y. C. Tay: GYO Reductions, Canonical Connections, Tree and Cyclic Schemas, and Tree Projections. 338-358 BibTeX
David Harel, Mike Paterson: Undecidability of PDL with L={a^(2i)|i>=0}. 359-365 BibTeX
Joost Engelfriet, Giora Slutzki: Extended Macro Grammars and Stack Controlled Machines. 366-408 BibTeX
Clement T. Yu, Z. Meral Özsoyoglu, K. Lam: Optimization of Distributed Tree Queries. 409-445 BibTeX