Adam Kirsch

According to our database, Adam Kirsch authored at least 16 papers between 2003 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Mesa: a geo-replicated online data warehouse for Google's advertising system.

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

Commun. ACM, 2016

2014

Mesa: Geo-Replicated, Near Real-Time, Scalable Data Warehousing.

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

Proc. VLDB Endow., 2014

2012

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.

Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin

J. ACM, 2012

2010

Hash-Based Techniques for High-Speed Packet Processing.

Adam Kirsch, Michael Mitzenmacher, George Varghese

Proceedings of the Algorithms for Next Generation Networks, 2010

The Power of One Move: Hashing Schemes for Hardware.

Adam Kirsch, Michael Mitzenmacher

IEEE/ACM Trans. Netw., 2010

Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications.

Adam Kirsch, Eleni Drinea

IEEE Trans. Inf. Theory, 2010

2009

More Robust Hashing: Cuckoo Hashing with a Stash.

Adam Kirsch, Michael Mitzenmacher, Udi Wieder

SIAM J. Comput., 2009

The Hiring Problem and Lake Wobegon Strategies.

Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii

SIAM J. Comput., 2009

2008

Simple summaries for hashing with choices.

Adam Kirsch, Michael Mitzenmacher

IEEE/ACM Trans. Netw., 2008

Less hashing, same performance: Building a better Bloom filter.

Adam Kirsch, Michael Mitzenmacher

Random Struct. Algorithms, 2008

On the performance of multiple choice hash tables with moves on deletes and inserts.

Adam Kirsch, Michael Mitzenmacher

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

On threshold behavior in query incentive networks.

Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Directly Lower Bounding the Information Capacity for Channels with I.I.D. Deletions and Duplications.

Eleni Drinea, Adam Kirsch

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Distance-Sensitive Bloom Filters.

Adam Kirsch, Michael Mitzenmacher

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input.

Aris Anagnostopoulos, Adam Kirsch, Eli Upfal

SIAM J. Comput., 2005

2003

Stability and Efficiency of a Random Local Load Balancing Protocol.

Aris Anagnostopoulos, Adam Kirsch, Eli Upfal

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003