![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 245
Volume 245, Number 1, 17 August 2000
- Masami Ito, Chrystopher L. Nehaniv:
Semigroups and Algebraic Engineering - Foreword. 1 - Janusz A. Brzozowski:
Delay-insensitivity and ternary simulation. 3-25 - Pál Dömösi, Chrystopher L. Nehaniv
:
On complete systems of automata. 27-54 - Joseph A. Goguen, Grant Malcolm:
A hidden agenda. 55-101 - Balázs Imreh:
On the equivalence of the cube-product and the general product of automata. 103-113 - Masami Ito, Lila Kari, Gabriel Thierrin:
Shuffle and scattered deletion closure of languages. 115-133 - Alexis Maciel, Pierre Péladeau, Denis Thérien:
Programs over semigroups of dot-depth one. 135-148
Volume 245, Number 2, 28 August 2000
- Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Algorithms for the parallel alternating direction access machine. 151-173 - Brigitte Oesterdiekhoff:
Periodic comparator networks. 175-202 - Guillaume Fertin:
On the structure of minimum broadcast digraphs. 203-216 - Cyril Gavoille:
A survey on interval routing. 217-253 - Peter Ruzicka, Daniel Stefankovic
:
On the complexity of multi-dimensional interval routing schemes. 255-280 - Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
A new lower bound for the bipartite crossing number with applications. 281-294
![](https://dblp1.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.