The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1992, volume: 21, number: 5

  1. Richard Koch
    Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:801-823 [Journal]
  2. Lin Yu, Daniel J. Rosenkrantz
    Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:824-855 [Journal]
  3. Dany Breslauer, Zvi Galil
    A Lower Bound for Parallel String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:856-862 [Journal]
  4. Ichiro Suzuki, Masafumi Yamashita
    Searching for a Mobile Intruder in a Polygonal Region. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:863-888 [Journal]
  5. Danny Dolev, Tomás Feder
    Determinism vs. Nondeterminism in Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:889-895 [Journal]
  6. John H. Reif, Stephen R. Tate
    On Threshold Circuits and Polynomial Computation. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:896-908 [Journal]
  7. Bettina Just
    Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:909-926 [Journal]
  8. Lenwood S. Heath, Arnold L. Rosenberg
    Laying out Graphs Using Queues. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:927-958 [Journal]
  9. Michael C. Loui, David R. Luginbuhl
    Optimal On-Line Simulations of Tree Machines by Random Access Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:959-971 [Journal]
  10. Siu-Wing Cheng, Ravi Janardan
    New Results on Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:972-999 [Journal]
  11. Egon Balas, Jue Xue
    Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:1000- [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