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
[1]
Hilfe
Suche: Author="Schoenmakers, Berry"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sharp lower bounds on the extractable randomness from non-uniform sources
Boris S̑korić
,
Chibuzo Obi
,
Evgeny Verbitskiy
,
Berry Schoenmakers
Information and Computation
209
(8), 2011, pp. 1184-1196
A fair and efficient solution to the socialist millionaires' problem
Fabrice Boudot
,
Berry Schoenmakers
,
Jacques Traoré
Discrete Applied Mathematics
111
(1-2), 2001, pp. 23-36
A tight lower bound for top-down skew heaps
Berry Schoenmakers
Information Processing Letters
61
(5), 1997, pp. 279-284
Proofs of partial knowledge and simplified design of witness hiding protocols
Ronald Cramer
,
Ivan Damgård
,
Berry Schoenmakers
Lecture Notes in Computer Science
839
, 1994, pp. 174-187
A systematic analysis of splaying
Berry Schoenmakers
Information Processing Letters
45
(1), 1993, pp. 41-50
Data structures and amortized complexity in a functional setting
Berry Schoenmakers
dissertation, 1992, September
The derivation of a tighter bound for top-down skew heaps
Anne Kaldewaj
,
Berry Schoenmakers
Information Processing Letters
37
, 1991, pp. 265-271