Journals in DBLP

SIAM J. Comput.
2003, volume: 32, number: 3

1. Hasan Cam
   Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:557-585 [Journal]
   
2. Dan Boneh, Matthew K. Franklin
   Identity-Based Encryption from the Weil Pairing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:586-615 [Journal]
   
3. Vladlen Koltun, Micha Sharir
   3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:616-642 [Journal]
   
4. David Eppstein
   Setting Parameters by Example. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:643-653 [Journal]
   
5. Stephan Eidenbenz, Peter Widmayer
   An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:654-670 [Journal]
   
6. Oliver Braun, Günter Schmidt
   Parallel Processor Scheduling with Limited Number of Preemptions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:671-680 [Journal]
   
7. Ronald de Wolf
   Nondeterministic Quantum Query and Communication Complexities. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:681-699 [Journal]
   
8. Timothy M. Chan
   Semi-Online Maintenance of Geometric Optima and Measures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:700-716 [Journal]
   
9. John F. Rudin III, R. Chandrasekaran
   Improved Bounds for the Online Scheduling Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:3, pp:717-735 [Journal]
   
10. Thore Husfeldt, Theis Rauhe
    New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:736-753 [Journal]
    
11. Nadia El-Mabrouk, David Sankoff
    The Reconstruction of Doubled Genomes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:754-792 [Journal]
    
12. Sunil Arya, Ho-Yam Addy Fu
    Expected-Case Complexity of Approximate Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:793-815 [Journal]
    
13. Ramgopal R. Mettu, C. Greg Plaxton
    The Online Median Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:816-832 [Journal]