English

Sliding Block Hashing (Slick) -- Basic Algorithmic Ideas

Data Structures and Algorithms 2023-04-20 v1

Abstract

We present {\bf Sli}ding Blo{\bf ck} Hashing (Slick), a simple hash table data structure that combines high performance with very good space efficiency. This preliminary report outlines avenues for analysis and implementation that we intend to pursue.

Keywords

Cite

@article{arxiv.2304.09283,
  title  = {Sliding Block Hashing (Slick) -- Basic Algorithmic Ideas},
  author = {Hans-Peter Lehmann and Peter Sanders and Stefan Walzer},
  journal= {arXiv preprint arXiv:2304.09283},
  year   = {2023}
}
R2 v1 2026-06-28T10:10:19.466Z