Journals in DBLP
J. ACM 1985, volume: 32, number: 4
Eugene C. Freuder A Sufficient Condition for Backtrack-Bounded Search [Citation Graph (1, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:755-761 [Journal ] Richard M. Karp , Avi Wigderson A Fast Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:762-773 [Journal ] Domenico Saccà Closures of Database Hypergraphs [Citation Graph (4, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:774-803 [Journal ] Baruch Awerbuch Complexity of Network Synchronization [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:804-823 [Journal ] Gabriel Bracha , Sam Toueg Asynchronous Consensus and Broadcast Protocols [Citation Graph (1, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:824-840 [Journal ] Hector Garcia-Molina , Daniel Barbará How to Assign Votes in a Distributed System [Citation Graph (30, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:841-860 [Journal ] Ulrich Faigle On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:861-870 [Journal ] Ilan Adler , Nimrod Megiddo A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:871-895 [Journal ] Matthew Hennessy Acceptance Trees [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:896-928 [Journal ] Friedhelm Meyer auf der Heide Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:929-937 [Journal ] Shlomo Moran , Marc Snir , Udi Manber Applications of Ramsey's Theorem to Decision Tree Complexity [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:938-949 [Journal ] Mihalis Yannakakis A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees [Citation Graph (0, 0)][DBLP ] J. ACM, 1985, v:32, n:4, pp:950-988 [Journal ]