The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2001, volume: 31, number: 1

  1. Jianer Chen, Antonio Miranda
    A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:1-17 [Journal]
  2. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    A Decomposition Theorem for Maximum Weight Bipartite Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:18-26 [Journal]
  3. Ernst Althaus, Kurt Mehlhorn
    Traveling Salesman-Based Curve Reconstruction in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:27-66 [Journal]
  4. Pangfeng Liu, William Aiello, Sandeep N. Bhatt
    Tree Search on an Atomic Model for Message Passing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:67-85 [Journal]
  5. Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
    On-line Randomized Call Control Revisited . [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:86-112 [Journal]
  6. Jörg Flum, Martin Grohe
    Fixed-Parameter Tractability, Definability, and Model-Checking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:113-145 [Journal]
  7. Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein
    Approximation Techniques for Average Completion Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:146-166 [Journal]
  8. Michael Luby, Dana Randall, Alistair Sinclair
    Markov Chain Algorithms for Planar Lattice Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:167-192 [Journal]
  9. Felipe Cucker, Dima Grigoriev
    There are No Sparse NPw-Hard Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:193-198 [Journal]
  10. Antonín Kucera, Theodore A. Slaman
    Randomness and Recursive Enumerability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:199-211 [Journal]
  11. Vincent Bouchitté, Ioan Todinca
    Treewidth and Minimum Fill-in: Grouping the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:212-232 [Journal]
  12. Joan Boyar, Kim S. Larsen, Morten N. Nielsen
    The Accommodating Function: A Generalization of the Competitive Ratio. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:233-258 [Journal]
  13. Joe Sawada
    Generating Bracelets in Constant Amortized Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:259-268 [Journal]
  14. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:269-288 [Journal]
  15. Pavol Hell, Ron Shamir, Roded Sharan
    A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:289-305 [Journal]
  16. Miklós Csürös, Ming-Yang Kao
    Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:306-322 [Journal]
  17. Jing Chao Chen
    Proportion Extend Sort. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:323-330 [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