- J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems. J. ACM 32(1): 229-246 (1985) - Leslie Lamport, P. M. Melliar-Smith:
Synchronizing Clocks in the Presence of Faults. J. ACM 32(1): 52-78 (1985) - C. C. Lee, D. T. Lee:
A Simple On-Line Bin-Packing Algorithm. J. ACM 32(3): 562-572 (1985) - A. Mahanti, Amitava Bagchi:
AND/OR Graph Heuristic Search Methods. J. ACM 32(1): 28-51 (1985) - Udi Manber, Martin Tompa:
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees. J. ACM 32(3): 720-732 (1985) - Shlomo Moran, Marc Snir, Udi Manber:
Applications of Ramsey's Theorem to Decision Tree Complexity. J. ACM 32(4): 938-949 (1985) - Christos H. Papadimitriou:
Correction to "A Theorem in Database Concurrency Control". J. ACM 32(3): 750 (1985) - Domenico Saccà
:
Closures of Database Hypergraphs. J. ACM 32(4): 774-803 (1985) - A. Prasad Sistla, Edmund M. Clarke:
The Complexity of Propositional Linear Temporal Logics. J. ACM 32(3): 733-749 (1985) - Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. J. ACM 32(2): 484-502 (1985) - Daniel Dominic Sleator, Robert Endre Tarjan:
Self-Adjusting Binary Search Trees. J. ACM 32(3): 652-686 (1985) - M. E. Gonzalez Smith, James A. Storer:
Parallel Algorithms for Data Compression. J. ACM 32(2): 344-373 (1985) - John Staples, V. L. Nguyen:
A Fixpoint Semantics for Nondeterministic Data Flow. J. ACM 32(2): 411-444 (1985) - Asser N. Tantawi
, Donald F. Towsley
:
Optimal Static Load Balancing in Distributed Computer Systems. J. ACM 32(2): 445-465 (1985) - Y. C. Tay, Rajan Suri, Nathan Goodman:
A Mean Value Performance Model for Locking in Databases: The No-Waiting Case. J. ACM 32(3): 618-651 (1985) - Hendrik Vantilborgh:
Aggregation with an Error of O(epsilon2). J. ACM 32(1): 162-190 (1985) - Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa:
Feedback Vertex Sets and Cyclically Reducible Graphs. J. ACM 32(2): 296-313 (1985) - Dan E. Willard, George S. Lueker:
Adding Range Restriction Capability to Dynamic Data Structures. J. ACM 32(3): 597-617 (1985) - Mihalis Yannakakis:
A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees. J. ACM 32(4): 950-988 (1985) - Andrew Chi-Chih Yao:
Uniform Hashing Is Optimal. J. ACM 32(3): 687-693 (1985) - David Zerling:
Generating Binary Trees Using Rotations. J. ACM 32(3): 694-701 (1985)