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=560, Part 2
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The worst case behavior of randomized gossip protocols
Hervé Baumann
,
Pierre Fraigniaud
,
Hovhannes A. Harutyunyan
,
Rémi de Verclos
Theoretical Computer Science
560, Part 2
, 2014, pp. 108-120
Lower bounds of shortest vector lengths in random NTRU lattices
Jingguo Bi
,
Qi Cheng
Theoretical Computer Science
560, Part 2
, 2014, pp. 121-130
Implicit computation of maximum bipartite matchings by sublinear functional operations
Beate Bollig
,
Marc Gillé
,
Tobias Pröger
Theoretical Computer Science
560, Part 2
, 2014, pp. 131-146
Approximating MAX SAT by moderately exponential and parameterized algorithms
Bruno Escoffier
,
Vangelis Th. Paschos
,
Emeric Tourniaire
Theoretical Computer Science
560, Part 2
, 2014, pp. 147-157
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
Qilong Feng
,
Jianxin Wang
,
Chao Xu
,
Jinyi Yao
,
Jianer Chen
Theoretical Computer Science
560, Part 2
, 2014, pp. 158-171
Timed encryption with application to deniable key exchange
Shaoquan Jiang
Theoretical Computer Science
560, Part 2
, 2014, pp. 172-189
Online optimization of busy time on parallel machines
Mordechai Shalom
,
Ariella Voloshin
,
Prudence W.H. Wong
,
Fencol C.C. Yung
,
Shmuel Zaks
Theoretical Computer Science
560, Part 2
, 2014, pp. 190-206
A refined exact algorithm for Edge Dominating Set
Mingyu Xiao
,
Hiroshi Nagamochi
Theoretical Computer Science
560, Part 2
, 2014, pp. 207-216