The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1991, volume: 20, number: 3

  1. Odile Marcotte, Subhash Suri
    Fast Matching Algorithms for Points on a Polygon. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:405-422 [Journal]
  2. Ouri Wolfson, Adrian Segall
    The Communication Complexity of Atomic Commitment and of Gossiping. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:423-450 [Journal]
  3. Ulrich Baum, Michael Clausen
    Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:451-459 [Journal]
  4. János Pach, Micha Sharir
    On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:460-470 [Journal]
  5. Mitsunori Ogiwara, Osamu Watanabe
    On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:471-483 [Journal]
  6. Viliam Geffert
    Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:484-498 [Journal]
  7. Uri Zwick
    A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:499-505 [Journal]
  8. Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young
    Near-Testable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:506-523 [Journal]
  9. Andrew V. Goldberg, Michael Sipser
    Compression and Ranking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:524-536 [Journal]
  10. Wei Kuan Shih, Jane W.-S. Liu, Jen-Yao Chung
    Algorithms for Scheduling Imprecise Computations with Timing Constraints. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:537-552 [Journal]
  11. Peter Clote, Evangelos Kranakis
    Boolean Functions, Invariance Groups, and Parallel Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:553-590 [Journal]
  12. Joachim von zur Gathen
    Tests for Permutation Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:591-602 [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