Journals in DBLP

SIAM J. Comput.
2007, volume: 37, number: 2

1. A. Pavan, Srikanta Tirthapura
   Range-Efficient Counting of Distinct Elements in a Massive Data Stream. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:359-379 [Journal]
   
2. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
   Derandomization in Cryptography. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:380-400 [Journal]
   
3. Gregory Mounie, Christophe Rapine, Denis Trystram
   A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:401-412 [Journal]
   
4. Frédéric Magniez, Miklos Santha, Mario Szegedy
   Quantum Algorithms for the Triangle Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:413-424 [Journal]
   
5. Yuri Gurevich, Paul Schupp
   Membership Problem for the Modular Group. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:425-459 [Journal]
   
6. Anna Moss, Yuval Rabani
   Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:460-481 [Journal]
   
7. Eldar Fischer, Ilan Newman
   Testing versus Estimation of Graph Properties. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:482-501 [Journal]
   
8. Amitabha Roy, Howard Straubing
   Definability of Languages by Generalized First-Order Formulas over N⁺. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:502-521 [Journal]
   
9. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
   Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]
   
10. Hartmut Klauck
    One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:552-583 [Journal]
    
11. Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong
    Optimal Expected-Case Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:584-610 [Journal]
    
12. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:611-629 [Journal]
    
13. Naveen Garg, Jochen Könemann
    Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:630-652 [Journal]
    
14. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff
    Approximation Algorithms for Orienteering and Discounted-Reward TSP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:653-670 [Journal]