|
|
Journals in DBLP
J. ACM
1985, volume: 32, number: 1
- A. Bagchi, A. Mahanti
Three Approaches to Heuristic Search in Networks [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:1-27 [Journal]
- A. Mahanti, A. Bagchi
AND/OR Graph Heuristic Search Methods [Citation Graph (2, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:28-51 [Journal]
- Leslie Lamport, P. M. Melliar-Smith
Synchronizing Clocks in the Presence of Faults [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:52-78 [Journal]
- Serge Abiteboul
Disaggregations in Databases [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:79-101 [Journal]
- Ken Fuchs, Dennis G. Kafura
Memory-Constrained Task Scheduling on a Network of Dual Processors [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:102-129 [Journal]
- Dorit S. Hochbaum, Wolfgang Maass
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:130-136 [Journal]
- Matthew Hennessy, Robin Milner
Algebraic Laws for Nondeterminism and Concurrency [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:137-161 [Journal]
- Hendrik Vantilborgh
Aggregation with an Error of O(epsilon2) [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:162-190 [Journal]
- Danny Dolev, Rüdiger Reischuk
Bounds on Information Exchange for Byzantine Agreement [Citation Graph (1, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:191-204 [Journal]
- Shimon Even, Alan L. Selman, Yacov Yacobi
Hard-Core Theorems for Complexity Classes [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:205-217 [Journal]
- Maria M. Klawe
A Tight Bound for Black and White Pebbles on the Pyramid [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:218-228 [Journal]
- J. C. Lagarias, Andrew M. Odlyzko
Solving Low-Density Subset Sum Problems [Citation Graph (0, 0)][DBLP]
J. ACM, 1985, v:32, n:1, pp:229-246 [Journal]
|
