The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988. ,
URL : https://hal.archives-ouvertes.fr/inria-00075827
Static dictionaries on AC 0 RAMs: query time ?( log n/ log log n) is necessary and sufficient, Proceedings of 37th Conference on Foundations of Computer Science, pp.441-450, 1996. ,
Remote algorithmic complexity attacks against randomized hash tables, SECRYPT is part of ICETEThe International Joint Conference on e-Business and Telecommunications, pp.117-124, 2007. ,
Trans-dichotomous algorithms without multiplication-some upper and lower bounds, Algorithms and Data Structures, 5th International Workshop, WADS '97, pp.426-439, 1997. ,
Single access hashing with overflow separators for dynamic files, BIT Numerical Mathematics, vol.33, issue.1, pp.15-28, 1993. ,
Optimal hashing in external memory, Proc. Automata, Languages and Programming, 45th International Colloquium (ICALP18), 2018. ,
Denial of service via algorithmic complexity attacks, USENIX Security Symposium. USENIX Association, 2003. ,
Dynamo: amazon's highly available key-value store, Proceedings of the 21st ACM Symposium on Operating Systems Principles, pp.205-220, 2007. ,
Extendible hashing-a fast access method for dynamic files, ACM Trans. Database Syst, vol.4, issue.3, pp.315-344, 1979. ,
Division by invariant integers using multiplication, ACM Sigplan Notices, vol.29, pp.61-72, 1994. ,
Intel 64 and IA-32 Architectures Optimization Reference Manual. Intel, order 248966-040, 2018. ,
Optimality in external memory hashing, Algorithmica, vol.52, issue.3, pp.403-411, 2008. ,
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web, Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC '97, pp.654-663, 1997. ,
A fast, minimal memory, consistent hash algorithm. CoRR, abs/1406, vol.2294, 2014. ,
Linear hashing with partial expansions, VLDB, vol.6, pp.224-232, 1980. ,
Linear hashing: a new tool for file and table addressing, VLDB, vol.80, pp.1-3, 1980. ,
The program complexity of searching a table, Foundations of Computer Science, pp.40-47, 1983. ,
Lower bounds for static dictionaries on RAMs with bit operations but no multiplication, Automata, Languages and Programming, 23rd International Colloquium, vol.96, pp.442-453, 1996. ,
, Consistent hashing with bounded loads. CoRR, 2016.
Basic external memory data structures. Algorithms for Memory Hierarchies, pp.14-35, 2003. ,
EMOMA: exact match in one memory access, 2017. ,
Dynamic external hashing with guaranteed single access retrieval, pp.187-201, 1989. ,
Chord: a scalable peer-to-peer lookup protocol for Internet applications, IEEE/ACM Transactions on Networking, vol.11, issue.1, pp.17-32, 2003. ,
Using name-based mappings to increase hit rates, IEEE/ACM Trans. Netw, vol.6, issue.1, pp.1-14, 1998. ,
xoroshiro128+: an extremely fast and well-distributed pseudo random number generator, 2018. ,
Hash-based virtual hierarchies for scalable location service in mobile ad-hoc networks, Mobile Networks and Applications, vol.14, issue.5, pp.625-637, 2009. ,