Journals in DBLP

SIAM J. Comput.
1999, volume: 28, number: 4

1. Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
   Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1155-1166 [Journal]
   
2. Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani
   Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1167-1181 [Journal]
   
3. Sariel Har-Peled
   Constructing Approximate Shortest Path Maps in Three Dimensions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1182-1197 [Journal]
   
4. Jeff Erickson
   New Lower Bounds for Convex Hull Problems in Odd Dimensions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1198-1214 [Journal]
   
5. Luc Devroye
   The Height and Size of Random Hash Trees and Random Pebbled Hash Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1215-1224 [Journal]
   
6. Guo-Hui Lin, Ding-Zhu Du, Xiao-Dong Hu, Guoliang Xue
   On Rearrangeability of Multirate Clos Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1225-1231 [Journal]
   
7. Prasad Tetali
   Design of On-Line Algorithms Using Hitting Times. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1232-1246 [Journal]
   
8. Edward G. Thurber
   Efficient Generation of Minimal Length Addition Chains. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1247-1263 [Journal]
   
9. Jie Wang
   Distributional Word Problem for Groups. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1264-1283 [Journal]
   
10. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1284-1297 [Journal]
    
11. Joseph S. B. Mitchell
    Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1298-1309 [Journal]
    
12. Jin-yi Cai, Alan L. Selman
    Fine Separation of Average-Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1310-1325 [Journal]
    
13. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
    Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1326-1346 [Journal]
    
14. Ichiro Suzuki, Masafumi Yamashita
    Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1347-1363 [Journal]
    
15. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
    A Pseudorandom Generator from any One-way Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1364-1396 [Journal]
    
16. Hagit Attiya, Hadas Shachnai, Tami Tamir
    Local Labeling and Resource Allocation Using Preprocessing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1397-1414 [Journal]
    
17. Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitányi
    Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1414-1432 [Journal]
    
18. Aravind Srinivasan, David Zuckerman
    Computing with Very Weak Random Sources. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1433-1459 [Journal]
    
19. Ketan Mulmuley
    Lower Bounds in a Parallel Model without Bit Operations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1460-1509 [Journal]
    
20. Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
    Stack and Queue Layouts of Directed Acyclic Graphs: Part I. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1510-1539 [Journal]