Journal: Journal of the ACM

Volume 25, Issue 4

517 -- 525Alon Itai, Michael Rodeh, Steven L. Tanimoto. Some Matching Problems for Bipartite Graphs
526 -- 535Brian Allen, J. Ian Munro. Self-Organizing Binary Search Trees
536 -- 543Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thompson. On the Average Number of Maxima in a Set of Vectors and Applications
544 -- 555Leonidas J. Guibas. The Analysis of Hashing Techniques That Exhibit k-ary Clustering
556 -- 570Donald B. Johnson, Samuel D. Kashdan. Lower Bounds for Selection in X+Y and Other Multisets
571 -- 580Stefano Crespi-Reghizzi, Giovanni Guida, Dino Mandrioli. Noncounting Context-Free Languages
581 -- 595Richard P. Brent, H. T. Kung. Fast Algorithms for Manipulating Formal Power Series
596 -- 611Alon Itai. Two-Commodity Flow
612 -- 619Eugene L. Lawler, Jacques Labetoulle. On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
620 -- 629Hendrik Vantilborgh. Exact Aggregation in Exponential Queueing Networks
630 -- 651Daniel Brand. Path Calculus in Program Verification
652 -- 666Peter J. Downey, Ravi Sethi. Assignment Commands with Array References
667 -- 674Ravi Sethi. Conditional Expressions with Equality Tests
675 -- 686Alexis C. Arvillias, Dimitris G. Maritsas. Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation
687 -- 688Harry B. Hunt III, Thomas G. Szymanski. Corrigendum: Lower Bounds and Reductions Between Grammar Problems

Volume 25, Issue 3

341 -- 351Malcolm C. Harrison, Norman Rubin. Another Generalization of Resolution
352 -- 364Lawrence H. Landweber, Edward L. Robertson. Properties of Conflict-Free and Persistent Petri Nets
365 -- 377Dennis G. Kafura, V. Y. Shen. An Algorithm to Design the Memory Configuration of a Computer Network
378 -- 395Gururaj S. Rao. Performance Analysis of Cache Memories
396 -- 404Doron Rotem, Yaakov L. Varol. Generation of Binary Trees from Ballot Sequences
405 -- 414Ivan Hal Sudborough. On the Tape Complexity of Deterministic Context-Free Languages
415 -- 420Herbert S. Wilf. A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
421 -- 434A. C. McKellar, C. K. Wong. Dynamic Placement of Records in Linear Storage
435 -- 448Robert S. Garfinkel, K. C. Gilbert. The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis
449 -- 460Donald L. Iglehart, Gerald S. Shedler. Regenerative Simulation of Response Times in Networks of Queues
461 -- 480C. A. R. Hoare. Some Properties of Predicate Transformers
481 -- 498Jon T. Butler. Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates
499 -- 508M. R. Garey, David S. Johnson. Strong NP-Completeness Results: Motivation, Examples, and Implications
509 -- 515Nicholas Pippenger. A Time-Space Trade-Off

Volume 25, Issue 2

177 -- 199Edward C. Horvath. Stable Sorting in Asymptotically Optimal Time and Extra Space
200 -- 209Ronald L. Rivest. Optimal Arrangement of Keys in a Hash Table
210 -- 225Clement T. Yu, Gerard Salton, M. K. Siu. Effective Automatic Indexing Using Term Addition and Deletion
226 -- 244Gérard M. Baudet. Asynchronous Iterative Methods for Multiprocessors
245 -- 260H. T. Kung, J. F. Traub. All Algebraic Functions Can Be Computed Fast
261 -- 265William McKie. An Example of a Skewing Function
266 -- 270John M. Mulvey. Pivot Strategies for Primal-Simplex Network Codes
271 -- 282David R. Musser. On the Efficiency of a Polynomial Irreducibility Test
283 -- 303Kenneth J. Omahen, V. Marathe. Analysis and Applications of the Delay Cycle for the M/M/c Queueing System
304 -- 311Andris A. Zoltners. A Direct Descent Binary Knapsack Algorithm
312 -- 321Neil D. Jones, Steven S. Muchnick. The Complexity of Finite Memory Programs with Recursion
322 -- 336David Maier. The Complexity of Some Problems on Subsequences and Supersequences
337 -- 340Andrew Chi-Chih Yao, Ronald L. Rivest. k+1 Heads Are Better than k

Volume 25, Issue 1

1 -- 9Yehoshua Perl, Yossi Shiloach. Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
10 -- 22Luigi Logrippo. Renamings and Economy of Memory in Program Schemata
23 -- 31Ronald V. Book. Simple Representations of Certain Classes of Languages
32 -- 51Harry B. Hunt III, Thomas G. Szymanski. Lower Bounds and Reductions Between Grammar Problems
52 -- 66R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel. KEDMA - Linguistic Tools for Retrieval Systems
67 -- 80William S. Cooper, M. E. Maron. Foundations of Probabilistic and Utility-Theoretic Indexing
81 -- 91Ahmed H. Sameh, David J. Kuck. On Stable Parallel Linear System Solvers
92 -- 101Teofilo F. Gonzalez, Sartaj Sahni. Preemptive Scheduling of Uniform Processor Systems
102 -- 111Zvi Galil, Joel I. Seiferas. A Linear-Time On-Line Recognition Algorithm for Palstar
112 -- 115W. Morven Gentleman. Some Complexity Results for Matrix Computations on Parallel Processors
116 -- 133Oscar H. Ibarra. Reversal-Bounded Multicounter Machines and Their Decision Problems
134 -- 135Harry R. Lewis. Renaming a Set of Clauses as a Horn Set
136 -- 145Claus-Peter Schnorr. Satisfiability Is Quasilinear Complete in NQL
146 -- 167Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer. Separating Nondeterministic Time Complexity Classes
168 -- 175Mitchell Wand. A New Incompleteness Result for Hoare s System