Sliding Block Hashing (Slick) – Basic Algorithmic Ideas

04/18/2023

∙

We present Sliding Block 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.

READ FULL TEXT

Sliding Block Hashing (Slick) – Basic Algorithmic Ideas

Note on distance matrix hashing

Arithmetic Progression Hypergraphs: Examining the Second Moment Method

Hyperdimensional Hashing: A Robust and Efficient Dynamic Hash Table

H-CNN: Spatial Hashing Based CNN for 3D Shape Analysis

The distributions of sliding block patterns in finite samples and the inclusion-exclusion principles for partially ordered sets

VIP Hashing – Adapting to Skew in Popularity of Data on the Fly (extended version)

A Lyra2 FPGA Implementation for Lyra2REv2-Based Cryptocurrencies

Sliding Block Hashing (Slick) – Basic Algorithmic Ideas

Related Research

Note on distance matrix hashing

Arithmetic Progression Hypergraphs: Examining the Second Moment Method

Hyperdimensional Hashing: A Robust and Efficient Dynamic Hash Table

H-CNN: Spatial Hashing Based CNN for 3D Shape Analysis

The distributions of sliding block patterns in finite samples and the inclusion-exclusion principles for partially ordered sets

VIP Hashing – Adapting to Skew in Popularity of Data on the Fly (extended version)

A Lyra2 FPGA Implementation for Lyra2REv2-Based Cryptocurrencies