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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal length test vectors for multiple-fault detection
Z. Füredi
,
R.P. Kurshan
Theoretical Computer Science
315
(1), 2004, pp. 191-208
Semantic models for information flow
Gavin Lowe
Theoretical Computer Science
315
(1), 2004, pp. 209-256
Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
Zheng-Jian Bai
,
Raymond H. Chan
Theoretical Computer Science
315
(2-3), 2004, pp. 309-318
Bernstein-Bezoutian matrices
D.A. Bini
,
L. Gemignani
Theoretical Computer Science
315
(2-3), 2004, pp. 319-333
Polynomial equation solving by lifting procedures for ramified fibers
A. Bompadre
,
G. Matera
,
R. Wachenchauzer
,
A. Waissbein
Theoretical Computer Science
315
(2-3), 2004, pp. 335-369
Approximating shortest path for the skew lines problem in time doubly logarithmic in
1/\epsilon
D. Burago
,
D. Grigoriev
,
A. Slissenko
Theoretical Computer Science
315
(2-3), 2004, pp. 371-404
The abc conjecture and correctly rounded reciprocal square roots
Ernie Croot
,
Ren-Cang Li
,
Hui June Zhu
Theoretical Computer Science
315
(2-3), 2004, pp. 405-417
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
Georg Heinig
,
Karla Rost
Theoretical Computer Science
315
(2-3), 2004, pp. 453-468
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Igor Kaporin
Theoretical Computer Science
315
(2-3), 2004, pp. 469-510
Fast inversion of triangular Toeplitz matrices
Fu-Rong Lin
,
Wai-Ki Ching
,
Michael K. Ng
Theoretical Computer Science
315
(2-3), 2004, pp. 511-523
High probability analysis of the condition number of sparse polynomial systems
Gregorio Malajovich
,
Maurice Rojas
Theoretical Computer Science
315
(2-3), 2004, pp. 525-555
Dichotomies for classes of homomorphism problems involving unary functions
Tomás Feder
,
Florent Madelaine
,
Iain A. Stewart
Theoretical Computer Science
314
(1-2), 2004, pp. 1-43
Strategies for the Renyi-Ulam game with fixed number of lies
Christian Deppe
Theoretical Computer Science
314
(1-2), 2004, pp. 45-55
From object grammars to ECO systems
Enrica Duchi
,
Jean-Marc Fedou
,
Simone Rinaldi
Theoretical Computer Science
314
(1-2), 2004, pp. 57-95
Two-dimensional pattern matching with rotations
Amihood Amir
,
Ayelet Butman
,
Maxime Crochemore
,
Gad M. Landau
,
Mary Schaps
Theoretical Computer Science
314
(1-2), 2004, pp. 173-187
Local periods and binary partial words: An algorithm
F. Blanchet-Sadri
,
Ajay Chriscoe
Theoretical Computer Science
314
(1-2), 2004, pp. 189-216
On the complexity of inducing categorical and quantitative association rules
Fabrizio Angiulli
,
Giovambattista Ianni
,
Luigi Palopoli
Theoretical Computer Science
314
(1-2), 2004, pp. 217-249
Sequential computation of linear Boolean mappings
Serge Burckel
,
Marianne Morillon
Theoretical Computer Science
314
(1-2), 2004, pp. 287-292
Routing algorithm for multicast under multi-tree model in optical networks
Jun Gu
,
Xiao-Dong Hu
,
Xiaohua Jia
,
Mu-Hong Zhang
Theoretical Computer Science
314
(1-2), 2004, pp. 293-301
Efficiency and equilibrium in the electronic mail game; The general case
Nicola Dimitri
Theoretical Computer Science
314
(3), 2004, pp. 335-349
Randomness in secret sharing and visual cryptography schemes
Annalisa De Bonis
,
Alfredo De Santis
Theoretical Computer Science
314
(3), 2004, pp. 351-374
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
F.H. Chang
,
J.Y. Guo
,
F.K. Hwang
,
C.K. Lin
Theoretical Computer Science
314
(3), 2004, pp. 375-386
Hierarchies of tree series transformations
Zoltán Fülöp
,
Zsolt Gazdag
,
Heiko Vogler
Theoretical Computer Science
314
(3), 2004, pp. 387-429
Context-freeness of the power of context-free languages is undecidable
Henning Bordihn
Theoretical Computer Science
314
(3), 2004, pp. 445-449
Representing recursively enumerable languages by iterated deletion
Michael Domaratzki
,
Alexander Okhotin
Theoretical Computer Science
314
(3), 2004, pp. 451-457
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>