The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1995, volume: 143, number: 1

  1. Do Long Van, Bertrand Le Saëc, Igor Litovsky
    Characterizations of Rational omega-Languages by Means of Right Congruences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:1-21 [Journal]
  2. Kamala Krithivasan, Meena Mahajan
    Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:23-49 [Journal]
  3. Valentin M. Antimirov, Peter D. Mosses
    Rewriting Extended Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:51-72 [Journal]
  4. Michael A. Bender, Michel Gastaldo, Michel Morvan
    Parallel Interval Order Recognition and Construction of Interval Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:73-91 [Journal]
  5. Arthur S. Goldstein, Edward M. Reingold
    The Complexity of Pursuit on a Graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:93-112 [Journal]
  6. Tao Jiang, Vadim G. Timkovsky
    Shortest Consistent Superstrings Computable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:113-122 [Journal]
  7. Akira Ito, Katsushi Inoue, Itsuo Takanami, Yue Wang
    Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:123-135 [Journal]
  8. Tao Jiang, Lusheng Wang, Kaizhong Zhang
    Alignment of Trees - An Alternative to Tree Edit. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:137-148 [Journal]
  9. David W. Juedes, Jack H. Lutz
    Weak Completeness in E and E_2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:149-158 [Journal]
  10. Pierluigi Crescenzi, Christos H. Papadimitriou
    Reversible Simulation of Space-Bounded Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:159-165 [Journal]
  11. Peter Bro Miltersen
    On the Cell Probe Complexity of Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:167-174 [Journal]
  12. Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano
    Minimal Path Length of Trees with Known Fringe. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:175-188 [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