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=297
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The optimal LLL algorithm is still polynomial in fixed dimension
Ali Akhavi
Theoretical Computer Science
297
(1-3), 2003, pp. 3-23
Primality test for nummbers
M
with a large power of 5 dividing
M^4-1
Pedro Berrizbeitia
,
Mauricio Odremán
,
Juan Tena Ayuso
Theoretical Computer Science
297
(1-3), 2003, pp. 25-36
Unambiguous Büchi automata
Olivier Carton
,
Max Michel
Theoretical Computer Science
297
(1-3), 2003, pp. 37-81
A fully dynamic algorithm for distributed shortest paths
Serafino Cicerone
,
Gabriele Di Stefano
,
Daniele Frigioni
,
Umberto Nanni
Theoretical Computer Science
297
(1-3), 2003, pp. 83-102
Optimal and pessimal orderings of Steiner triple systems in disk arrays
Myra B. Cohen
,
Charles J. Colbourn
Theoretical Computer Science
297
(1-3), 2003, pp. 103-117
The permutation-path coloring problem on trees
Sylvie Corteel
,
Mario Valencia-Pabon
,
Danièle Gardy
,
Dominique Barth
,
Alain Denise
Theoretical Computer Science
297
(1-3), 2003, pp. 119-143
Decompositions for the edge colouring of reduced indifference graphs
Celina M.H. de Figueiredo
,
João Meidanis
,
Célia Picinin de Mello
,
Carmen Ortiz
Theoretical Computer Science
297
(1-3), 2003, pp. 145-155
Operational equivalence for interaction nets
Maribel Fernández
,
Ian Mackie
Theoretical Computer Science
297
(1-3), 2003, pp. 157-181
Decomposable multi-parameter matroid optimization problems
David Fernández-Baca
Theoretical Computer Science
297
(1-3), 2003, pp. 183-198
Subresultants revisited
Joachim von zur Gathen
,
Thomas Lücking
Theoretical Computer Science
297
(1-3), 2003, pp. 199-239
Analysis of edge deletion processes on faulty random regular graphs
Andreas Goerdt
,
Mike Molloy
Theoretical Computer Science
297
(1-3), 2003, pp. 241-260
Combinatorics of geometrically distributed random variables: Run statistics
Peter J. Grabner
,
Arnold Knopfmacher Helmut Prodinger
Theoretical Computer Science
297
(1-3), 2003, pp. 261-270
Equations in free semigroups with involution and their relation to equations in free groups
Claudio Gutiérrez
Theoretical Computer Science
297
(1-3), 2003, pp. 271-280
Almost
k
-wise independence and hard Boolean functions
Valentine Kabanets
Theoretical Computer Science
297
(1-3), 2003, pp. 281-295
On the expressivity and complexity of quantitative branching-time temporal logics
F. Laroussinie
,
Ph. Schnoebelen
,
M. Turuani
Theoretical Computer Science
297
(1-3), 2003, pp. 297-315
Generalized covariances of multi-dimensional Brownian excursion local times
Guy Louchard
,
John W. Turner
Theoretical Computer Science
297
(1-3), 2003, pp. 317-336
Undecidable problems in unreliable computations
Richard Mayr
Theoretical Computer Science
297
(1-3), 2003, pp. 337-354
Cube packing
F.K. Miyazawa
,
Y. Wakabayashi
Theoretical Computer Science
297
(1-3), 2003, pp. 355-366
Rank inequalities and separation algorithms for packing designs and sparse triple systems
Lucia Moura
Theoretical Computer Science
297
(1-3), 2003, pp. 367-384
Uniform multi-hop all-to-all optical routings in rings
Jaroslav Opatrny
Theoretical Computer Science
297
(1-3), 2003, pp. 385-397
The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs
Brett Stevens
Theoretical Computer Science
297
(1-3), 2003, pp. 399-424
Emerging behavior as binary search trees are symmetrically updated
Stephen Taylor
,
Marianne Durand
Theoretical Computer Science
297
(1-3), 2003, pp. 425-445
Dynamical analysis of a class of Euclidean algorithms
Brigitte Vallée
Theoretical Computer Science
297
(1-3), 2003, pp. 447-486
Smalll maximal matchings in random graphs
Michele Zito
Theoretical Computer Science
297
(1-3), 2003, pp. 487-507