default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Kirsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j10]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:
Mesa: a geo-replicated online data warehouse for Google's advertising system. Commun. ACM 59(7): 117-125 (2016)- 2014
- [j9]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:
Mesa: Geo-Replicated, Near Real-Time, Scalable Data Warehousing. Proc. VLDB Endow. 7(12): 1259-1270 (2014) - 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:1-12:22 (2012) - 2010
- [j7]Adam Kirsch, Eleni Drinea:
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications. IEEE Trans. Inf. 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) - 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) - 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) - 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)
Conference and Workshop Papers
- 2009
- [c10]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
- [c9]Adam Kirsch, Michael Mitzenmacher:
On the performance of multiple choice hash tables with moves on deletes and inserts. Allerton 2008: 1284-1290 - [c8]Adam Kirsch, Michael Mitzenmacher, Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622 - [c7]Adam Kirsch, Michael Mitzenmacher:
The Power of One Move: Hashing Schemes for Hardware. INFOCOM 2008: 106-110 - [c6]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
- [c5]Eleni Drinea, Adam Kirsch:
Directly Lower Bounding the Information Capacity for Channels with I.I.D. Deletions and Duplications. ISIT 2007: 1731-1735 - [c4]Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii:
On threshold behavior in query incentive networks. EC 2007: 66-74 - 2006
- [c3]Adam Kirsch, Michael Mitzenmacher:
Distance-Sensitive Bloom Filters. ALENEX 2006: 41-50 - [c2]Adam Kirsch, Michael Mitzenmacher:
Less Hashing, Same Performance: Building a Better Bloom Filter. ESA 2006: 456-467 - 2003
- [c1]Aris Anagnostopoulos, Adam Kirsch, Eli Upfal:
Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS 2003: 472-481
Parts in Books or Collections
- 2010
- [p1]Adam Kirsch, Michael Mitzenmacher, George Varghese:
Hash-Based Techniques for High-Speed Packet Processing. Algorithms for Next Generation Networks 2010: 181-218
Informal and Other Publications
- 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
