External Links

Journal: Journal of the ACM

Volume 31, Issue 4

681 -- 693S. G. Williamson. Depth-First Search and Kuratowski Subgraphs
694 -- 717Jonathan W. Greene, Abbas El Gamal. Configuration of VLSI Arrays in the Presence of Defects
718 -- 741Catriel Beeri, Moshe Y. Vardi. A Proof Procedure for Data Dependencies
742 -- 760Stavros S. Cosmadakis, Christos H. Papadimitriou. Updates of Relational Views
761 -- 791Tomasz Imielinski, Witold Lipski Jr.. Incomplete Information in Relational Databases
792 -- 803Adam W. Bojanczyk. Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations
804 -- 825Pierre-Jacques Courtois, Pierre Semal. Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
826 -- 838A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto. Optimum Head Separation in a Disk System with Two Read/Write Heads
839 -- 854Benjamin Melamed, Micha Yadin. Numerical Computation of Sojourn-Time Distributions in Queuing Networks
855 -- 878Debasis Mitra, Peter J. Weinberger. Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
879 -- 904Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz. Algebraic Structures with Hard Equivalence and Minimization Problems
905 -- 918Jan K. Pachl, Ephraim Korach, Doron Rotem. Lower Bounds for Distributed Maximum-Finding Algorithms

Volume 31, Issue 3

441 -- 458Robert S. Boyer, J. Strother Moore. A Mechanical Proof of the Unsolvability of the Halting Problem
459 -- 473Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin. Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
474 -- 485François Baccelli, Erol Gelenbe, Brigitte Plateau. An End-to-End Approach to the Resequencing Problem
486 -- 506Ajoy Kumar Datta, Sukumar Ghosh. Synthesis of a Class of Deadlock-Free Petri Nets
507 -- 517Eli Upfal. Efficient Schemes for Parallel Communication
518 -- 544Richard Hull, Chee-Keng Yap. The Format Model: A Theory of database Organization
538 -- 544Michael L. Fredman, János Komlós, Endre Szemerédi. Storing a Sparse Table with 0(1) Worst Case Access Time
545 -- 559Joseph F. Traub, Henryk Wozniakowski. On the Optimal Solution of Large Linear Systems
560 -- 599Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe. A Theory of Communicating Sequential Processes
600 -- 627John McLean. A Formal Method for the Abstract Specification of Software
628 -- 648Micha Hofri. Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input
649 -- 667Mikhail J. Atallah, S. Rao Kosaraju. Graph Problems on a Mesh-Connected Processor Array
668 -- 676Friedhelm Meyer auf der Heide. A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Volume 31, Issue 2

193 -- 209Allan Gottlieb, Clyde P. Kruskal. Complexity Results for Permuting Data and Other Computations on Parallel Processors
210 -- 226Richard Hull. Finitely Specifiable Implicational Dependency Families
227 -- 244Mihalis Yannakakis. Serializability by Locking
245 -- 281Robert Endre Tarjan, Jan van Leeuwen. Worst-case Analysis of Set Union Algorithms
282 -- 298Karel Culik II, Tero Harju. The omega-Sequence Problem for DOL Systems Is Decidable
299 -- 318Harry B. Hunt III. Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
319 -- 328C. W. Clenshaw, F. W. J. Olver. Beyond Floating Point
329 -- 335George M. Trojan. Lower Bounds and Fast Algorithms for Sequence Acceleration
336 -- 345Hans Röck. The Three-Machine No-Wait Flow Shop is NP-Complete
346 -- 360James McKenna, Debasis Mitra. Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks
361 -- 376Akeo Adachi, Shigeki Iwata, Takumi Kasai. Some Combinatorial Game Problems Require Omega(n:::k:::) Time
377 -- 391Joseph JáJá. The VLSI Complexity of Selected Graph Problems
392 -- 400Christos H. Papadimitriou. On the complexity of unique solutions
401 -- 421John H. Reif. Symmetric Complementation
422 -- 437John E. Savage. Space-Time Trade-Offs for Banded Matrix Problems

Volume 31, Issue 1

1 -- 12Robert E. Shostak. Deciding Combinations of Theories
13 -- 18H. James Hoover, Maria M. Klawe, Nicholas Pippenger. Bounding Fan-out in Logical Networks
19 -- 29Peter Eades, Michael Hickey, Ronald C. Read. Some Hamilton Paths and a Minimal Change Algorithm
30 -- 46Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman. On the Structure of Armstrong Relations for Functional Dependencies
47 -- 85Lawrence J. Henschen, Shamim A. Naqvi. On compiling queries in recursive first-order databases
86 -- 98Aurel A. Lazar. Optimal Flow Control of an M/M/m Queue
99 -- 113Sidnie Dresher Feit. A Fast Algorithm for the Two-Variable Integer Programming Problem
114 -- 127Nimrod Megiddo. Linear Programming in Linear Time When the Dimension Is Fixed
128 -- 133Onno J. Boxma, Frank P. Kelly, Alan G. Konheim. The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
134 -- 149Burton Simon. Priority Queues with Feedback
150 -- 162Joseph JáJá, Viktor K. Prasanna. Information Transfer in Distributed Computing with Applications to VLSI
163 -- 188Douglas R. Smith. Random Trees and the Analysis of Branch and Bound Procedures
runs on