![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 520
Volume 520, February 2014
- Hui Xu, Jing Tian, Xianzhong Zhao:
Monoid-matrix type automata. 1-10 - Shailesh Vaya:
Information dissemination in unknown radio networks with large labels. 11-26 - Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised broadcasting: Memory vs. randomness. 27-42 - Tadao Takaoka:
Sharing information for the all pairs shortest path problem. 43-50 - Guomin Yang
, Chik How Tan, Yi Mu, Willy Susilo
, Duncan S. Wong:
Identity based identification from algebraic coding theory. 51-61 - Urs Wagner, Gérard Maze:
Improvements in closest point search based on dual HKZ-bases. 62-74 - Zhen-Mu Hong
, Jun-Ming Xu:
Vulnerability of super edge-connected networks. 75-86 - Jørgen Bang-Jensen
, Anders Yeo
:
The complexity of multicut and mixed multicut problems in (di)graphs. 87-96 - Shiying Wang, Kai Feng:
Strong matching preclusion for torus networks. 97-110 - Ferruh Özbudak
, Oguz Yayla
:
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes. 111-123
- Renyu Xu
, Jian-Liang Wu:
Total coloring of planar graphs with 7-cycles containing at most two chords. 124-129 - Zeljko Vrba, Pål Halvorsen, Carsten Griwodz:
A correction to Andersson's fusion tree construction. 130-132 - Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
Partitioning powers of traceable or hamiltonian graphs. 133-137
![](https://dblp.dagstuhl.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.