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="Segev, Gil"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nonmalleable extractors with short seeds and applications to privacy amplification
Gil Cohen
,
Ran Raz
,
Gil Segev
SIAM Journal on Computing
43
(2), 2014, pp. 450-476
Balls and bins: Smaller hash families and faster evaluation
L. Elisa Celis
,
Omer Reingold
,
Gil Segev
,
Udi Wieder
SIAM Journal on Computing
42
(3), 2013, pp. 1030-1050
Public-key cryptosystems resilient to key leakage
Moni Naor
,
Gil Segev
SIAM Journal on Computing
41
(4), 2012, pp. 772-814
Sketching in adversarial environments
Ilya Mironov
,
Moni Naor
,
Gil Segev
SIAM Journal on Computing
40
(6), 2011, pp. 1845-1870
Chosen-ciphertext security via correlated products
Alon Rosen
,
Gil Segev
SIAM Journal on Computing
39
(7), 2010, pp. 3058-3088
Approximate
k
-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev
,
Gil Segev
Algorithmica
56
(4), 2010, pp. 529-549
De-amortized cuckoo hashing: Provable worst-case performance and experimental results
Yuriy Arbitman
,
Moni Naor
,
Gil Segev
Lecture Notes in Computer Science
5555
, 2009, pp. 107-118
Sketching in adversarial environments
Ilya Mironov
,
Moni Naor
,
Gil Segev
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 651-660
History-independent cuckoo hashing
Moni Naor
,
Gil Segev
,
Udi Wieder
Lecture Notes in Computer Science
5126
, 2008, pp. 631-642
Deterministic history-independent strategies for storing information on write-once memories
Tal Moran
,
Moni Naor
,
Gil Segev
Lecture Notes in Computer Science
4596
, 2007, pp. 303-315
Approximate
k
-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev
,
Gil Segev
Lecture Notes in Computer Science
4168
, 2006, pp. 600-611