Journals in DBLP

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

1. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
   The Angular-Metric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:697-711 [Journal]
   
2. B. Natarajan
   On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:712-727 [Journal]
   
3. Mark Levene, George Loizou
   Navigation in Hypertext Is Easy Only Sometimes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:728-760 [Journal]
   
4. Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
   A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:761-778 [Journal]
   
5. Paolo Boldi, Sebastiano Vigna
   Complexity of Deciding Sense of Direction. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:779-789 [Journal]
   
6. Amos Fiat, Moni Naor
   Rigorous Time/Space Trade-offs for Inverting Functions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:790-803 [Journal]
   
7. Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg
   Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:804-833 [Journal]
   
8. Leslie Ann Goldberg, Mark Jerrum
   Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:834-853 [Journal]
   
9. Scott E. Decatur, Oded Goldreich, Dana Ron
   Computational Sample Complexity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:29, n:3, pp:854-879 [Journal]
   
10. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:880-892 [Journal]
    
11. S. Rao Kosaraju, Giovanni Manzini
    Compression of Low Entropy Strings with Lempel-Ziv Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:893-911 [Journal]
    
12. Pankaj K. Agarwal, Alon Efrat, Micha Sharir
    Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:912-953 [Journal]
    
13. Z. Sweedyk
    A 2½-Approximation Algorithm for Shortest Superstring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:954-986 [Journal]
    
14. Ioan I. Macarie
    On the Structure of Logspace Probabilistic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:987-1007 [Journal]
    
15. Flávio Keidi Miyazawa, Yoshiko Wakabayashi
    Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:1008-1029 [Journal]