Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of the ACM, Volume 31, 1984
Volume 31, Number 1, January 1984
- Peter Eades, Michael Hickey, Ronald C. Read:
Some Hamilton Paths and a Minimal Change Algorithm. 19-29 - Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman:
On the Structure of Armstrong Relations for Functional Dependencies. 30-46 - Lawrence J. Henschen, Shamim A. Naqvi:
On compiling queries in recursive first-order databases. 47-85 - Onno J. Boxma, Frank P. Kelly, Alan G. Konheim:
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues. 128-133 - Joseph JáJá, Viktor K. Prasanna:
Information Transfer in Distributed Computing with Applications to VLSI. 150-162
Volume 31, Number 2, April 1984
- Allan Gottlieb, Clyde P. Kruskal:
Complexity Results for Permuting Data and Other Computations on Parallel Processors. 193-209 - Harry B. Hunt III:
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes. 299-318 - James McKenna, Debasis Mitra:
Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks. 346-360 - Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Some Combinatorial Game Problems Require Omega(nk) Time. 361-376
Volume 31, Number 3, July 1984
- Robert S. Boyer, J. Strother Moore:
A Mechanical Proof of the Unsolvability of the Halting Problem. 441-458 - 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 - François Baccelli, Erol Gelenbe, Brigitte Plateau:
An End-to-End Approach to the Resequencing Problem. 474-485 - Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with 0(1) Worst Case Access Time. 538-544 - Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe:
A Theory of Communicating Sequential Processes. 560-599 - Micha Hofri:
Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input. 628-648 - Friedhelm Meyer auf der Heide:
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem. 668-676
Volume 31, Number 4, October 1984
- Jonathan W. Greene, Abbas El Gamal:
Configuration of VLSI Arrays in the Presence of Defects. 694-717 - Adam W. Bojanczyk:
Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations. 792-803 - Pierre-Jacques Courtois, Pierre Semal:
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition. 804-825 - A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Optimum Head Separation in a Disk System with Two Read/Write Heads. 826-838 - Benjamin Melamed, Micha Yadin:
Numerical Computation of Sojourn-Time Distributions in Queuing Networks. 839-854 - Debasis Mitra, Peter J. Weinberger:
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics. 855-878 - Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz:
Algebraic Structures with Hard Equivalence and Minimization Problems. 879-904 - Jan K. Pachl, Ephraim Korach, Doron Rotem:
Lower Bounds for Distributed Maximum-Finding Algorithms. 905-918
maintained by 
at 
at 
last updated on 2018-07-22 22:22 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint