Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 32, 1985
Volume 32, Number 1, January 1985
- Amitava Bagchi, A. Mahanti:
Three Approaches to Heuristic Search in Networks. 1-27 - A. Mahanti, Amitava Bagchi:
AND/OR Graph Heuristic Search Methods. 28-51 - Leslie Lamport, P. M. Melliar-Smith:
Synchronizing Clocks in the Presence of Faults. 52-78 - Serge Abiteboul:
Disaggregations in Databases. 79-101 - Ken Fuchs, Dennis G. Kafura:
Memory-Constrained Task Scheduling on a Network of Dual Processors. 102-129 - Dorit S. Hochbaum, Wolfgang Maass:
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. 130-136 - Matthew Hennessy, Robin Milner:
Algebraic Laws for Nondeterminism and Concurrency. 137-161 - Hendrik Vantilborgh:
Aggregation with an Error of O(epsilon2). 162-190 - Danny Dolev
, Rüdiger Reischuk:
Bounds on Information Exchange for Byzantine Agreement. 191-204 - Shimon Even, Alan L. Selman, Yacov Yacobi:
Hard-Core Theorems for Complexity Classes. 205-217 - Maria M. Klawe:
A Tight Bound for Black and White Pebbles on the Pyramid. 218-228 - J. C. Lagarias, Andrew M. Odlyzko:
Solving Low-Density Subset Sum Problems. 229-246
Volume 32, Number 2, April 1985
- Michael A. Bauer:
Soundness and Completeness of a Synthesis Algorithm Based on Example Computations. 249-279 - Georg Gottlob, Alexander Leitsch:
On the Efficiency of Subsumption Algorithms. 280-295 - Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa:
Feedback Vertex Sets and Cyclically Reducible Graphs. 296-313 - Gael N. Buckley, Abraham Silberschatz:
Beyond Two-Phase Locking. 314-326 - Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard:
Algorithms for Resolving Conflicts in Dynamic Storage Allocation. 327-343 - M. E. Gonzalez Smith, James A. Storer:
Parallel Algorithms for Data Compression. 344-373 - Michael J. Fischer, Nancy A. Lynch, Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process. 374-382 - Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets. 383-410 - John Staples, V. L. Nguyen:
A Fixpoint Semantics for Nondeterministic Data Flow. 411-444 - Asser N. Tantawi, Donald F. Towsley:
Optimal Static Load Balancing in Distributed Computer Systems. 445-465 - Eitan M. Gurari:
Decidable Problems for Powerful Programs. 466-483 - Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. 484-502
Volume 32, Number 3, July 1985
- Rina Dechter, Judea Pearl:
Generalized Best-First Search Strategies and the Optimality of A*. 505-536 - Edward A. Bender, Jon T. Butler:
Enumeration of Structured Flowcharts. 537-548 - William H. Cunningham:
Optimal Attach and Reinforcement of a Network. 549-561 - C. C. Lee, D. T. Lee:
A Simple On-Line Bin-Packing Algorithm. 562-572 - Bernard Chazelle, Louis Monier:
A Model of Computation for VLSI with Related Complexity Results. 573-588 - Albert G. Greenberg, Shmuel Winograd:
A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels. 589-596 - Dan E. Willard, George S. Lueker:
Adding Range Restriction Capability to Dynamic Data Structures. 597-617 - Y. C. Tay, Rajan Suri, Nathan Goodman:
A Mean Value Performance Model for Locking in Databases: The No-Waiting Case. 618-651 - Daniel Dominic Sleator, Robert Endre Tarjan:
Self-Adjusting Binary Search Trees. 652-686 - Andrew Chi-Chih Yao:
Uniform Hashing Is Optimal. 687-693 - David Zerling:
Generating Binary Trees Using Rotations. 694-701 - Wei-Lu Cao, William J. Stewart:
Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains. 702-719 - Udi Manber, Martin Tompa:
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees. 720-732 - A. Prasad Sistla, Edmund M. Clarke:
The Complexity of Propositional Linear Temporal Logics. 733-749 - Christos H. Papadimitriou:
Correction to "A Theorem in Database Concurrency Control". J. ACM 32(3): 750 (1985)
Volume 32, Number 4, October 1985
- Eugene C. Freuder:
A Sufficient Condition for Backtrack-Bounded Search. 755-761 - Richard M. Karp, Avi Wigderson:
A Fast Parallel Algorithm for the Maximal Independent Set Problem. 762-773 - Domenico Saccà:
Closures of Database Hypergraphs. 774-803 - Baruch Awerbuch:
Complexity of Network Synchronization. 804-823 - Gabriel Bracha, Sam Toueg:
Asynchronous Consensus and Broadcast Protocols. 824-840 - Hector Garcia-Molina, Daniel Barbará:
How to Assign Votes in a Distributed System. 841-860 - Ulrich Faigle:
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms. 861-870 - Ilan Adler, Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension. 871-895 - Matthew Hennessy:
Acceptance Trees. 896-928 - Friedhelm Meyer auf der Heide:
Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines. 929-937 - Shlomo Moran, Marc Snir, Udi Manber:
Applications of Ramsey's Theorem to Decision Tree Complexity. 938-949 - Mihalis Yannakakis:
A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees. 950-988
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
