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=315
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Building continuous webbed models for system
F
S. Berardi
,
C. Berline
Theoretical Computer Science
315
(1), 2004, pp. 3-34
Equilogical spaces
Andrej Bauer
,
Lars Birkedal
,
Dana S. Scott
Theoretical Computer Science
315
(1), 2004, pp. 35-59
Two-level languages for program optimization
Cristiano Calcagno
Theoretical Computer Science
315
(1), 2004, pp. 61-81
Poset-valued sets or how to build models for linear logics
Andrea Schalk
,
Valeria de Paiva
Theoretical Computer Science
315
(1), 2004, pp. 83-107
Real functions incrementally computable by finite automata
Konec̑ný
Theoretical Computer Science
315
(1), 2004, pp. 109-133
The correspondence between partial metrics and semivaluations
M.P. Schellekens
Theoretical Computer Science
315
(1), 2004, pp. 135-149
Encoding types in
ML
-like languages
Zhe Yang
Theoretical Computer Science
315
(1), 2004, pp. 151-190
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
Possible worlds and resources: The semantics of BI
David J. Pym
,
Peter W. O'Hearn
,
Hongseok Yang
Theoretical Computer Science
315
(1), 2004, pp. 257-305
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
Fast arithmetic with general Gau\ss periods
Joachim von zur Gathen
,
Michael Nöcker
Theoretical Computer Science
315
(2-3), 2004, pp. 419-452
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
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate
D. Noutsos
,
S. Serra Capizzano
,
P. Vassalos
Theoretical Computer Science
315
(2-3), 2004, pp. 557-579
Iterative inversion of structured matrices
Victor Y. Pan
,
Marc van Barel
,
Xinmao Wang
,
Gianni Codevico
Theoretical Computer Science
315
(2-3), 2004, pp. 581-592
Deformation techniques to solve generalised Pham systems
Luis Miguel Pardo
,
Jorge San Martín
Theoretical Computer Science
315
(2-3), 2004, pp. 593-625
Parametrization of approximate algebraic curves by lines
Sonia Pérez-Díaz
,
Juana Sendra
,
J. Rafael Sendra
Theoretical Computer Science
315
(2-3), 2004, pp. 627-650
Numerical factorization of multivariate complex polynomials
Andrew J. Sommese
,
Jan Verschelde
,
Charles W. Wampler
Theoretical Computer Science
315
(2-3), 2004, pp. 651-669