The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1998, volume: 27, number: 4

  1. Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Fast Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:917-941 [Journal]
  2. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
    Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:942-959 [Journal]
  3. David Shallcross, Victor Y. Pan, Yu Lin-Kriz
    Planar Integer Linear Programming is NC Equivalent to Euclidean GCD. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:960-971 [Journal]
  4. Jeanette P. Schmidt
    All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:972-992 [Journal]
  5. Ran Canetti, Sandy Irani
    Bounding the Power of Preemption in Randomized Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:993-1015 [Journal]
  6. Pankaj K. Agarwal, Subhash Suri
    Surface Approximation and Geometric Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1016-1035 [Journal]
  7. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1036-1072 [Journal]
  8. Hing Leung
    Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1073-1082 [Journal]
  9. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
    An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1083-1098 [Journal]
  10. Dario Bini, Victor Y. Pan
    Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1099-1115 [Journal]
  11. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational Complexity and Knowledge Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1116-1141 [Journal]
  12. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1142-1167 [Journal]
  13. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1168-1189 [Journal]
  14. Greg Barnes, Jeff Edmonds
    Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1190-1202 [Journal]
  15. David Gillman
    A Chernoff Bound for Random Walks on Expander Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1203-1220 [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