![](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 495
Volume 495, July 2013
- Domenico Cantone
, Micha Hofri:
Further analysis of the remedian algorithm. 1-16 - Michelangelo Bucci, Alessandro De Luca
, Luca Q. Zamboni:
Reversible Christoffel factorizations. 17-24 - Ali Dehghan
, Mohammad-Reza Sadeghi
, Arash Ahadi:
Algorithmic complexity of proper labeling problems. 25-36 - Dariusz Dereniowski
, Danny Dyer:
On minimum cost edge searching. 37-49 - Cees H. Elzinga, Hui Wang
:
Versatile string kernels. 50-65 - Ron Adar, Leah Epstein:
Selfish bin packing with cardinality constraints. 66-80 - Andrés Cordón-Franco
, Hans van Ditmarsch, David Fernández-Duque
, Fernando Soler-Toscano
:
A colouring protocol for the generalized Russian cards problem. 81-95 - Manzhan Gu, Xiwen Lu:
The expected asymptotical ratio for preemptive stochastic online problem. 96-112
![](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.