The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Frank Thomson Leighton, C. Greg Plaxton
    Hypercubic Sorting Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:1-47 [Journal]
  2. Johan Håstad
    The Shrinkage Exponent of de Morgan Formulas is 2. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:48-64 [Journal]
  3. Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch
    Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:65-89 [Journal]
  4. Amihood Amir, Gary Benson
    Two-Dimensional Periodicity in Rectangular Arrays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:90-106 [Journal]
  5. Martin L. Brady
    A Fast Discrete Approximation Algorithm for the Radon Transform. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:107-119 [Journal]
  6. Thomas W. Cusick
    Value Sets of Some Polynomials Over Finite Fields GF(22m). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:120-131 [Journal]
  7. Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
    Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:132-169 [Journal]
  8. Samuel R. Buss, Peter N. Yianilos
    Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:170-201 [Journal]
  9. Robert D. Blumofe, Charles E. Leiserson
    Space-Efficient Scheduling of Multithreaded Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:202-229 [Journal]
  10. Mikael Goldmann, Marek Karpinski
    Simulating Threshold Circuits by Majority Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:230-246 [Journal]
  11. Juan A. Garay, Yoram Moses
    Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:247-290 [Journal]
  12. Yonatan Aumann, Yuval Rabani
    An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:291-301 [Journal]
  13. Juan A. Garay, Shay Kutten, David Peleg
    A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:1, pp:302-316 [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