Adam Kirsch

22 papers A* 5A 3B 1Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2016 J jnl
Mesa: a geo-replicated online data warehouse for Google's advertising system.
Commun. ACM
Ashish Gupta, Fan Yang, Jason Govig, Adam Kirsch, Kelvin Chan, Kevin Lai, Shuo Wu, Sandeep Govind Dhoot, Abhilash Rajesh Kumar, Ankur Agiwal, Sanjay Bhansali, Mingsheng Hong, Jamie Cameron, Masood Siddiqi, David Jones, Jeff Shute, Andrey Gubarev, Shivakumar Venkataraman, Divyakant Agrawal
2014 J jnl
Mesa: Geo-Replicated, Near Real-Time, Scalable Data Warehousing.
Proc. VLDB Endow.
Ashish Gupta, Fan Yang, Jason Govig, Adam Kirsch, Kelvin Chan, Kevin Lai, Shuo Wu, Sandeep Govind Dhoot, Abhilash Rajesh Kumar, Ankur Agiwal, Sanjay Bhansali, Mingsheng Hong, Jamie Cameron, Masood Siddiqi, David Jones, Jeff Shute, Andrey Gubarev, Shivakumar Venkataraman, Divyakant Agrawal
2012 J jnl
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.
J. ACM
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2010 J jnl
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
CoRR
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2010 J jnl
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications.
IEEE Trans. Inf. Theory
Adam Kirsch, Eleni Drinea
2010 — ch.
Hash-Based Techniques for High-Speed Packet Processing.
Algorithms for Next Generation Networks
Adam Kirsch, Michael Mitzenmacher, George Varghese
2010 J jnl
The Power of One Move: Hashing Schemes for Hardware.
IEEE/ACM Trans. Netw.
Adam Kirsch, Michael Mitzenmacher
2009 A* conf
An efficient rigorous approach for identifying statistically significant frequent itemsets.
PODS
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2009 J jnl
More Robust Hashing: Cuckoo Hashing with a Stash.
SIAM J. Comput.
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
2009 J jnl
The Hiring Problem and Lake Wobegon Strategies.
SIAM J. Comput.
Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii
2008 J jnl
Less hashing, same performance: Building a better Bloom filter.
Random Struct. Algorithms
Adam Kirsch, Michael Mitzenmacher
2008 A conf
More Robust Hashing: Cuckoo Hashing with a Stash.
ESA
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
2008 — conf
On the performance of multiple choice hash tables with moves on deletes and inserts.
Allerton
Adam Kirsch, Michael Mitzenmacher
2008 J jnl
Simple summaries for hashing with choices.
IEEE/ACM Trans. Netw.
Adam Kirsch, Michael Mitzenmacher
2008 A* conf
The Power of One Move: Hashing Schemes for Hardware.
INFOCOM
Adam Kirsch, Michael Mitzenmacher
2008 A* conf
The hiring problem and Lake Wobegon strategies.
SODA
Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii
2007 B conf
Directly Lower Bounding the Information Capacity for Channels with I.I.D. Deletions and Duplications.
ISIT
Eleni Drinea, Adam Kirsch
2007 A* conf
On threshold behavior in query incentive networks.
EC
Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii
2006 A conf
Distance-Sensitive Bloom Filters.
ALENEX
Adam Kirsch, Michael Mitzenmacher
2006 A conf
Less Hashing, Same Performance: Building a Better Bloom Filter.
ESA
Adam Kirsch, Michael Mitzenmacher
2005 J jnl
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input.
SIAM J. Comput.
Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
2003 A* conf
Stability and Efficiency of a Random Local Load Balancing Protocol.
FOCS
Aris Anagnostopoulos, Adam Kirsch, Eli Upfal