The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1985, volume: 32, number: 4

  1. 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]
  2. 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]
  3. Domenico Saccà
    Closures of Database Hypergraphs [Citation Graph (4, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:774-803 [Journal]
  4. Baruch Awerbuch
    Complexity of Network Synchronization [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:804-823 [Journal]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Matthew Hennessy
    Acceptance Trees [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:896-928 [Journal]
  10. 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]
  11. 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]
  12. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002