The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2004, volume: 321, number: 2-3

  1. Cláudia Linhares Sales, Frédéric Maffray
    On dart-free perfectly contractile graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:171-194 [Journal]
  2. Keqin Li
    Analysis of randomized load distribution for reproduction trees in linear arrays and rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:195-214 [Journal]
  3. Jason J. Holdsworth
    Graph traversal and graph transformation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:215-231 [Journal]
  4. Matteo Cavaliere, Peter Leupold
    Evolution and observation--a non-standard way to generate formal languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:233-248 [Journal]
  5. Rodney G. Downey, Evan J. Griffiths, Stephanie Reid
    On Kurtz randomness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:249-270 [Journal]
  6. Martin Klazar
    On the least exponential growth admitting uncountably many closed permutation classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:271-281 [Journal]
  7. Gonzalo Navarro, Kimmo Fredriksson
    Average complexity of exact and approximate multiple string matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:283-290 [Journal]
  8. Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
    Updatable timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:291-345 [Journal]
  9. Juan Luis Esteban, Nicola Galesi, Jochen Messner
    On the complexity of resolution with bounded conjunctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:347-370 [Journal]
  10. Richard Nock, Frank Nielsen
    On domain-partitioning induction criteria: worst-case bounds for the worst-case based. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:371-382 [Journal]
  11. Bala Ravikumar
    Peg-solitaire, string rewriting systems and finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:383-394 [Journal]
  12. Dong Pyo Chi, DoYong Kwon
    Sturmian words, beta-shifts, and transcendence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:395-404 [Journal]
  13. Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari
    Longest increasing subsequences in sliding windows. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:405-414 [Journal]
  14. Gerhard J. Woeginger
    Seventeen lines and one-hundred-and-one points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:415-421 [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