| * | 2009 |
|---|
| 9 | EE | Maxim Gurevich,
Idit Keidar:
Correctness of gossip-based membership under message loss.
PODC 2009: 151-160 |
| 8 | EE | Ziv Bar-Yossef,
Maxim Gurevich:
Estimating the impressionrank of web pages.
WWW 2009: 41-50 |
| 7 | EE | Edward Bortnikov,
Maxim Gurevich,
Idit Keidar,
Gabriel Kliot,
Alexander Shraer:
Brahms: Byzantine resilient random membership sampling.
Computer Networks 53(13): 2340-2359 (2009) |
| 2008 |
|---|
| 6 | EE | Edward Bortnikov,
Maxim Gurevich,
Idit Keidar,
Gabriel Kliot,
Alexander Shraer:
Brahms: byzantine resilient random membership sampling.
PODC 2008: 145-154 |
| 5 | EE | Ziv Bar-Yossef,
Maxim Gurevich:
Random sampling from a search engine's index.
J. ACM 55(5): (2008) |
| 4 | EE | Ziv Bar-Yossef,
Maxim Gurevich:
Mining search engine query logs via suggestion sampling.
PVLDB 1(1): 54-65 (2008) |
| 2007 |
|---|
| 3 | EE | Ziv Bar-Yossef,
Maxim Gurevich:
Efficient search engine measurements.
WWW 2007: 401-410 |
| 2006 |
|---|
| 2 | EE | Ziv Bar-Yossef,
Maxim Gurevich:
Random sampling from a search engine's index.
WWW 2006: 367-376 |
| 2003 |
|---|
| 1 | EE | Gadi Haber,
Moshe Klausner,
Vadim Eisenberg,
Bilha Mendelson,
Maxim Gurevich:
Optimization Opportunities Created by Global Data Reordering.
CGO 2003: 228-240 |
