default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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
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.
last updated on 2025-12-23 00:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
