Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=304
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Almost periodic sequences
An. Muchnik
,
A. Semenov
,
M. Ushakov
Theoretical Computer Science
304
(1-3), 2003, pp. 1-33
An algorithm reconstructing convex lattice sets
Sara Brunetti
,
Alain Daurat
Theoretical Computer Science
304
(1-3), 2003, pp. 35-57
Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
Guy Louchard
,
Helmut Prodinger
Theoretical Computer Science
304
(1-3), 2003, pp. 59-86
Truncated suffix trees and their application to data compression
Joong Chae Na
,
Alberto Apostolico
,
Costas S. Iliopoulos
,
Kunsoo Park
Theoretical Computer Science
304
(1-3), 2003, pp. 87-101
On the simulation of quantum Turing machines
Marco Carpentieri
Theoretical Computer Science
304
(1-3), 2003, pp. 103-128
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Maciej Liśkiewicz
,
Mitsunori Ogihara
,
Seinosuke Toda
Theoretical Computer Science
304
(1-3), 2003, pp. 129-156
The complexity of bisimilarity-checking for one-counter processes
Antonín Kuc̑era
Theoretical Computer Science
304
(1-3), 2003, pp. 157-183
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Jia Lee
,
Katsunobu Imai
,
Kenichi Morita
Theoretical Computer Science
304
(1-3), 2003, pp. 185-200
2-role assignments on triangulated graphs
Li Sheng
Theoretical Computer Science
304
(1-3), 2003, pp. 201-214
Hardness results for multicast cost sharing
Joan Feigenbaum
,
Arvind Krishnamurthy
,
Rahul Sami
,
Scott Shenker
Theoretical Computer Science
304
(1-3), 2003, pp. 215-236
A PTAS for weight constrained Steiner trees in series-parallel graphs
Guangting Chen
,
Guoliang Xue
Theoretical Computer Science
304
(1-3), 2003, pp. 237-247
Weak-order extensions of an order
Karell Bertet
,
Jens Gustedt
,
Michel Morvan
Theoretical Computer Science
304
(1-3), 2003, pp. 249-268
Number conserving cellular automata II: Dynamics
Enrico Formenti
,
Aristide Grange
Theoretical Computer Science
304
(1-3), 2003, pp. 269-290
Regular binoid expressions and regular binoid languages
Kosaburo Hashiguchi
,
Yoshito Wada
,
Shuji Jimbo
Theoretical Computer Science
304
(1-3), 2003, pp. 291-313
Shape preserving top-down tree transducers
Zoltán Fülöp
,
Zsolt Gazdag
Theoretical Computer Science
304
(1-3), 2003, pp. 315-339
Text sparsification via local maxima
Pilu Crescenzi
,
Alberto Del Lungo
,
Roberto Grossi
,
Elena Lodi
,
Linda Pagli
,
Gianluca Rossi
Theoretical Computer Science
304
(1-3), 2003, pp. 341-364
Some properties of the factors of Sturmian sequences
Wei-Ting Cao
,
Zhi-Ying Wen
Theoretical Computer Science
304
(1-3), 2003, pp. 365-385
A Nim game played on graphs
Masahiko Fukuyama
Theoretical Computer Science
304
(1-3), 2003, pp. 387-399
A Nim game played on graphs II
Masahiko Fukuyama
Theoretical Computer Science
304
(1-3), 2003, pp. 401-419
A descriptive complexity approach to the linear hierarchy
Yassine Hachaïchi
Theoretical Computer Science
304
(1-3), 2003, pp. 421-429
Fractal dimension and logarithmic loss unpredictability
John M. Hitchcock
Theoretical Computer Science
304
(1-3), 2003, pp. 431-441
The approximate period problem for DNA alphabet
V.Y. Popov
Theoretical Computer Science
304
(1-3), 2003, pp. 443-447
On ground tree transformations and congruences induced by tree automata
Sándor Vágvölgyi
Theoretical Computer Science
304
(1-3), 2003, pp. 449-459
Super link-connectivity of iterated line digraphs
Xiaoyan Cheng
,
Xiufeng Du
,
Manki Min
,
Hung Q. Ngo
,
Lu Ruan
,
Jianhua Sun
,
Weili Wu
Theoretical Computer Science
304
(1-3), 2003, pp. 461-469
On universally easy classes for
NP
-complete problems
Erik D. Demaine
,
Alejandro López-Ortiz
,
J. Ian Munro
Theoretical Computer Science
304
(1-3), 2003, pp. 471-476
Seiten 1
2
>