Journals in DBLP

J. Comput. Syst. Sci.
1996, volume: 53, number: 3

1. Michael Mitzenmacher
   Bounds on the Greedy Routing Algorithm for Array Networks. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:317-327 [Journal]
   
2. Eric J. Schwabe, Ian M. Sutherland
   Improved Parity-Declustered Layouts for Disk Arrays. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:328-343 [Journal]
   
3. Margaret Reid-Miller
   List Ranking and List Scan on the CRAY C90. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:344-356 [Journal]
   
4. Bhaskar Ghosh, S. Muthukrishnan
   Dynamic Load Balancing by Random Matchings. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:357-370 [Journal]
   
5. Hisao Tamaki
   Construction of the Mesh and the Torus Tolerating a Large Number of Faults. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:371-379 [Journal]
   
6. Mauro Leoncini
   On the Parallel Complexity of Gaussian Elimination with Pivoting. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:380-394 [Journal]
   
7. Shay Halperin, Uri Zwick
   An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:395-416 [Journal]
   
8. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
   Efficient Low-Contention Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:417-442 [Journal]
   
9. Carlo Meghini, Costantino Thanos
   An Optimal Predicate Locking Scheduler. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1996, v:53, n:3, pp:443-468 [Journal]
   
10. Andreas Goerdt
    A Threshold for Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:469-486 [Journal]
    
11. Lila Kari, Gabriel Thierrin
    Maximal and Minimal Solutions to Language Equations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:487-496 [Journal]
    
12. Thomas Eiter, Georg Gottlob
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:497-512 [Journal]
    
13. Tao Jiang, Ming Li
    K One-Way Heads Cannot Do String-Matching. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:513-524 [Journal]
    
14. Jean R. S. Blair, Errol L. Lloyd
    River Routing with a Generalized Model. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:525-544 [Journal]
    
15. Suresh Chari, Pankaj Rohatgi
    On Completeness Under Random Reductions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:545-555 [Journal]
    
16. Joost Engelfriet, Vincent van Oostrom
    Regular Description of Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:556-574 [Journal]
    
17. Jerzy W. Grzymala-Busse, Soe Than
    Partition Triples: A Tool for Reduction of Data Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:575-582 [Journal]
    
18. Sanjay Jain
    Program Synthesis in the Presence of Infinite Number of Inaccuracies. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:583-591 [Journal]