The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1982, volume: 11, number: 3

  1. Nathan Linial, Michael Tarsi
    The Counterfeit Coin Problem Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:409-415 [Journal]
  2. Michael J. Fischer, Albert R. Meyer, Mike Paterson
    Omega(n log n) Lower Bounds on Length of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:416-427 [Journal]
  3. Andrew Chi-Chih Yao, F. Frances Yao
    On the Average-Case Complexity of Selecting the kth Best. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:428-447 [Journal]
  4. Eitan M. Gurari
    The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:448-452 [Journal]
  5. Micha Hofri, Percy Tzelnic
    The Working Set Size Distribution for the Markov Chain Model of Program Behavior. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:453-466 [Journal]
  6. Don Coppersmith
    Rapid Multiplication of Rectangular Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:467-471 [Journal]
  7. Don Coppersmith, Shmuel Winograd
    On the Asymptotic Complexity of Matrix Multiplication. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:472-492 [Journal]
  8. Barry K. Rosen
    A Lubricant for Data Flow Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:493-511 [Journal]
  9. Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra
    Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:512-520 [Journal]
  10. Bernhard Banaschewski, Evelyn Nelson
    Completions of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:521-528 [Journal]
  11. Dominique Gouyou-Beauchamps
    The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:529-539 [Journal]
  12. Richard Cole, John E. Hopcroft
    On Edge Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:540-546 [Journal]
  13. Henry W. Davis, Leon E. Winslow
    Computational Power in Query Languages. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:547-554 [Journal]
  14. Dorit S. Hochbaum
    Approximation Algorithms for the Set Covering and Vertex Cover Problems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:555-556 [Journal]
  15. Aaron M. Tenenbaum, Richard M. Nemes
    Two Spectra of Self-Organizing Sequential Search Algorithms. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:557-566 [Journal]
  16. Mikhail J. Atallah
    Finding the Cyclic Index of an Irreducible, Nonnegative Matrix. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:567-570 [Journal]
  17. Ronald V. Book, Christopher B. Wilson, Xu Mei-Rui
    Relativizing Time, Space, and Time-Space. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:571-581 [Journal]
  18. Udai Gupta, D. T. Lee, C. K. Wong
    Ranking and Unranking of 2-3 Trees. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:582-590 [Journal]
  19. Jia-Wei Hong
    On Some Deterministic Space Complexity Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:591-601 [Journal]
  20. Virgil D. Gligor, David Maier
    Finding Augmented-Set Bases. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:602-609 [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