Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
- 5 December 2022
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 85 (6) , 1786-1804
Abstract
No abstract availableKeywords
Funding Information
- United States - Israel Binational Science Foundation
This publication has 27 references indexed in Scilit:
- Derandomized Constructions of k-Wise (Almost) Independent PermutationsAlgorithmica, 2008
- Compact dictionaries for variable-length keys and data with applicationsACM Transactions on Algorithms, 2008
- A new universal class of hash functions and dynamic hashing in real time2005
- Two-Way Chaining with ReassignmentSIAM Journal on Computing, 2005
- On Universal Classes of Extremely Random Constant-Time Hash FunctionsSIAM Journal on Computing, 2004
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000
- Balls and bins: A study in negative dependenceRandom Structures & Algorithms, 1998
- Chernoff–Hoeffding Bounds for Applications with Limited IndependenceSIAM Journal on Discrete Mathematics, 1995
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Efficient Storage and Retrieval by Content and Address of Static FilesJournal of the ACM, 1974