The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2000, volume: 30, number: 4

  1. Andrzej Czygrinow, Vojtech Rödl
    An Algorithmic Regularity Lemma for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1041-1066 [Journal]
  2. Assaf Natanzon, Ron Shamir, Roded Sharan
    A Polynomial Approximation Algorithm for the Minimum Fill-In Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1067-1079 [Journal]
  3. Victor Y. Pan
    Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1080-1125 [Journal]
  4. Christian Scheideler, Berthold Vöcking
    From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1126-1155 [Journal]
  5. Eric Ruppert
    Determining Consensus Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1156-1168 [Journal]
  6. Amir Herzberg, Shay Kutten
    Early Detection of Message Forwarding Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1169-1196 [Journal]
  7. Jack H. Lutz, Yong Zhao
    The Density of Weakly Complete Problems under Adaptive Reductions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1197-1210 [Journal]
  8. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
    A Finite State Version of the Kraft--McMillan Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1211-1230 [Journal]
  9. Guy Even, Joseph Naor, Leonid Zosin
    An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1231-1252 [Journal]
  10. Silvio Micali
    Computationally Sound Proofs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1253-1298 [Journal]
  11. Vikraman Arvind, Richard Beigel, Antoni Lozano
    The Complexity of Modular Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1299-1320 [Journal]
  12. Kasturi R. Varadarajan, Pankaj K. Agarwal
    Approximating Shortest Paths on a Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1321-1340 [Journal]
  13. Sariel Har-Peled
    Taking a Walk in a Planar Arrangement. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1341-1367 [Journal]
  14. Xiaoxu Han, Suely Oliveira, David E. Stewart
    Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1368-1383 [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