Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=459
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of Gröbner basis detection and border basis detection
Prabhanjan V. Ananth
,
Ambedkar Dukkipati
Theoretical Computer Science
459
, 2012, pp. 1-15
Tree-shifts of finite type
Nathalie Aubrun
,
Marie-Pierre Béal
Theoretical Computer Science
459
, 2012, pp. 16-25
LRM-trees: Compressed indices, adaptive sorting, and compressed permutations
Jérémy Barbay
,
Johannes Fischer
,
Gonzalo Navarro
Theoretical Computer Science
459
, 2012, pp. 26-41
The
k
-resource problem in uniform metric spaces
Marcin Bienkowski
,
Jarosƚaw Kutyƚowski
Theoretical Computer Science
459
, 2012, pp. 42-54
Strong reductions in effective randomness
Laurent Bienvenu
,
Christopher Porter
Theoretical Computer Science
459
, 2012, pp. 55-68
Improving the Hadamard extractor
Jan Bouda
,
Matej Pivoluska
,
Martin Plesch
Theoretical Computer Science
459
, 2012, pp. 69-76
Algorithms for dominating clique problems
N. Bourgeois
,
F. Della Croce
,
B. Escoffier
,
V.Th. Paschos
Theoretical Computer Science
459
, 2012, pp. 77-88
Complexity of distance paired-domination problem in graphs
Gerard J. Chang
,
B.S. Panda
,
D. Pradhan
Theoretical Computer Science
459
, 2012, pp. 89-99
The binary identification problem for weighted trees
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Caio Valentim
Theoretical Computer Science
459
, 2012, pp. 100-112
The lattice structure of
n
-player games
Alessandro Cincotti
Theoretical Computer Science
459
, 2012, pp. 113-119