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=296
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Towards compatible triangulations
Oswin Aichholzer
,
Franz Aurenhammer
,
Ferran Hurtado
,
Hannes Krasser
Theoretical Computer Science
296
(1), 2003, pp. 3-13
On testing for zero polynomials by a set of points with bounded precision
Jin-Yi Cai
,
Eric Bach
Theoretical Computer Science
296
(1), 2003, pp. 15-25
On-line straeam merging in a general setting
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Theoretical Computer Science
296
(1), 2003, pp. 27-46
Computing farthest neighbors on a convex polytope
Otfried Cheong
,
Chan-Su Shin
,
Antoine Vigneron
Theoretical Computer Science
296
(1), 2003, pp. 47-58
Generalized discrete timed automata: Decidable approximations for safety verification
Zhe Dang
,
Oscar H. Ibarra
,
Richard A. Kemmerer
Theoretical Computer Science
296
(1), 2003, pp. 59-74
Polynomial time algorithms for three-label point labeling
Rob Duncan
,
Jianbo Qian
,
Antoine Vigneron
,
Binhai Zhu
Theoretical Computer Science
296
(1), 2003, pp. 75-87
Lower bounds on the minus domination and
k
-subdomination numbers
Liying Kang
,
Hong Qiao
,
Erfang Shan
,
Dingzhu Du
Theoretical Computer Science
296
(1), 2003, pp. 89-98
PC trees and circular-ones arrangements
Wen-Lian Hsu
,
Ross M. McConnell
Theoretical Computer Science
296
(1), 2003, pp. 99-116
Log-space constructible universal traversal sequences for cycles of length
O(n^{4.03})
Michal Koucký
Theoretical Computer Science
296
(1), 2003, pp. 117-144
Generating well-shaped
d
-dimensional Delaunay meshes
Xiang-Yang Li
Theoretical Computer Science
296
(1), 2003, pp. 145-165
Finding the most vital node of a shortest path
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Theoretical Computer Science
296
(1), 2003, pp. 167-177
Non-approximability of weighted multiple sequence alignment
Bodo Manthey
Theoretical Computer Science
296
(1), 2003, pp. 179-192
On the transition graphs of Turing machines
Didier Caucal
Theoretical Computer Science
296
(2), 2003, pp. 195-223
Nonterminal complexity of programmed grammars
Henning Fernau
Theoretical Computer Science
296
(2), 2003, pp. 225-251
Gemmating
P
systems: Collapsing hierarchies
D. Besozzi
,
G. Mauri
,
G. Păun
,
C. Zandron
Theoretical Computer Science
296
(2), 2003, pp. 253-267
Direct constructions of universal extended
H
systems
Pierluigi Frisco
Theoretical Computer Science
296
(2), 2003, pp. 269-293
Tissue
P
systems
Carlos Martín-Vide
,
Gheorghe Păun
,
Juan Pazos
,
Alfonso Rodríguez-Patón
Theoretical Computer Science
296
(2), 2003, pp. 295-326
A universal cellular automaton in the hyperbolic plane
Francine Herrmann
,
Maurice Margenstern
Theoretical Computer Science
296
(2), 2003, pp. 327-364
Cellular automata and intermediate degrees
K. Sutner
Theoretical Computer Science
296
(2), 2003, pp. 365-375
Expressive power of SQL
Leonid Libkin
Theoretical Computer Science
296
(3), 2003, pp. 379-404
Scalar aggregation in inconsistent databases
Marcelo Arenas
,
Leopoldo Bertossi
,
Jan Chomicki
,
Xin He
,
Vijay Raghavan
,
Jeremy Spinrad
Theoretical Computer Science
296
(3), 2003, pp. 405-434
Mining for empty spaces in large data sets
Jeff Edmonds
,
Jarek Gryz
,
Dongming Liang
,
Renée J. Miller
Theoretical Computer Science
296
(3), 2003, pp. 435-452
Algebraic rewritings for optimizing regular path queries
Gösta Grahne
,
Alex Thomo
Theoretical Computer Science
296
(3), 2003, pp. 453-471
The dynamic complexity of tranisitve closure is in DynTC
^0
William Hesse
Theoretical Computer Science
296
(3), 2003, pp. 473-485
Dynamic orthogonal range queries in OLAP
Chung Keung Poon
Theoretical Computer Science
296
(3), 2003, pp. 487-510
Seiten 1
2
>