Volume 30, Number 1, January 1983
Volume 30, Number 2, April 1983
Volume 30, Number 3, July 1983
- Michael Tarsi:
Optimal Search on Some Game Trees.
389-396
Electronic Edition (ACM DL) BibTeX
- Arnold L. Rosenberg:
Three-Dimensional VLSI: A Case Study.
397-416
Electronic Edition (ACM DL) BibTeX
- David W. Matula, Leland L. Beck:
Smallest-Last Ordering and clustering and Graph Coloring Algorithms.
417-427
Electronic Edition (ACM DL) BibTeX
- Kenneth J. Supowit:
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees.
428-448
Electronic Edition (ACM DL) BibTeX
- Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
Efficiency of Synchronous Versus Asynchronous Distributed Systems.
449-456
Electronic Edition (ACM DL) BibTeX
- Edward G. Coffman Jr., Ravi Sethi:
Instruction Sets for Evaluating Arithmetic Expressions.
457-478
Electronic Edition (ACM DL) BibTeX
- Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis:
On the Desirability of Acyclic Database Schemes.
479-513
Electronic Edition BibTeX
- Ronald Fagin:
Degrees of Acyclicity for Hypergraphs and Relational Database Schemes.
514-550
Electronic Edition BibTeX
- Dan Gusfield:
Parametric Combinatorial Computing and a Problem of Program Module Distribution.
551-563
Electronic Edition (ACM DL) BibTeX
- Rajan Suri:
Robustness of Queuing Network Formulas.
564-594
Electronic Edition (ACM DL) BibTeX
- Jean-Claude Raoult, Ravi Sethi:
Properties of a Notation for Combining Functions.
595-611
Electronic Edition (ACM DL) BibTeX
- Edmund M. Clarke, Steven M. German, Joseph Y. Halpern:
Effective Axiomatizations of Hoare Logics.
612-636
Electronic Edition (ACM DL) BibTeX
- Georg Gati:
The Complexity of Solving Polynomial Equations by Quadrature.
637-640
Electronic Edition (ACM DL) BibTeX
- Oscar H. Ibarra, Brian S. Leininger:
On the Simplification and Equivalence Problems for Straight-Line Programs.
641-656
Electronic Edition (ACM DL) BibTeX
- Joseph JáJá:
Time-Space Trade-offs for Some Algebraic Problems.
657-667
Electronic Edition (ACM DL) BibTeX
- Leslie Lamport:
The Weak Byzantine Generals Problem.
668-676
Electronic Edition BibTeX
- Xu Mei-Rui, John E. Donner, Ronald V. Book:
Refining Nondeterminism in Relativizations of Complexity Classes.
677-685
Electronic Edition (ACM DL) BibTeX
Volume 30, Number 4, October 1983
- Dana S. Nau:
Decision Quality As a Function of Search Depth on Game Trees.
687-708
Electronic Edition (ACM DL) BibTeX
- Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg:
Cost Trade-offs in Graph Embeddings, with Applications.
709-728
Electronic Edition (ACM DL) BibTeX
- Avi Wigderson:
Improving the Performance Guarantee for Approximate Graph Coloring.
729-735
Electronic Edition (ACM DL) BibTeX
- Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda:
Design of Minimum-Cost Deadlock-Free Systems.
736-751
Electronic Edition (ACM DL) BibTeX
- Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
Graph Algorithms for Functional Dependency Manipulation.
752-766
Electronic Edition BibTeX
- Nathan Goodman, Oded Shmueli:
Syntactic Characterization of Tree Database Schemas.
767-786
Electronic Edition BibTeX
- Zvi M. Kedem, Abraham Silberschatz:
Locking Protocols: From Exclusive to Shared Locks.
787-804
Electronic Edition BibTeX
- Per-Åke Larson:
Analysis of Uniform Hashing.
805-819
Electronic Edition BibTeX
- Yael Krevner, Amiram Yehudai:
An Iteration Theorem for Simple Precedence Languages.
820-833
Electronic Edition (ACM DL) BibTeX
- Bruce Hajek:
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks.
834-851
Electronic Edition (ACM DL) BibTeX
- Nimrod Megiddo:
Applying Parallel Computation Algorithms in the Design of Serial Algorithms.
852-865
Electronic Edition (ACM DL) BibTeX
Copyright © Wed May 21 20:01:24 2008
by Michael Ley (ley@uni-trier.de)
