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="Harnik, Danny"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the power of the randomized iterate
Iftach Haitner
,
Danny Harnik
,
Omer Reingold
SIAM Journal on Computing
40
(6), 2011, pp. 1486-1528
On the compressibility of
\mathcal{NP}
instances and cryptographic applications
Danny Harnik
,
Moni Naor
SIAM Journal on Computing
39
(5), 2010, pp. 1667-1713
Efficient pseudorandom generators from exponentially hard one-way functions
Iftach Haitner
,
Danny Harnik
,
Omer Reingold
Lecture Notes in Computer Science
4052
, 2006, pp. 228-239
On everlasting security in the hybrid bounded storage model
Danny Harnik
,
Moni Naor
Lecture Notes in Computer Science
4052
, 2006, pp. 192-203
Completeness in two-party secure computation - A computational view
Danny Harnik
,
Moni Naor
,
Omer Reingold
,
Alon Rosen
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 252-261
Higher lower bounds on monotone size
Danny Harnik
,
Ran Raz
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 378-387