The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1999, volume: 29, number: 2

  1. Benny Chor, Lee-Bath Nelson
    Solvability in Asynchronous Environments II: Finite Interactive Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:351-377 [Journal]
  2. Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan
    Weakly Triangulated Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:378-386 [Journal]
  3. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
    On Approximately Counting Colorings of Small Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:387-400 [Journal]
  4. Stephen J. Bellantoni, Karl-Heinz Niggl
    Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:401-415 [Journal]
  5. Michael T. Goodrich
    Communication-Efficient Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:416-432 [Journal]
  6. J. H. Rieger
    Proximity in Arrangements of Algebraic Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:433-458 [Journal]
  7. Susanne Albers
    Better Bounds for Online Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:459-473 [Journal]
  8. Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu
    Tight Bounds for On-Line Tree Embeddings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:474-491 [Journal]
  9. David R. Karger
    A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:492-514 [Journal]
  10. Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang
    On the Maximum Scatter Traveling Salesperson Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:515-544 [Journal]
  11. Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle
    The Parametrized Complexity of Some Fundamental Problems in Coding Theory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:545-570 [Journal]
  12. Juha Kärkkäinen, Esko Ukkonen
    Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:571-589 [Journal]
  13. Harry Buhrman, Ming Li, John Tromp, Paul M. B. Vitányi
    Kolmogorov Random Graphs and the Incompressibility Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:590-599 [Journal]
  14. Steven C. Bruell, Sukumar Ghosh, Mehmet Hakan Karaata, Sriram V. Pemmaraju
    Self-Stabilizing Algorithms for Finding Centers and Medians of Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:600-614 [Journal]
  15. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Automatic Methods for Hiding Latency in Parallel and Distributed Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:615-647 [Journal]
  16. Aravind Srinivasan
    Improved Approximation Guarantees for Packing and Covering Integer Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:648-670 [Journal]
  17. Frank Ruskey, Joe Sawada
    An Efficient Algorithm for Generating Necklaces with Fixed Density. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:671-684 [Journal]
  18. Zhivko Prodanov Nedev
    Finding an Even Simple Path in a Directed Planar Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:685-695 [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