| * | 2009 |
|---|
| 10 | EE | Adam Kirsch,
Michael Mitzenmacher,
Andrea Pietracaprina,
Geppino Pucci,
Eli Upfal,
Fabio Vandin:
An efficient rigorous approach for identifying statistically significant frequent itemsets.
PODS 2009: 117-126 |
| 2008 |
|---|
| 9 | EE | Adam Kirsch,
Michael Mitzenmacher,
Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash.
ESA 2008: 611-622 |
| 8 | EE | Adam Kirsch,
Michael Mitzenmacher:
The Power of One Move: Hashing Schemes for Hardware.
INFOCOM 2008: 106-110 |
| 7 | EE | Andrei Z. Broder,
Adam Kirsch,
Ravi Kumar,
Michael Mitzenmacher,
Eli Upfal,
Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies.
SODA 2008: 1184-1193 |
| 6 | EE | Adam Kirsch,
Michael Mitzenmacher:
Simple summaries for hashing with choices.
IEEE/ACM Trans. Netw. 16(1): 218-231 (2008) |
| 5 | EE | Adam Kirsch,
Michael Mitzenmacher:
Less hashing, same performance: Building a better Bloom filter.
Random Struct. Algorithms 33(2): 187-218 (2008) |
| 2007 |
|---|
| 4 | EE | Esteban Arcaute,
Adam Kirsch,
Ravi Kumar,
David Liben-Nowell,
Sergei Vassilvitskii:
On threshold behavior in query incentive networks.
ACM Conference on Electronic Commerce 2007: 66-74 |
| 2006 |
|---|
| 3 | EE | Adam Kirsch,
Michael Mitzenmacher:
Less Hashing, Same Performance: Building a Better Bloom Filter.
ESA 2006: 456-467 |
| 2005 |
|---|
| 2 | EE | Aris Anagnostopoulos,
Adam Kirsch,
Eli Upfal:
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input.
SIAM J. Comput. 34(3): 616-639 (2005) |
| 2003 |
|---|
| 1 | EE | Aris Anagnostopoulos,
Adam Kirsch,
Eli Upfal:
Stability and Efficiency of a Random Local Load Balancing Protocol.
FOCS 2003: 472-481 |
