Filters








9 Hits in 5.0 sec

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash [article]

Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
2012 arXiv   pre-print
It is shown that for cuckoo hashing with a stash as proposed by Kirsch, Mitzenmacher, and Wieder (2008) families of very simple hash functions can be used, maintaining the favorable performance guarantees  ...  Θ( n)-wise independence for standard cuckoo hashing) the new approach even works with 2-wise independent hash families as building blocks.  ...  Cuckoo hashing with a stash and weak hash functions.  ... 
arXiv:1204.4431v1 fatcat:gntkqiqtmjgedfiw57fkrr27ca

Guest Editorial: Selected Papers of European Symposium of Algorithms

Leah Epstein, Paolo Ferragina
2014 Algorithmica  
The forum seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications and aims at bringing together researchers in the computer science and operations  ...  The authors present a linear-time algorithm for the case where jobs are unit length and have a  ...  Another paper on data structures is "Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash", which shows that for cuckoo hashing with a stash, very simple families of hash functions  ... 
doi:10.1007/s00453-014-9916-2 fatcat:l6xugwrifbfafc7oxcpxdohd5y

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps [article]

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2011 arXiv   pre-print
This hashing scheme uses two cuckoo hash tables, one "nested" inside the other, with one serving as a primary structure and the other serving as an auxiliary supporting queue/stash structure that is super-sized  ...  We design hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with a small or negligible probability the data structure will  ...  Specifically, given a cuckoo hash table T , subdivided into two tables T 0 and T 1 , each with m cells, and hash functions h 0 and h 1 , the cuckoo graph for T is a bipartite multigraph (without self-loops  ... 
arXiv:1107.4378v1 fatcat:q6brf573trcvphjz66mzttv34m

More Robust Hashing: Cuckoo Hashing with a Stash

Adam Kirsch, Michael Mitzenmacher, Udi Wieder
2010 SIAM journal on computing (Print)  
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications.  ...  Our analysis naturally extends previous analyses of multiple cuckoo hashing variants, and the approach may prove useful in further related schemes.  ...  Acknowledgment The authors are grateful to Thomas Holenstein for useful discussions.  ... 
doi:10.1137/080728743 fatcat:vdpmva33n5fgzateb3fhib7574

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability [chapter]

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2012 Lecture Notes in Computer Science  
A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key.  ...  We design hashingbased indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with minimal space overhead and sub-polynomial probability that  ...  Acknowledgments We are grateful to Jon Ullman and Mikkel Thorup  ... 
doi:10.1007/978-3-642-34862-4_15 fatcat:mqcevhoxebhu5l3lvwsph4ifim

Tiny Pointers [article]

Michael A. Bender, Alex Conway, Martín Farach-Colton, William Kuszmaul, Guido Tagliavini
2021 arXiv   pre-print
with variable-size keys, and the internal-memory stash problem.  ...  These are all well-studied problems, and in each case tiny pointers allow for us to take a natural space-inefficient solution that uses pointers and make it space-efficient for free.  ...  GRFP fellowship and a Fannie and John Hertz Fellowship.  ... 
arXiv:2111.12800v1 fatcat:o27qntokxjbavdqri4x7fnimby

More Robust Hashing: Cuckoo Hashing with a Stash [chapter]

Adam Kirsch, Michael Mitzenmacher, Udi Wieder
Lecture Notes in Computer Science  
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications.  ...  Our analysis naturally extends previous analyses of multiple cuckoo hashing variants, and the approach may prove useful in further related schemes.  ...  Acknowledgment The authors are grateful to Thomas Holenstein for useful discussions.  ... 
doi:10.1007/978-3-540-87744-8_51 fatcat:4pefwjd3gvbj5pjw4fka3el2ja

Optimal Oblivious RAM and Its Extensions

Wei-Kai Lin
2021
For parallelization, we consider obliviousness in the classic Parallel RAM (PRAM) model: proposed by Boyle, Pass, and Chung (TCC'16-A), Oblivious PRAM (OPRAM) is the counterpart of ORAM in the PRAM model  ...  To further expand the landscape of ORAM and oblivious algorithm, we consider several directions: parallelization, perfect security, and RAM models with large cells.  ...  She kindly leads me through most of my research, provides key insights for technical problems, and spends a generous amount of time on each of our projects.  ... 
doi:10.7298/yxgm-jg66 fatcat:h7qugsaejfelxml5iyhkrrgcrm

тне жт OF TIUTOBIOGRTIPHY Articles Opinions and Notes A QUARTERLY OF CRITICISM AND R6VI€W

Earle Birnèy, George Woodcock, Roy Daniells, P Page, John Lauber, Paul Hjartarson, Janet G1ltrow, K Stich, Irving, Robert Kroetsch, E Brewster, A Purdy (+25 others)
unpublished
from my family and friends.  ...  Travel writing could no longer presume a recognized relation between writer and reader and, therefore, could not perform efficiently the social function of reaffiliating the absent writer with the addressed  ...  In general, there was Canada, the outdoor life, and the independent unlettered farmers and lumbermen on the Quebec frontier, his paternal concern for his own young family and his physician's concern for  ... 
fatcat:zgkdmeh5vnevhixwsrwmfryqpm