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 YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Michael U. Gerber
,
Daniel Kobler
Theoretical Computer Science
299
(1-3), 2003, pp. 719-734
Some complexity results for polynomial rational expressions
P.-C. Héam
Theoretical Computer Science
299
(1-3), 2003, pp. 735-741
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Riccardo Silvestri
Theoretical Computer Science
299
(1-3), 2003, pp. 751-761
Bilateral locally testable languages
Pedro García
,
José Ruiz
,
Manuel Vazquez de Parga
Theoretical Computer Science
299
(1-3), 2003, pp. 775-783
PC grammar systems with five context-free components generate all recursively enumberable languages
Erzsébet Csuhaj-Varjú
,
Gheorghe Păun
,
György Vaszil
Theoretical Computer Science
299
(1-3), 2003, pp. 785-794
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model
Tatsuya Akutsu
,
Satoru Kuhara
,
Osamu Maruyama
,
Satoru Miyano
Theoretical Computer Science
298
(1), 2003, pp. 235-251
Infinitary lambda calculus and discrimination of Berarducci trees
Mariangiola Dezani-Ciancaglini
,
Paula Severi
,
Fer-Jan de Vries
Theoretical Computer Science
298
(2), 2003, pp. 275-302
Uniformly hard languages
Rod Downey
,
Lance Fortnow
Theoretical Computer Science
298
(2), 2003, pp. 303-315
On the parametric complexity of schedules to minimize tardy tasks
Michael R. Fellows
,
Catherine McCartin
Theoretical Computer Science
298
(2), 2003, pp. 317-324
Secrecy types for asymmetric communication
Martín Abadi
,
Bruno Blanchet
Theoretical Computer Science
298
(3), 2003, pp. 387-415
Equational theories of tropical semirings
Luca Aceto
,
Zoltán Ésik
,
Anna Ingólfsdóttir
Theoretical Computer Science
298
(3), 2003, pp. 417-469
Observational logic, constructor-based logic, and their duality
Michel Bidoit
,
Rolf Hennicker
,
Alexander Kurz
Theoretical Computer Science
298
(3), 2003, pp. 471-510
The finite graph problem for two-way alternating automata
Mikoƚaj Bojańczyk
Theoretical Computer Science
298
(3), 2003, pp. 511-528
Expired data collection in shared dataspaces
Nadia Busi
,
Gianluigi Zavattaro
Theoretical Computer Science
298
(3), 2003, pp. 529-556
Program logic and equivalence in the presence of garbage collection
Cristiano Calcagno
,
Peter O'Hearn
,
Richard Bornat
Theoretical Computer Science
298
(3), 2003, pp. 557-581
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
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
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
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>