Journals in DBLP

J. ACM
1993, volume: 40, number: 2

1. Nader H. Bshouty
   On the Complexity of Functions for Random Access Machines. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:211-223 [Journal]
   
2. Andrea S. LaPaugh
   Recontamination Does Not Help to Search a Graph. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:224-245 [Journal]
   
3. David A. McAllester, Robert Givan
   Taxonomic Syntax for First Order Inference. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:246-283 [Journal]
   
4. David A. McAllester
   Automatic Recognition of Tractability in Inference Relations. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:284-303 [Journal]
   
5. David M. Nicol
   The Cost of Conservative Synchronization in Parallel Discrete Event Simulations. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:304-333 [Journal]
   
6. Gil Neiger, Sam Toueg
   Simulating Synchronized Clocks and Common Knowledge in Distributed Systems. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:334-367 [Journal]
   
7. Thomas Lengauer, Egon Wanke
   Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:368-393 [Journal]
   
8. Kin K. Leung
   An Execution/Sleep Scheduling Policy for Serving an Additional Job in Priority Queueing Systems. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:2, pp:394-417 [Journal]