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=495
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Further analysis of the remedian algorithm
Domenico Cantone
,
Micha Hofri
Theoretical Computer Science
495
, 2013, pp. 1-16
Reversible Christoffel factorizations
Michelangelo Bucci
,
Alessandro De Luca
,
Luca Q. Zamboni
Theoretical Computer Science
495
, 2013, pp. 17-24
Algorithmic complexity of proper labeling problems
Ali Dehghan
,
Mohammad-Reza Sadeghi
,
Arash Ahadi
Theoretical Computer Science
495
, 2013, pp. 25-36
On minimum cost edge searching
Dariusz Dereniowski
,
Danny Dyer
Theoretical Computer Science
495
, 2013, pp. 37-49
Versatile string kernels
Cees H. Elzinga
,
Hui Wang
Theoretical Computer Science
495
, 2013, pp. 50-65
Selfish bin packing with cardinality constraints
Ron Adar
,
Leah Epstein
Theoretical Computer Science
495
, 2013, pp. 66-80
A colouring protocol for the generalized Russian cards problem
Andrés Cordón-Franco
,
Hans van Ditmarsch
,
David Fernández-Duque
,
Fernando Soler-Toscano
Theoretical Computer Science
495
, 2013, pp. 81-95
The expected asymptotical ratio for preemptive stochastic online problem
Manzhan Gu
,
Xiwen Lu
Theoretical Computer Science
495
, 2013, pp. 96-112