The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1994, volume: 23, number: 4

  1. Ashok Subramanian
    A New Approach to Stable Matching Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:671-700 [Journal]
  2. Benny Chor, Amos Israeli, Ming Li
    Wait-Free Consensus Using Asynchronous Hardware. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:701-712 [Journal]
  3. Sampath Kannan, Tandy Warnow
    Inferring Evolutionary History from DNA Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:713-737 [Journal]
  4. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:738-761 [Journal]
  5. Jack H. Lutz, Elvira Mayordomo
    Measure, Stochasticity, and the Density of Hard Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:762-779 [Journal]
  6. Alexander Schrijver
    Finding k Disjoint Paths in a Directed Planar Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:780-788 [Journal]
  7. Karel Culik II, Juhani Karhumäki
    Finite Automata Computing Real Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:789-814 [Journal]
  8. Nader H. Bshouty
    On the Complexity of Bilinear Forms over Associative Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:815-833 [Journal]
  9. Prakash V. Ramanan
    A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:834-851 [Journal]
  10. Luca Aceto
    On "Axiomatising Finite Concurrent Processes". [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:852-863 [Journal]
  11. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiterminal Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:864-894 [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