Theoretical Computer Science, Volume 304
Number 304, Volume 1-3, 28 July 2003
- Guy Louchard, Helmut Prodinger: Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. 59-86
- Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park: Truncated suffix trees and their application to data compression. 87-101
- Marco Carpentieri: On the simulation of quantum turing machines. 103-128
- Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. 129-156
- Antonín Kucera: The complexity of bisimilarity-checking for one-counter processes. 157-183
- Jia Lee, Katsunobu Imai, Kenichi Morita: Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. 185-200
- Li Sheng: 2-Role assignments on triangulated graphs. 201-214
- Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker: Hardness results for multicast cost sharing. 215-236
- Guangting Chen, Guoliang Xue: A PTAS for weight constrained Steiner trees in series-parallel graphs. 237-247
- Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo: Regular binoid expressions and regular binoid languages. 291-313
- Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi: Text sparsification via local maxima. 341-364
- Masahiko Fukuyama: A Nim game played on graphs. 387-399
- Masahiko Fukuyama: A Nim game played on graphs II. 401-419
- Yassine Hachaïchi: A descriptive complexity approach to the linear hierarchy. 421-429
- John M. Hitchcock: Fractal dimension and logarithmic loss unpredictability. 431-441
- V. Y. Popov: The approximate period problem for DNA alphabet. 443-447
- Sándor Vágvölgyi: On ground tree transformations and congruences induced by tree automata. 449-459
- Maggie Xiaoyan Cheng, Xiufeng Du, Manki Min, Hung Q. Ngo, Lu Ruan, Jianhua Sun, Weili Wu: Super link-connectivity of iterated line digraphs. 461-469
- Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: On universally easy classes for NP-complete problems. 471-476
- Pablo Dartnell, Alejandro Maass, Fernando Schwartz: Combinatorial constructions associated to the dynamics of one-sided cellular automata. 485-497
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team