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: Author="Burmester, Mike"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal movement of mobile sensors for barrier coverage of a planar region
Binay Bhattacharya
,
Mike Burmester
,
Yuzhuang Hu
,
Evangelos Kranakis
,
Qiaosheng Shi
,
Andreas Wiese
Theoretical Computer Science
410
(52), 2009, pp. 5515-5528
A secure and scalable Group Key Exchange system
Mike Burmester
,
Yvo Desmedt
Information Processing Letters
94
(3), 2005, pp. 137-143
A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback
Yvo Desmedt
,
Yongge Wang
,
Mike Burmester
Lecture Notes in Computer Science
3827
, 2005, pp. 277-287
Computing functions of a shared secret
Amos Beimel
,
Mike Burmester
,
Yvo Desmedt
,
Eyal Kushilevitz
SIAM Journal on Discrete Mathematics
13
(3), 2000, pp. 324-345
Using approximation hardness to achieve dependable computation
Mike Burmester
,
Yvo Desmedt
,
Yongge Wang
Lecture Notes in Computer Science
1518
, 1998, pp. 172-186
On the risk of opening distributed keys
Mike Burmester
Lecture Notes in Computer Science
839
, 1994, pp. 308-317
An almost-constant round interactive zero-knowledge proof
Mike Burmester
Information Processing Letters
42
, 1992, pp. 81-87