The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Thang Nguyen Bui, Andrew Peck
    Partitioning Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:203-215 [Journal]
  2. Wen-Guey Tzeng
    A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:216-227 [Journal]
  3. Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone
    Subgroup Refinement Algorithms for Root Finding in GF(q). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:228-239 [Journal]
  4. David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth
    Learning Integer Lattices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:240-266 [Journal]
  5. Franco P. Preparata, Roberto Tamassia
    Efficient Point Location in a Convex Spatial Cell-Complex. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:267-280 [Journal]
  6. Qingzhou Wang, Kam-Hoi Cheng
    A Heuristic of Scheduling Parallel Tasks and its Analysis. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:281-294 [Journal]
  7. Pang C. Chen
    Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:295-315 [Journal]
  8. Seinosuke Toda, Mitsunori Ogiwara
    Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:316-328 [Journal]
  9. Yossi Azar
    Lower Bounds for Threshold and Symmetric Functions in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:329-338 [Journal]
  10. Chandrajit L. Bajaj, Tamal K. Dey
    Convex Decomposition of Polyhedra and Robustness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:339-364 [Journal]
  11. David W. Krumme
    Fast Gossiping for the Hypercube. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:365-380 [Journal]
  12. Beverly Jamison, Stephan Olariu
    Recognizing P_4 Sparse Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:381-406 [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