The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1997, volume: 26, number: 2

  1. Torben P. Pedersen, Birgit Pfitzmann
    Fail-Stop Signatures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:291-330 [Journal]
  2. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
    The Vertex-Disjoint Menger Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:331-349 [Journal]
  3. Alessandro Panconesi, Aravind Srinivasan
    Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:350-368 [Journal]
  4. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
    Random Debaters and the Hardness of Approximating Stochastic Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:369-400 [Journal]
  5. A. Steinberg
    A Strip-Packing Algorithm with Absolute Performance Bound 2. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:401-409 [Journal]
  6. Shang-Hua Teng, F. Frances Yao
    Approximating Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:410-417 [Journal]
  7. Danny Dolev, Nir Shavit
    Bounded Concurrent Time-Stamping. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:418-455 [Journal]
  8. Paul Walton Purdom Jr., G. Neil Haven
    Probe Order Backtracking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:456-483 [Journal]
  9. Greg N. Frederickson
    Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:484-538 [Journal]
  10. Rajeev Alur, Hagit Attiya, Gadi Taubenfeld
    Time-Adaptive Algorithms for Synchronization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:539-556 [Journal]
  11. Eric Allender, José L. Balcázar, Neil Immerman
    A First-Order Isomorphism Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:557-567 [Journal]
  12. Rakesh M. Verma
    General Techniques for Analyzing Recursive Algorithms with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:568-581 [Journal]
  13. András Sebö
    Potentials in Undirected Graphs and Planar Multiflows. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:582-603 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002