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=383
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Centralized asynchronous broadcast in radio networks
Bogdan S. Chlebus
,
Mariusz A. Rokicki
Theoretical Computer Science
383
(1), 2007, pp. 5-22
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Aleksej Di Salvo
,
Guido Proietti
Theoretical Computer Science
383
(1), 2007, pp. 23-33
Spanners for bounded tree-length graphs
Yon Dourisboure
,
Feodor F. Dragan
,
Cyril Gavoille
,
Chenyu Yan
Theoretical Computer Science
383
(1), 2007, pp. 34-44
Time efficient centralized gossiping in radio networks
Leszek Ga̧sieniec
,
Igor Potapov
,
Qin Xin
Theoretical Computer Science
383
(1), 2007, pp. 45-58
Long-lived Rambo: Trading knowledge for communication
Chryssis Georgiou
,
Peter M. Musial
,
Alexander A. Shvartsman
Theoretical Computer Science
383
(1), 2007, pp. 59-85
Feedback vertex sets in mesh-based networks
Flaminia L. Luccio
,
Jop F. Sibeyn
Theoretical Computer Science
383
(1), 2007, pp. 86-101
Approximation algorithm for hotlink assignment in the greedy model
Rachel Matichin
,
David Peleg
Theoretical Computer Science
383
(1), 2007, pp. 102-110
Circuit principles and weak pigeonhole variants
Chris Pollett
,
Norman Danner
Theoretical Computer Science
383
(2-3), 2007, pp. 115-131
A lower bound on complexity of optimization on the Wiener space
James M. Calvin
Theoretical Computer Science
383
(2-3), 2007, pp. 132-139
State complexity of combined operations
Arto Salomaa
,
Kai Salomaa
,
Sheng Yu
Theoretical Computer Science
383
(2-3), 2007, pp. 140-152
Query-monotonic Turing reductions
Lane A. Hemaspaandra
,
Mayur Thakur
Theoretical Computer Science
383
(2-3), 2007, pp. 153-186
The Kolmogorov complexity of infinite words
Ludwig Staiger
Theoretical Computer Science
383
(2-3), 2007, pp. 187-199
The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
Eugene Eberbach
Theoretical Computer Science
383
(2-3), 2007, pp. 200-243
Algorithmic complexity as a criterion of unsolvability
Mark Burgin
Theoretical Computer Science
383
(2-3), 2007, pp. 244-259
Autopoietic automata: Complexity issues in offspring-producing evolving processes
Jiȓí Wiedermann
Theoretical Computer Science
383
(2-3), 2007, pp. 260-269
Ockham's razor, empirical complexity, and truth-finding efficiency
Kevin T. Kelly
Theoretical Computer Science
383
(2-3), 2007, pp. 270-289