The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1994, volume: 131, number: 2

  1. Yael Etzion-Petruschka, David Harel, Dale Myers
    On the Solvability of Domino Snake Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:243-269 [Journal]
  2. Craig C. Squier, Friedrich Otto, Yuji Kobayashi
    A Finiteness Condition for Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:271-294 [Journal]
  3. Ramana M. Idury, Alejandro A. Schäffer
    Dynamic Dictionary Matching with Failure Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:295-310 [Journal]
  4. Ernst L. Leiss
    Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:311-330 [Journal]
  5. Hava T. Siegelmann, Eduardo D. Sontag
    Analog Computation via Neural Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:331-360 [Journal]
  6. Peter Eades, Sue Whitesides
    Drawing Graphs in Two Layers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:361-374 [Journal]
  7. Danièle Gardy
    Join Sizes, urn Models and Normal Limiting Distributions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:375-414 [Journal]
  8. Joel Spencer
    Randomization, Derandomization and Antirandomization: Three Games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:415-429 [Journal]
  9. K. Eriksson
    Reachability is Decidable in the Numbers Game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:431-439 [Journal]
  10. Dung T. Huynh, Lu Tian
    A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:441-448 [Journal]
  11. A. Bergey, Robert Cori
    On the Orbits of the Product of two Permutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:449-461 [Journal]
  12. C. Picouleau
    Complexity of the Hamiltonian Cycle in Regular Graph Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:463-473 [Journal]
  13. N. Anderson, D. Manley
    A Matrix Extension of Winograd's Inner Product Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:475-477 [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