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=569
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
n
-player impartial combinatorial games with random players
Walter O. Krawec
Theoretical Computer Science
569
, 2015, pp. 1-12
Message and time efficient multi-broadcast schemes
Liron Levin
,
Dariusz R. Kowalski
,
Michael Segal
Theoretical Computer Science
569
, 2015, pp. 13-23
Searching on a line: A complete characterization of the optimal solution
Prosenjit Bose
,
Jean-Lou De Carufel
,
Stephane Durocher
Theoretical Computer Science
569
, 2015, pp. 24-42
The complexity of fully proportional representation for single-crossing electorates
Piotr Skowron
,
Lan Yu
,
Piotr Faliszewski
,
Edith Elkind
Theoretical Computer Science
569
, 2015, pp. 43-57
Pseudorandom generators from regular one-way functions: New constructions with improved parameters
Yu Yu
,
Xiangxue Li
,
Jian Weng
Theoretical Computer Science
569
, 2015, pp. 58-69
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
Nhat X. Lam
,
Tien Tran
,
Min Kyung An
,
Dung T. Huynh
Theoretical Computer Science
569
, 2015, pp. 70-73