The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1999, volume: 28, number: 5

  1. Weiping Shi, Douglas B. West
    Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1541-1551 [Journal]
  2. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
    Product Range Spaces, Sensitive Sampling, and Derandomization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1552-1575 [Journal]
  3. Aart J. C. Bik, Harry A. G. Wijshoff
    Automatic Nonzero Structure Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1576-1587 [Journal]
  4. Lenwood S. Heath, Sriram V. Pemmaraju
    Stack and Queue Layouts of Directed Acyclic Graphs: Part II. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1588-1626 [Journal]
  5. Andrej Brodnik, J. Ian Munro
    Membership in Constant Time and Almost-Minimum Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1627-1640 [Journal]
  6. Sanjeev Mahajan, H. Ramesh
    Derandomizing Approximation Algorithms Based on Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1641-1663 [Journal]
  7. Gary L. Miller, Shang-Hua Teng
    The Dynamic Parallel Complexity of Computational Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1664-1688 [Journal]
  8. Ueli M. Maurer, Stefan Wolf
    The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1689-1721 [Journal]
  9. Dorit Dor, Uri Zwick
    Selecting the Median. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1722-1758 [Journal]
  10. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
    Structure in Approximation Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1759-1782 [Journal]
  11. Maurizio Talamo, Paola Vocca
    An Efficient Data Structure for Lattice Operations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1783-1805 [Journal]
  12. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth Allocation with Preemption. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1806-1828 [Journal]
  13. Leslie Ann Goldberg, Yossi Matias, Satish Rao
    An Optical Simulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1829-1847 [Journal]
  14. Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts
    Time-Lapse Snapshots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1848-1874 [Journal]
  15. Douglas Stott Parker Jr., Prasad Ram
    The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1875-1905 [Journal]
  16. Haim Kaplan, Ron Shamir, Robert Endre Tarjan
    Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1906-1922 [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