Gil Segev

1. Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
   2009/12/30 by Yuriy Arbitman, Moni Naor, Arbitman, Yuriy +3 · 5 citations
   Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithms and Data Compression #Amortized analysis #Binary logarithm #Combinatorics #Computer science #Constant (computer programming) #Cryptographic Implementations and Security #DNA and Biological Computing #Data structure #Discrete mathematics #Double hashing #Dynamic perfect hashing #Hash function #Hash table #K-independent hashing #Linear hashing #Mathematics #Perfect hash function #Randomness #Statistics #Theoretical computer science #Universal hashing #Upper and lower bounds #cs.DS
2. De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
   2009/03/02 by Yuriy Arbitman, Arbitman, Yuriy, Moni Naor +3 · 1 citation
   Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
3. How to Approximate A Set Without Knowing Its Size In Advance
   2013/04/03 by Rasmus Pagh, Gil Segev, Pagh, Rasmus +3 · 1 citation
   Computer Science · #Algorithms and Data Compression #Caching and Content Delivery #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS