Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Adam Kirsch
2010 – today
- 2012
[j8]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM 59(3): 12 (2012)- 2010
- [j7]Adam Kirsch, Eleni Drinea: Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications. IEEE Transactions on Information Theory 56(1): 86-102 (2010)
- [j6]Adam Kirsch, Michael Mitzenmacher: The Power of One Move: Hashing Schemes for Hardware. IEEE/ACM Trans. Netw. 18(6): 1752-1765 (2010)
- [i1]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. CoRR abs/1002.1104 (2010)
2000 – 2009
- 2009
- [j5]Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. 39(4): 1233-1255 (2009)
- [j4]Adam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. SIAM J. Comput. 39(4): 1543-1561 (2009)
- [c8]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
- [j3]Adam Kirsch, Michael Mitzenmacher: Less hashing, same performance: Building a better Bloom filter. Random Struct. Algorithms 33(2): 187-218 (2008)
- [j2]Adam Kirsch, Michael Mitzenmacher: Simple summaries for hashing with choices. IEEE/ACM Trans. Netw. 16(1): 218-231 (2008)
- [c7]Adam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622
- [c6]Adam Kirsch, Michael Mitzenmacher: The Power of One Move: Hashing Schemes for Hardware. INFOCOM 2008: 106-110
- [c5]Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193
- 2007
- [c4]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
- [c3]
- [c2]Adam Kirsch, Michael Mitzenmacher: Less Hashing, Same Performance: Building a Better Bloom Filter. ESA 2006: 456-467
- 2005
- [j1]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
- [c1]Aris Anagnostopoulos, Adam Kirsch, Eli Upfal: Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS 2003: 472-481
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-15 21:57 CEST by the dblp team