Adam Kirsch

	2010
15		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)
14		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)
13		Adam Kirsch, Michael Mitzenmacher: The Power of One Move: Hashing Schemes for Hardware. IEEE/ACM Trans. Netw. 18(6): 1752-1765 (2010)
	2009
12		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
11		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)
10		Adam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. SIAM J. Comput. 39(4): 1543-1561 (2009)
	2008
9		Adam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622
8		Adam Kirsch, Michael Mitzenmacher: The Power of One Move: Hashing Schemes for Hardware. INFOCOM 2008: 106-110
7		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		Adam Kirsch, Michael Mitzenmacher: Simple summaries for hashing with choices. IEEE/ACM Trans. Netw. 16(1): 218-231 (2008)
5		Adam Kirsch, Michael Mitzenmacher: Less hashing, same performance: Building a better Bloom filter. Random Struct. Algorithms 33(2): 187-218 (2008)
	2007
4		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		Adam Kirsch, Michael Mitzenmacher: Less Hashing, Same Performance: Building a Better Bloom Filter. ESA 2006: 456-467
	2005
2		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		Aris Anagnostopoulos, Adam Kirsch, Eli Upfal: Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS 2003: 472-481

Coauthor Index

1	Aris Anagnostopoulos	[1] [2]
2	Esteban Arcaute	[4]
3	Andrei Z. Broder	[7] [11]
4	Eleni Drinea	[14]
5	Ravi Kumar (S. Ravi Kumar)	[4] [7] [11]
6	David Liben-Nowell	[4]
7	Michael Mitzenmacher	[3] [5] [6] [7] [8] [9] [10] [11] [12] [13] [15]
8	Andrea Pietracaprina	[12] [15]
9	Geppino Pucci	[12] [15]
10	Eli Upfal	[1] [2] [7] [11] [12] [15]
11	Fabio Vandin	[12] [15]
12	Sergei Vassilvitskii	[4] [7] [11]
13	Udi Wieder	[9] [10]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page