The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1993, volume: 22, number: 1

  1. Amos Fiat, Moni Naor
    Implicit O(1) Probe Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:1-10 [Journal]
  2. Zvi Galil, Giuseppe F. Italiano
    Maintaining the 3-Edge-Connected Components of a Graph On-Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:11-28 [Journal]
  3. Héctor J. Hernández, Ke Wang
    On the Boundedness of Constant-Time-Maintainable Database Schemes. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:29-45 [Journal]
  4. Weizhen Mao
    Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:46-56 [Journal]
  5. Greg N. Frederickson
    A Note on the Complexity of a Simple Transportation Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:57-61 [Journal]
  6. Robert Cypher
    A Lower Bound on the Size of Shellsort Sorting Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:62-71 [Journal]
  7. Joel Friedman
    A Note on Poset Geometries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:72-78 [Journal]
  8. Sukhamay Kundu
    An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:79-101 [Journal]
  9. Viliam Geffert
    Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:102-113 [Journal]
  10. Michio Oyamaguchi
    NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:114-135 [Journal]
  11. Kazuo Iwama
    ASPACE(o(log log n)) is Regular. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:136-146 [Journal]
  12. Peter Bro Miltersen
    The Complexity of Malign Measures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:147-156 [Journal]
  13. Joseph Cheriyan, Ming-Yang Kao, Ramakrishna Thurimella
    Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:157-174 [Journal]
  14. Andreas Weber
    Decomposing Finite-Valued Transducers and Deciding Their Equivalence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:175-202 [Journal]
  15. Jan Kratochvíl, Petr Savický, Zsolt Tuza
    One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:203-210 [Journal]
  16. Noam Nisan, Avi Wigderson
    Rounds in Communication Complexity Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:211-219 [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