default search action
Michael Mitzenmacher
- > Home > Persons > Michael Mitzenmacher
Publications
- 2017
- [c138]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
Auditable Data Structures. EuroS&P 2017: 285-300 - [c136]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres:
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS 2017: 247-260 - 2016
- [c131]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
More Practical and Secure History-Independent Hash Tables. ESORICS (2) 2016: 20-38 - [c129]David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres:
Models and Algorithms for Graph Watermarking. ISC 2016: 283-301 - [e4]Michael T. Goodrich, Michael Mitzenmacher:
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016. SIAM 2016, ISBN 978-1-61197-431-7 [contents] - [i51]David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres:
Models and Algorithms for Graph Watermarking. CoRR abs/1605.09425 (2016) - [i47]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
More Practical and Secure History-Independent Hash Tables. IACR Cryptol. ePrint Arch. 2016: 134 (2016) - [i46]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
Auditable Data Structures. IACR Cryptol. ePrint Arch. 2016: 755 (2016) - 2014
- [c117]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. SEA 2014: 162-173 - [i39]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. CoRR abs/1404.0286 (2014) - 2013
- [j72]Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. Algorithmica 67(1): 23-48 (2013) - 2012
- [c112]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Practical oblivious storage. CODASPY 2012: 13-24 - [c110]Michael T. Goodrich, Michael Mitzenmacher:
Anonymous Card Shuffling and Its Applications to Parallel Mixnets. ICALP (2) 2012: 549-560 - [c106]Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler:
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg 2012: 203-218 - [c104]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Privacy-preserving group data access via stateless oblivious RAM simulation. SODA 2012: 157-167 - [i27]Michael T. Goodrich, Michael Mitzenmacher:
Anonymous Card Shuffling and its Applications to Parallel Mixnets. CoRR abs/1205.1579 (2012) - 2011
- [c99]Michael T. Goodrich, Michael Mitzenmacher:
Invertible bloom lookup tables. Allerton 2011: 792-799 - [c97]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious RAM simulation with efficient worst-case access overhead. CCSW 2011: 95-100 - [c95]Michael T. Goodrich, Michael Mitzenmacher:
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. ICALP (2) 2011: 576-587 - [c94]Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. ISAAC 2011: 384-394 - [c92]Michael T. Goodrich, Michael Mitzenmacher:
Brief announcement: large-scale multimaps. SPAA 2011: 259-260 - [i23]Michael T. Goodrich, Michael Mitzenmacher:
Invertible Bloom Lookup Tables. CoRR abs/1101.2245 (2011) - [i18]Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. CoRR abs/1104.5533 (2011) - [i15]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. CoRR abs/1105.4125 (2011) - [i14]Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler:
Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps. CoRR abs/1107.4378 (2011) - [i13]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. CoRR abs/1107.5093 (2011) - [i11]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious Storage with Low I/O Overhead. CoRR abs/1110.1851 (2011) - 2010
- [i6]Michael T. Goodrich, Michael Mitzenmacher:
MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations. CoRR abs/1007.1259 (2010)
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-09-13 01:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint