Journals in DBLP

SIAM J. Comput.
1999, volume: 29, number: 1

1. Uriel Feige, Dror Lapidot, Adi Shamir
   Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:1-28 [Journal]
   
2. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
   Tight Analyses of Two Local Load Balancing Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal]
   
3. Xin He, Zhi-Zhong Chen
   An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:65-80 [Journal]
   
4. Eberhard Bertsch, Mark-Jan Nederhof
   Regular Closure of Deterministic Languages. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:81-102 [Journal]
   
5. Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warnow, Shibu Yooseph
   Constructing Evolutionary Trees in the Presence of Polymorphic Characters. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:103-131 [Journal]
   
6. E. Allen Emerson, Charanjit S. Jutla
   The Complexity of Tree Automata and Logics of Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:132-158 [Journal]
   
7. Naveen Garg, Huzur Saran, Vijay V. Vazirani
   Finding Separator Cuts in Planar Graphs within Twice the Optimal. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:159-179 [Journal]
   
8. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
   Balanced Allocations. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:180-200 [Journal]
   
9. Claudia Bertram-Kretzberg, Hanno Lefmann
   The Algorithmic Aspects of Uncrowded Hypergraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:1, pp:201-230 [Journal]
   
10. Jerzy Marcinkowski
    Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:231-257 [Journal]
    
11. Frank Thomson Leighton, Yuan Ma
    Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:258-273 [Journal]
    
12. Tibor Szkaliczki
    Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is NP-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:274-287 [Journal]
    
13. Weimin Chen, Volker Turau
    On Regular Tree Embeddings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:288-301 [Journal]
    
14. Josef M. Breutzmann, Jack H. Lutz
    Equivalence of Measures of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:302-326 [Journal]
    
15. Shoshana Anily, Michel Gendreau, Gilbert Laporte
    The Swapping Problem on a Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:327-335 [Journal]
    
16. Howard J. Karloff
    How Good is the Goemans-Williamson MAX CUT Algorithm? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:336-350 [Journal]