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=210
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computable invariance
Vasco Brattka
Theoretical Computer Science
210
(1), 1999, pp. 3-20
Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
Olivier Bournez
Theoretical Computer Science
210
(1), 1999, pp. 21-71
A domain-theoretic approach to computability on the real line
Abbas Edalat
,
Philipp Sünderhauf
Theoretical Computer Science
210
(1), 1999, pp. 73-98
Relatively recursive reals and real functions
Chun-Kuen Ho
Theoretical Computer Science
210
(1), 1999, pp. 99-120
Induction and recursion on the partial real line with applications to REAL PCF
Martín Hötzel Escardó
,
Thomas Streicher
Theoretical Computer Science
210
(1), 1999, pp. 121-157
Polygonal radix representations of complex numbers
Taoufik Safer
Theoretical Computer Science
210
(1), 1999, pp. 159-171
Sign determination in residue number systems
Hervé Brönnimann
,
Ioannis Z. Emiris
,
Victor Y. Pan
,
Sylvain Pion
Theoretical Computer Science
210
(1), 1999, pp. 173-197
Fast evaluation of holonomic functions
Joris van der Hoeven
Theoretical Computer Science
210
(1), 1999, pp. 199-215
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Pascal Koiran
,
Cristopher Moore
Theoretical Computer Science
210
(1), 1999, pp. 217-223
Splicing on tree-like structures
Yasubumi Sakakibara
,
Claudio Ferretti
Theoretical Computer Science
210
(2), 1999, pp. 227-243
Alphabet indexing for approximating features of symbols
Shinichi Shimozono
Theoretical Computer Science
210
(2), 1999, pp. 245-260
On the approximation of protein threading
Tatsuya Akutsu
,
Satoru Miyano
Theoretical Computer Science
210
(2), 1999, pp. 261-275
Tree adjoining grammars for RNA structure prediction
Yasuo Uemura
,
Aki Hasegawa
,
Satoshi Kobayashi
,
Takashi Yokomori
Theoretical Computer Science
210
(2), 1999, pp. 277-303
Classifying molecular sequences using a linkage graph with their pairwise similarities
H. Matsuda
,
T. Ishihara
,
A. Hashimoto
Theoretical Computer Science
210
(2), 1999, pp. 305-325
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Qian-Ping Gu
,
Shietung Peng
,
Hal Sudborough
Theoretical Computer Science
210
(2), 1999, pp. 327-339
Enhanced A* algorithms for multiple alignments: Optimal alignments for several sequences and
k
-opt approximate alignments for large cases
Takahiro Ikeda
,
Horoshi Imai
Theoretical Computer Science
210
(2), 1999, pp. 341-374