Journals in DBLP

SIAM J. Comput.
2000, volume: 30, number: 3

1. Wai-Kau Lo, Vassos Hadzilacos
   All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:689-728 [Journal]
   
2. Bin Ma, Ming Li, Louxin Zhang
   From Gene Trees to Species Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:729-752 [Journal]
   
3. Yefim Dinitz, Alek Vainshtein
   The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:753-808 [Journal]
   
4. Christopher L. Barrett, Riko Jacob, Madhav V. Marathe
   Formal-Language-Constrained Path Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:809-837 [Journal]
   
5. Xin He, Ming-Yang Kao, Hsueh-I Lu
   A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:838-846 [Journal]
   
6. Sanjiv Kapoor, S. N. Maheshwari
   Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:847-871 [Journal]
   
7. Håkan Lennerstad, Lars Lundberg
   Optimal Worst Case Formulas Comparing Cache Memory Associativity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:872-905 [Journal]
   
8. Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan
   Markov Paging. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:906-922 [Journal]
   
9. Charles Knessl, Wojciech Szpankowski
   Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:30, n:3, pp:923-964 [Journal]
   
10. Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
    Simple Confluently Persistent Catenable Lists. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:965-977 [Journal]
    
11. Giri Narasimhan, Michiel H. M. Smid
    Approximating the Stretch Factor of Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:978-989 [Journal]
    
12. Manindra Agrawal, Thomas Thierauf
    The Formula Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:990-1009 [Journal]
    
13. Peter Bürgisser
    The Computational Complexity to Evaluate Representations of General Linear Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:1010-1022 [Journal]
    
14. Peter Bürgisser
    The Computational Complexity of Immanants. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:1023-1040 [Journal]