![](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 647
Volume 647, September 2016
- Yangjun Chen
, Weixin Shen:
An efficient method to evaluate intersections on big data sets. 1-21 - Ferdinando Cicalese, Balázs Keszegh
, Bernard Lidický
, Dömötör Pálvölgyi
, Tomás Valla
:
On the tree search problem with non-uniform costs. 22-32 - Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
:
Scattered packings of cycles. 33-42 - Manuel Vazquez de Parga, Pedro García, Damián López
:
Minimal consistent DFA revisited. 43-49 - Lin Xiao
:
A new design formula exploited for accelerating Zhang neural network and its application to time-varying matrix inversion. 50-58 - Amr Elmasry, Meng He
, J. Ian Munro, Patrick K. Nicholson
:
Dynamic range majority data structures. 59-73 - Djamal Belazzougui, Roman Kolpakov
, Mathieu Raffinot:
Indexing and querying color sets of images. 74-84 - L'ubomíra Balková
, Michelangelo Bucci, Alessandro De Luca
, Jirí Hladký, Svetlana Puzynina:
Aperiodic pseudorandom number generators based on infinite words. 85-100 - André Luís Vignatti, Murilo Vicente Gonçalves da Silva
:
Minimum vertex cover in generalized random graphs with power law degree distribution. 101-111
![](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.