Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of the ACM, Volume 31, 1984
Volume 31, Number 1, January 1984
Robert E. Shostak:
Deciding Combinations of Theories. 1-12H. James Hoover, Maria M. Klawe, Nicholas Pippenger:
Bounding Fan-out in Logical Networks. 13-18Peter Eades, Michael Hickey, Ronald C. Read:
Some Hamilton Paths and a Minimal Change Algorithm. 19-29Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman:
On the Structure of Armstrong Relations for Functional Dependencies. 30-46Lawrence J. Henschen, Shamim A. Naqvi:
On compiling queries in recursive first-order databases. 47-85Aurel A. Lazar:
Optimal Flow Control of an M/M/m Queue. 86-98Sidnie Dresher Feit:
A Fast Algorithm for the Two-Variable Integer Programming Problem. 99-113Nimrod Megiddo:
Linear Programming in Linear Time When the Dimension Is Fixed. 114-127Onno J. Boxma, Frank P. Kelly, Alan G. Konheim:
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues. 128-133Burton Simon:
Priority Queues with Feedback. 134-149Joseph JáJá, Viktor K. Prasanna:
Information Transfer in Distributed Computing with Applications to VLSI. 150-162Douglas R. Smith:
Random Trees and the Analysis of Branch and Bound Procedures. 163-188
Volume 31, Number 2, April 1984
Allan Gottlieb, Clyde P. Kruskal:
Complexity Results for Permuting Data and Other Computations on Parallel Processors. 193-209Richard Hull:
Finitely Specifiable Implicational Dependency Families. 210-226Mihalis Yannakakis:
Serializability by Locking. 227-244Robert Endre Tarjan, Jan van Leeuwen:
Worst-case Analysis of Set Union Algorithms. 245-281Karel Culik II, Tero Harju:
The omega-Sequence Problem for DOL Systems Is Decidable. 282-298Harry B. Hunt III:
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes. 299-318C. W. Clenshaw, F. W. J. Olver:
Beyond Floating Point. 319-328George M. Trojan:
Lower Bounds and Fast Algorithms for Sequence Acceleration. 329-335Hans Röck:
The Three-Machine No-Wait Flow Shop is NP-Complete. 336-345James McKenna, Debasis Mitra:
Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks. 346-360Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Some Combinatorial Game Problems Require Omega(nk) Time. 361-376Joseph JáJá:
The VLSI Complexity of Selected Graph Problems. 377-391Christos H. Papadimitriou:
On the complexity of unique solutions. 392-400John H. Reif:
Symmetric Complementation. 401-421John E. Savage:
Space-Time Trade-Offs for Banded Matrix Problems. 422-437
Volume 31, Number 3, July 1984
Robert S. Boyer, J. Strother Moore:
A Mechanical Proof of the Unsolvability of the Halting Problem. 441-458Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin:
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. 459-473François Baccelli, Erol Gelenbe, Brigitte Plateau:
An End-to-End Approach to the Resequencing Problem. 474-485Ajoy Kumar Datta, Sukumar Ghosh:
Synthesis of a Class of Deadlock-Free Petri Nets. 486-506Eli Upfal:
Efficient Schemes for Parallel Communication. 507-517Richard Hull, Chee-Keng Yap:
The Format Model: A Theory of database Organization. 518-544Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with 0(1) Worst Case Access Time. 538-544Joseph F. Traub, Henryk Wozniakowski:
On the Optimal Solution of Large Linear Systems. 545-559Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe:
A Theory of Communicating Sequential Processes. 560-599John McLean:
A Formal Method for the Abstract Specification of Software. 600-627Micha Hofri:
Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input. 628-648Mikhail J. Atallah, S. Rao Kosaraju:
Graph Problems on a Mesh-Connected Processor Array. 649-667Friedhelm Meyer auf der Heide:
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem. 668-676
Volume 31, Number 4, October 1984
S. G. Williamson:
Depth-First Search and Kuratowski Subgraphs. 681-693Jonathan W. Greene, Abbas El Gamal:
Configuration of VLSI Arrays in the Presence of Defects. 694-717Catriel Beeri, Moshe Y. Vardi:
A Proof Procedure for Data Dependencies. 718-741Stavros S. Cosmadakis, Christos H. Papadimitriou:
Updates of Relational Views. 742-760Tomasz Imielinski, Witold Lipski Jr.:
Incomplete Information in Relational Databases. 761-791Adam W. Bojanczyk:
Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations. 792-803Pierre-Jacques Courtois, Pierre Semal:
Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition. 804-825A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Optimum Head Separation in a Disk System with Two Read/Write Heads. 826-838Benjamin Melamed, Micha Yadin:
Numerical Computation of Sojourn-Time Distributions in Queuing Networks. 839-854Debasis Mitra, Peter J. Weinberger:
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics. 855-878Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz:
Algebraic Structures with Hard Equivalence and Minimization Problems. 879-904Jan K. Pachl, Ephraim Korach, Doron Rotem:
Lower Bounds for Distributed Maximum-Finding Algorithms. 905-918
last updated on 2019-10-18 22:57 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
