default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 29
Volume 29, Number 1, August 1984
- Luc Devroye:
Exponential Bounds for the Running Time of a Selection Algorithm. 1-7 - David A. Plaisted:
Complete Problems in the First-Order Predicate Calculus. 8-35 - Kokichi Sugihara:
An n log n Algorithm for Determining the Congruity of Polyhedra. 36-47 - Jan K. Pachl
:
Finding Pseudoperipheral Nodes in Graphs. 48-53 - Michel Latteux, Grzegorz Rozenberg:
Commutative One-Counter Languages are Regular. 54-57 - Tsong Yueh Chen:
On the Fixpoints of Nondeterministic Recursive Definitions. 58-79 - Fred Kröger:
A Generalized Nexttime Operator in Temporal Logic. 80-98 - Douglas R. Troeger:
Weak Equivalence in a Class of Structured Program Schemes. 99-117 - Walter J. Savitch, Patrick W. Dymond:
Consistency in Nondeterministic Storage. 118-132
Volume 29, Number 2, October 1984
- W. J. Hsu, M. W. Du:
New Algorithms for the LCS Problem. 133-152 - Antonio Restivo, Christophe Reutenauer:
On Cancellation Properties of Languages which are Supports of Ration Power Series. 153-159 - Albert R. Meyer, Jerzy Tiuryn:
Equivalences among Logics of Programs. 160-170 - Hiromi Miyajima, Masateru Harao, Shoichi Noguchi:
Indecomposable Maps in Tessellation Structures of Arbitrary Dimension. 171-182 - Yaacov Yesha:
Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer. 183-197 - Sara Porat, Michael Yoeli:
Towards a Hierarchy of Nets. 198-206 - Shojiro Muro, Tiko Kameda, Toshimi Minoura:
Multi-version Concurrency Control Scheme for a Database System. 207-224 - Simeon C. Ntafos, Teofilo F. Gonzalez:
On the Computational Complexity of Path Cover Problems. 225-242 - John E. Savage:
The Performance of Multilective VLSI Algorithms. 243-273 - John H. Reif:
The Complexity of Two-Player Games of Incomplete Information. 274-301
Volume 29, Number 3, December 1984
- Paul M. B. Vitányi:
On Two-Tape Real-Time Computation and Queues. 303-311 - Tatsuya Motoki:
An Application of Cohen's Result on Star Height to the Theory of Control Structures. 312-329 - Mikhail J. Atallah, Uzi Vishkin:
Finding Euler Tours in Parallel. 330-337 - Nathan Goodman, Oded Shmueli, Y. C. Tay:
GYO Reductions, Canonical Connections, Tree and Cyclic Schemas, and Tree Projections. 338-358 - David Harel, Mike Paterson:
Undecidability of PDL with L={a^(2i)|i>=0}. 359-365 - Joost Engelfriet, Giora Slutzki:
Extended Macro Grammars and Stack Controlled Machines. 366-408 - Clement T. Yu, Z. Meral Özsoyoglu, K. Lam:
Optimization of Distributed Tree Queries. 409-445
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-16 00:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
