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=462
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Variable length local decoding and alignment-free sequence comparison
Gilles Didier
,
Eduardo Corel
,
Ivan Laprevotte
,
Alex Grossmann
,
Claudine Landès-Devauchelle
Theoretical Computer Science
462
, 2012, pp. 1-11
On the competitiveness of AIMD-TPC within a general network
Jeff Edmonds
Theoretical Computer Science
462
, 2012, pp. 12-22
On the max coloring problem
Leah Epstein
,
Asaf Levin
Theoretical Computer Science
462
, 2012, pp. 23-38
Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
Liming Fang
,
Willy Susilo
,
Chunpeng Ge
,
Jiandong Wang
Theoretical Computer Science
462
, 2012, pp. 39-58
Root finding with threshold circuits
Emil Jeȓábek
Theoretical Computer Science
462
, 2012, pp. 59-69
Nimbers are inevitable
Julien Lemoine
,
Simon Viennot
Theoretical Computer Science
462
, 2012, pp. 70-79
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Cuixia Miao
,
Yuzhong Zhang
,
Cuilian Wu
Theoretical Computer Science
462
, 2012, pp. 80-87
Evolvability via the Fourier transform
Loizos Michael
Theoretical Computer Science
462
, 2012, pp. 88-98