External Links

Journal: Journal of the ACM

Volume 29, Issue 4

907 -- 927Fouad A. Tobagi. Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access
928 -- 951James A. Storer, Thomas G. Szymanski. Data compression via textural substitution
952 -- 985Ronald Fagin. Horn clauses and database dependencies
986 -- 997John Grant, Barry E. Jacobs. On the family of generalized dependency constraints
998 -- 1006Christos H. Papadimitriou. A theorem in database concurrency control
1007 -- 1022John C. Beatty. On the relationship between LL(1) and LR(1) grammars
1023 -- 1048Toshimi Minoura. Deadlock avoidance revisited
1049 -- 1072Eugene W. Stark. Semaphore primitives and starvation-free mutual exclusion
1073 -- 1086Leslie M. Goldschlager. A universal interconnection pattern for parallel computers
1087 -- 1130Thomas Lengauer, Robert Endre Tarjan. Asymptotically tight bounds on time-space trade-offs in a pebble game
1131 -- 1143David W. Matula. Basic digit sets for radix representation
1144 -- 1165Carl H. Smith. The Power of Pluralism for Automatic Program Synthesis
1166 -- 1181Esko Ukkonen. The equivalence problem for some non-real-time deterministic pushdown automata

Volume 29, Issue 3

603 -- 622Robert W. Floyd, Jeffrey D. Ullman. The Compilation of Regular Expressions into Integrated Circuits
623 -- 641K. Takamizawa, Takao Nishizeki, Nobuji Saito. Linear-time computability of combinatorial problems on series-parallel graphs
642 -- 667David Nassimi, Sartaj Sahni. Parallel permutation and sorting algorithms and a new generalized connection network
668 -- 677Peter Honeyman. Testing satisfaction of functional dependencies
678 -- 698Seymour Ginsburg, Sami Mohammed Zaiddan. Properties of functional-dependency families
699 -- 717Anthony C. Klug. Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
718 -- 740Mihalis Yannakakis. A Theory of Safe Locking Policies in Database Systems
741 -- 765Dana Angluin. Inference of Reversible Languages
766 -- 780Harold N. Gabow. An Almost-Linear Algorithm for Two-Processor Scheduling
781 -- 811Errol L. Lloyd. Critical Path Scheduling with Resource and Processor Constraints
812 -- 829Charles U. Martel. Preemptive Scheduling with Release Times, Deadlines, and Due Times
830 -- 840Christopher L. Samelson, William G. Bulgren. A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means
841 -- 862Krzysztof R. Apt, Maarten H. van Emden. Contributions to the Theory of Logic Programming
863 -- 873Eitan M. Gurari, Oscar H. Ibarra. Two-Way Counter Machines and Diophantine Equations
874 -- 897Mark Jerrum, Marc Snir. Some Exact Complexity Results for Straight-Line Computations over Semirings
898 -- 903Andrew Chi-Chih Yao. On Parallel Computation for the Knapsack Problem
904 -- 0Richard P. Brent, H. T. Kung. Corrigendum: The Area-Time Complexity of Binary Multiplication

Volume 29, Issue 2

273 -- 284Steve Winker. Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
285 -- 309Christos H. Papadimitriou, Mihalis Yannakakis. The complexity of restricted spanning tree problems
310 -- 332Barry E. Jacobs. On Database Logic
333 -- 362Y. Edmund Lien. On the Equivalence of Database Models
363 -- 372Fereidoon Sadri, Jeffrey D. Ullman. Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization
373 -- 393Edward Sciore. A Complete Axiomatization of Full Join Dependencies
394 -- 403Ravi Sethi. Useless Actions Make a Difference: Strict Serializability of Database Updates
404 -- 407Christopher Bader, Arnaldo Moura. A Generalization of Ogden s Lemma
408 -- 428Jacques Cohen, Timothy J. Hickey, Joel Katcoff. Upper Bounds for Speedup in Parallel Parsing
429 -- 447Harry B. Hunt III. On the Decidability of Grammar Problems
448 -- 460Theodore Brown. Determination of the conditional response for quantum allocation algorithms
461 -- 477R. M. Bryant. Maximum Processing Rates of Memory Bound Systems
478 -- 491Hisao Kameda. A Finite-Source Queue with Different Customers
492 -- 513Simon S. Lam. Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
514 -- 526Manfred Ruschitzka. The Performance of Job Classes with Distinct Policy Functions
527 -- 554Percy Tzelnic, Izidor Gertner. An Approach to Program Behavior Modeling and Optimal Memory Control
555 -- 576Albert R. Meyer, Joseph Y. Halpern. Axiomatic Definitions of Programming Languages: A Theoretical Assessment
577 -- 602Michael A. Arbib, Ernest G. Manes. The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions

Volume 29, Issue 1

1 -- 23George W. Ernst, Michael M. Goldstein. Mechanical Discovery of Classes of Problem-Solving Strategies
24 -- 32Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search
33 -- 57Drew V. McDermott. Nonmonotonic Logic II: Nonmonotonic Modal Theories
58 -- 67Ronald I. Becker, Stephen R. Schach, Yehoshua Perl. A Shifting Algorithm for Min-Max Tree Partitioning
68 -- 95Christoph Martin Hoffmann, Michael James O'Donnell. Pattern Matching in Trees
96 -- 102Zvi Galil. An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
118 -- 126Hermann A. Maurer, Arto Salomaa, Derick Wood. Dense Hierarchies of Grammatical Families
127 -- 151D. Chow, Clement T. Yu. On the Construction of Feedback Queries
152 -- 170Clement T. Yu, K. Lam, Gerard Salton. Term Weighting in Information Retrieval Using the Term Precision Model
171 -- 182Ronald V. Book. Confluent and Other Types of Thue Systems
183 -- 205James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson. Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
206 -- 227Hans-Dieter Ehrich. On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
228 -- 249Harry B. Hunt III. On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
250 -- 260Michael L. Fredman. The Complexity of Maintaining an Array and Computing Its Partial Sums
261 -- 268Charles Rackoff. Relativized Questions Involving Probabilistic Algorithms
runs on