This paper proposes an image encryption algorithm based on hash table structure scrambling and DNA substitution. The algorithm uses the classical `scrambling-diffusion' process, and the pseudo-random ...

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

The 2025 paper claims that even without reordering elements over time, it is possible to construct a hash table using Krapivin's method that achieves far better probe complexity – the average number ...

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

For example, a new hash table called IcebergHT, built by Bender, Kuszmaul and others, is far better than its predecessors. According to Kuszmaul, it’s twice as fast as the most space-efficient hash ...

CL-CUSTOM-HASH-TABLE allows creation and use of "custom hash tables". Custom hash tables can use arbitrary TEST/HASH functions, in addition to the TEST functions allowed by the standard (EQ, EQL, ...

[BUG] "ValueError: The capacity of hashtable is not sufficient." in examples/backbone.py with version 2.1.0 #214 ...

To get around these obstacles, we show how to construct a randomized data structure that has the same guarantees as a hash table, but that avoids the direct use of hash functions. Building on this, we ...