The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
    An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1385-1404 [Journal]
  2. Ruy Luiz Milidiú, Eduardo Sany Laber
    The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1405-1426 [Journal]
  3. David Peleg, Vitaly Rubinovich
    A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1427-1442 [Journal]
  4. Martin E. Dyer, Sandeep Sen
    Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1443-1461 [Journal]
  5. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1462-1484 [Journal]
  6. Harry Buhrman, Leen Torenvliet
    Randomness is Hard. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1485-1501 [Journal]
  7. Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook
    On the Determinization of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1502-1531 [Journal]
  8. Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo
    Algorithms for the Relaxed Online Bin-Packing Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1532-1551 [Journal]
  9. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
    Tight Bounds for Searching a Sorted Array of Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1552-1578 [Journal]
  10. Marcus Brazil, D. A. Thomas, J. F. Weng
    Minimum Networks in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1579-1593 [Journal]
  11. Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
    General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1594-1623 [Journal]
  12. Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks
    A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1624-1661 [Journal]
  13. Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
    Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1662-1677 [Journal]
  14. Luc Devroye, Jean Jabbour, Carlos Zamora-Cura
    Squarish k-d Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1678-1700 [Journal]
  15. Bruno Gaujal, Alain Jean-Marie, Jean Mairesse
    Computations of Uniform Recurrence Equations Using Minimal Memory Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1701-1738 [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