The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2003, volume: 1, number: 304

  1. Andrei A. Muchnik, Alexei L. Semenov, Maxim Ushakov
    Almost periodic sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:1-33 [Journal]
  2. Sara Brunetti, Alain Daurat
    An algorithm reconstructing convex lattice sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:35-57 [Journal]
  3. Guy Louchard, Helmut Prodinger
    Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:59-86 [Journal]
  4. Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park
    Truncated suffix trees and their application to data compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:87-101 [Journal]
  5. Marco Carpentieri
    On the simulation of quantum turing machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:103-128 [Journal]
  6. Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda
    The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:129-156 [Journal]
  7. Antonín Kucera
    The complexity of bisimilarity-checking for one-counter processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:157-183 [Journal]
  8. Jia Lee, Katsunobu Imai, Kenichi Morita
    Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:185-200 [Journal]
  9. Li Sheng
    2-Role assignments on triangulated graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:201-214 [Journal]
  10. Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker
    Hardness results for multicast cost sharing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:215-236 [Journal]
  11. Guangting Chen, Guoliang Xue
    A PTAS for weight constrained Steiner trees in series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:237-247 [Journal]
  12. Karell Bertet, Jens Gustedt, Michel Morvan
    Weak-order extensions of an order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:249-268 [Journal]
  13. Enrico Formenti, Aristide Grange
    Number conserving cellular automata II: dynamics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:269-290 [Journal]
  14. Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo
    Regular binoid expressions and regular binoid languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:291-313 [Journal]
  15. Zoltán Fülöp, Zsolt Gazdag
    Shape preserving top-down tree transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:315-339 [Journal]
  16. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text sparsification via local maxima. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:341-364 [Journal]
  17. Wei-Ting Cao, Zhi-Ying Wen
    Some properties of the factors of Sturmian sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:365-385 [Journal]
  18. Masahiko Fukuyama
    A Nim game played on graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:387-399 [Journal]
  19. Masahiko Fukuyama
    A Nim game played on graphs II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:401-419 [Journal]
  20. Yassine Hachaïchi
    A descriptive complexity approach to the linear hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:421-429 [Journal]
  21. John M. Hitchcock
    Fractal dimension and logarithmic loss unpredictability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:431-441 [Journal]
  22. V. Y. Popov
    The approximate period problem for DNA alphabet. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:443-447 [Journal]
  23. Sándor Vágvölgyi
    On ground tree transformations and congruences induced by tree automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:449-459 [Journal]
  24. Maggie Xiaoyan Cheng, Xiufeng Du, Manki Min, Hung Q. Ngo, Lu Ruan, Jianhua Sun, Weili Wu
    Super link-connectivity of iterated line digraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:461-469 [Journal]
  25. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:471-476 [Journal]
  26. William I. Gasarch, Evan Golub, Aravind Srinivasan
    When does a random Robin Hood win? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:477-484 [Journal]
  27. Pablo Dartnell, Alejandro Maass, Fernando Schwartz
    Combinatorial constructions associated to the dynamics of one-sided cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:485-497 [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