default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 459
Volume 459, November 2012
- Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
Complexity of Gröbner basis detection and border basis detection. 1-15 - Nathalie Aubrun
, Marie-Pierre Béal:
Tree-shifts of finite type. 16-25 - Jérémy Barbay, Johannes Fischer, Gonzalo Navarro:
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations. 26-41 - Marcin Bienkowski, Jaroslaw Kutylowski:
The k-resource problem in uniform metric spaces. 42-54 - Laurent Bienvenu, Christopher P. Porter:
Strong reductions in effective randomness. 55-68 - Jan Bouda, Matej Pivoluska, Martin Plesch:
Improving the Hadamard extractor. 69-76 - Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Algorithms for dominating clique problems. 77-88 - Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan:
Complexity of distance paired-domination problem in graphs. 89-99 - Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
The binary identification problem for weighted trees. 100-112
- Alessandro Cincotti:
The lattice structure of n-player games. 113-119
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 2024-10-31 20:04 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:
