Journals in DBLP

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

1. Rina Dechter, Judea Pearl
   Generalized Best-First Search Strategies and the Optimality of A* [Citation Graph (1, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:505-536 [Journal]
   
2. Edward A. Bender, Jon T. Butler
   Enumeration of Structured Flowcharts [Citation Graph (0, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:537-548 [Journal]
   
3. William H. Cunningham
   Optimal Attach and Reinforcement of a Network [Citation Graph (0, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:549-561 [Journal]
   
4. C. C. Lee, D. T. Lee
   A Simple On-Line Bin-Packing Algorithm [Citation Graph (0, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:562-572 [Journal]
   
5. Bernard Chazelle, Louis Monier
   A Model of Computation for VLSI with Related Complexity Results [Citation Graph (0, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:573-588 [Journal]
   
6. Albert G. Greenberg, Shmuel Winograd
   A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels [Citation Graph (0, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:589-596 [Journal]
   
7. Dan E. Willard, George S. Lueker
   Adding Range Restriction Capability to Dynamic Data Structures [Citation Graph (4, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:597-617 [Journal]
   
8. Y. C. Tay, Rajan Suri, Nathan Goodman
   A Mean Value Performance Model for Locking in Databases: The No-Waiting Case [Citation Graph (15, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:618-651 [Journal]
   
9. Daniel Dominic Sleator, Robert Endre Tarjan
   Self-Adjusting Binary Search Trees [Citation Graph (4, 0)][DBLP]
   J. ACM, 1985, v:32, n:3, pp:652-686 [Journal]
   
10. Andrew Chi-Chih Yao
    Uniform Hashing Is Optimal [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:687-693 [Journal]
    
11. David Zerling
    Generating Binary Trees Using Rotations [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:694-701 [Journal]
    
12. Wei-Lu Cao, William J. Stewart
    Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:702-719 [Journal]
    
13. Udi Manber, Martin Tompa
    The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:720-732 [Journal]
    
14. A. Prasad Sistla, Edmund M. Clarke
    The Complexity of Propositional Linear Temporal Logics [Citation Graph (5, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:733-749 [Journal]
    
15. Christos H. Papadimitriou
    Correction to ``A Theorem in Database Concurrency Control'' [Citation Graph (1, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:750- [Journal]