The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1998, volume: 28, number: 1

  1. Haripriyan Hampapuram, Michael L. Fredman
    Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:1-9 [Journal]
  2. Johannes A. La Poutré, Jeffery Westbrook
    Dynamic 2-Connectivity with Backtracking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:10-26 [Journal]
  3. Gregorio Malajovich, Klaus Meer
    On the Structure of NP_C. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:27-35 [Journal]
  4. Marius Zimand
    Weighted NP Optimization Problems: Logical Definability and Approximation Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:36-56 [Journal]
  5. Tomás Feder, Moshe Y. Vardi
    The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:57-104 [Journal]
  6. Thomas H. Cormen, Thomas Sundquist, Leonard F. Wisniewski
    Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:105-136 [Journal]
  7. Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney
    L-Printable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:137-151 [Journal]
  8. Dimitris J. Kavvadias, Martha Sideri
    The Inverse Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:152-163 [Journal]
  9. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
    On Syntactic versus Computational Views of Approximability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:164-191 [Journal]
  10. Stefan Felsner, Lorenz Wernisch
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:192-209 [Journal]
  11. Edith Cohen
    Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:210-236 [Journal]
  12. Uwe Schwiegelshohn, Walter Ludwig, Joel L. Wolf, John Turek, Philip S. Yu
    Smart SMART Bounds for Weighted Response Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:237-253 [Journal]
  13. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
    New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:254-262 [Journal]
  14. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Near-Linear Time Construction of Sparse Neighborhood Covers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:263-277 [Journal]
  15. David Avis, Bryan Beresford-Smith, Luc Devroye, Hossam A. ElGindy, Eric Guévremont, Ferran Hurtado, Binhai Zhu
    Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:278-296 [Journal]
  16. Jonathan E. Atkins, Erik G. Boman, Bruce Hendrickson
    A Spectral Algorithm for Seriation and the Consecutive Ones Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:297-310 [Journal]
  17. Johannes Köbler, Osamu Watanabe
    New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:311-324 [Journal]
  18. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Sublogarithmic Bounds on Space and Reversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:325-340 [Journal]
  19. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator-Based Sparsification II: Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:341-381 [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