![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 383
Volume 383, Number 1, September 2007
- Rastislav Kralovic
:
Preface. 1 - Bogdan S. Chlebus, Mariusz A. Rokicki:
Centralized asynchronous broadcast in radio networks. 5-22 - Aleksej Di Salvo, Guido Proietti
:
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. 23-33 - Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan:
Spanners for bounded tree-length graphs. 34-44 - Leszek Gasieniec, Igor Potapov, Qin Xin:
Time efficient centralized gossiping in radio networks. 45-58 - Chryssis Georgiou
, Peter M. Musial, Alexander A. Shvartsman
:
Long-lived Rambo: Trading knowledge for communication. 59-85 - Flaminia L. Luccio
, Jop F. Sibeyn:
Feedback vertex sets in mesh-based networks. 86-101 - Rachel Matichin, David Peleg:
Approximation algorithm for hotlink assignment in the greedy model. 102-110
Volume 383, Numbers 2-3, September 2007
- Mark Burgin, Cristian S. Calude
:
Preface. 111-114
- Chris Pollett, Norman Danner:
Circuit principles and weak pigeonhole variants. 115-131 - James M. Calvin
:
A lower bound on complexity of optimization on the Wiener space. 132-139 - Arto Salomaa, Kai Salomaa, Sheng Yu:
State complexity of combined operations. 140-152 - Lane A. Hemaspaandra
, Mayur Thakur:
Query-monotonic Turing reductions. 153-186 - Ludwig Staiger
:
The Kolmogorov complexity of infinite words. 187-199 - Eugene Eberbach
:
The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems. 200-243 - Mark Burgin:
Algorithmic complexity as a criterion of unsolvability. 244-259 - Jirí Wiedermann
:
Autopoietic automata: Complexity issues in offspring-producing evolving processes. 260-269 - Kevin T. Kelly:
Ockham's razor, empirical complexity, and truth-finding efficiency. 270-289
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.