Volume 31,
Number 1,
January 1984
- Robert E. Shostak:
Deciding Combinations of Theories.
1-12
Electronic Edition (ACM DL) BibTeX
- H. James Hoover, Maria M. Klawe, Nicholas Pippenger:
Bounding Fan-out in Logical Networks.
13-18
Electronic Edition (ACM DL) BibTeX
- Peter Eades, Michael Hickey, Ronald C. Read:
Some Hamilton Paths and a Minimal Change Algorithm.
19-29
Electronic Edition (ACM DL) BibTeX
- Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman:
On the Structure of Armstrong Relations for Functional Dependencies.
30-46
Electronic Edition BibTeX
- Lawrence J. Henschen, Shamim A. Naqvi:
On compiling queries in recursive first-order databases.
47-85
Electronic Edition BibTeX
- Aurel A. Lazar:
Optimal Flow Control of an M/M/m Queue.
86-98
Electronic Edition (ACM DL) BibTeX
- Sidnie Dresher Feit:
A Fast Algorithm for the Two-Variable Integer Programming Problem.
99-113
Electronic Edition (ACM DL) BibTeX
- Nimrod Megiddo:
Linear Programming in Linear Time When the Dimension Is Fixed.
114-127
Electronic Edition (ACM DL) BibTeX
- Onno J. Boxma, Frank P. Kelly, Alan G. Konheim:
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues.
128-133
Electronic Edition (ACM DL) BibTeX
- Burton Simon:
Priority Queues with Feedback.
134-149
Electronic Edition (ACM DL) BibTeX
- Joseph JáJá, Viktor K. Prasanna:
Information Transfer in Distributed Computing with Applications to VLSI.
150-162
Electronic Edition (ACM DL) BibTeX
- Douglas R. Smith:
Random Trees and the Analysis of Branch and Bound Procedures.
163-188
Electronic Edition (ACM DL) BibTeX
Volume 31,
Number 2,
April 1984
Volume 31,
Number 3,
July 1984
- Robert S. Boyer, J. Strother Moore:
A Mechanical Proof of the Unsolvability of the Halting Problem.
441-458
Electronic Edition (ACM DL) BibTeX
- Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin:
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.
459-473
Electronic Edition (ACM DL) BibTeX
- François Baccelli, Erol Gelenbe, Brigitte Plateau:
An End-to-End Approach to the Resequencing Problem.
474-485
Electronic Edition (ACM DL) BibTeX
- Ajoy Kumar Datta, Sukumar Ghosh:
Synthesis of a Class of Deadlock-Free Petri Nets.
486-506
Electronic Edition (ACM DL) BibTeX
- Eli Upfal:
Efficient Schemes for Parallel Communication.
507-517
Electronic Edition (ACM DL) BibTeX
- Richard Hull, Chee-Keng Yap:
The Format Model: A Theory of database Organization.
518-544
Electronic Edition BibTeX
- Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with 0(1) Worst Case Access Time.
538-544
Electronic Edition BibTeX
- Joseph F. Traub, Henryk Wozniakowski:
On the Optimal Solution of Large Linear Systems.
545-559
Electronic Edition (ACM DL) BibTeX
- Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe:
A Theory of Communicating Sequential Processes.
560-599
Electronic Edition BibTeX
- John McLean:
A Formal Method for the Abstract Specification of Software.
600-627
Electronic Edition (ACM DL) BibTeX
- Micha Hofri:
Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input.
628-648
Electronic Edition (ACM DL) BibTeX
- Mikhail J. Atallah, S. Rao Kosaraju:
Graph Problems on a Mesh-Connected Processor Array.
649-667
Electronic Edition (ACM DL) BibTeX
- Friedhelm Meyer auf der Heide:
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem.
668-676
Electronic Edition (ACM DL) BibTeX
Volume 31,
Number 4,
October 1984
- S. G. Williamson:
Depth-First Search and Kuratowski Subgraphs.
681-693
Electronic Edition (ACM DL) BibTeX
- Jonathan W. Greene, Abbas El Gamal:
Configuration of VLSI Arrays in the Presence of Defects.
694-717
Electronic Edition (ACM DL) BibTeX
- Catriel Beeri, Moshe Y. Vardi:
A Proof Procedure for Data Dependencies.
718-741
Electronic Edition BibTeX
- Stavros S. Cosmadakis, Christos H. Papadimitriou:
Updates of Relational Views.
742-760
Electronic Edition BibTeX
- Tomasz Imielinski, Witold Lipski Jr.:
Incomplete Information in Relational Databases.
761-791
Electronic Edition BibTeX
- Adam W. Bojanczyk:
Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations.
792-803
Electronic Edition (ACM DL) BibTeX
- Pierre-Jacques Courtois, Pierre Semal:
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition.
804-825
Electronic Edition (ACM DL) BibTeX
- A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Optimum Head Separation in a Disk System with Two Read/Write Heads.
826-838
Electronic Edition BibTeX
- Benjamin Melamed, Micha Yadin:
Numerical Computation of Sojourn-Time Distributions in Queuing Networks.
839-854
Electronic Edition (ACM DL) BibTeX
- Debasis Mitra, Peter J. Weinberger:
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics.
855-878
Electronic Edition BibTeX
- Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz:
Algebraic Structures with Hard Equivalence and Minimization Problems.
879-904
Electronic Edition (ACM DL) BibTeX
- Jan K. Pachl, Ephraim Korach, Doron Rotem:
Lower Bounds for Distributed Maximum-Finding Algorithms.
905-918
Electronic Edition (ACM DL) BibTeX
Copyright © Wed Jun 4 19:13:14 2008
by Michael Ley (ley@uni-trier.de)
