Imagen de Portada

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Masson, Charles, Lee, Homin K.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms E.2; E.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sampling Space-Saving Set Sketches
por: Lee, Homin K., et al.
Publicado: (2024)

MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
por: Hermann, Stefan
Publicado: (2025)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
por: Brodal, Gerth Stølting
Publicado: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
por: Agarwala, Aryan, et al.
Publicado: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
por: Bushnell, Brian
Publicado: (2026)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
por: Coluzzi, Massimo, et al.
Publicado: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
por: Garg, Ishant
Publicado: (2026)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
por: Bell, Tolson, et al.
Publicado: (2024)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
por: Krawczyk, Tomasz
Publicado: (2024)

New Entropy Measures for Tries with Applications to the XBWT
por: Carfagna, Lorenzo, et al.
Publicado: (2025)

LatticeHashForest: An Efficient Data Structure for Repetitive Data and Operations
por: Ghorui, Anamitra, et al.
Publicado: (2025)

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
por: Lecroq, Thierry
Publicado: (2024)

Optimal Preprocessing for Answering On-Line Product Queries
por: Alon, Noga, et al.
Publicado: (2024)

Highway Preferential Attachment Models for Geographic Routing
por: Gila, Ofek, et al.
Publicado: (2024)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
por: Gila, Ofek, et al.
Publicado: (2023)

Cache-Oblivious Representation of B-Tree Structures
por: Ondráček, Lukáš, et al.
Publicado: (2022)

Fast Geographic Routing in Fixed-Growth Graphs
por: Gila, Ofek, et al.
Publicado: (2025)

A (Weakly) Polynomial Algorithm for AIVF Coding
por: Dolatabadi, Reza Hosseini, et al.
Publicado: (2024)

A Computational Proof of the Highest-Scoring Boggle Board
por: Vanderkam, Dan
Publicado: (2025)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
por: Berger, Benjamin
Publicado: (2025)

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
por: Krawczyk, Tomasz
Publicado: (2024)

Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data
por: Laso, Ruben, et al.
Publicado: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
por: Koerkamp, Ragnar Groot
Publicado: (2025)

Faster Linear-Space Data Structures for Path Frequency Queries
por: Rata, Ovidiu
Publicado: (2026)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
por: Liu, Junfeng, et al.
Publicado: (2025)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
por: Dolatabadi, Reza Hosseini, et al.
Publicado: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
por: Gouvine, Gabriel
Publicado: (2023)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
por: Sitters, René
Publicado: (2025)

Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
por: Brault, Gregory J., et al.
Publicado: (2024)

Adaptive Hashing: Faster Hash Functions with Fewer Collisions
por: Melis, Gábor
Publicado: (2026)

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
por: Koch, Stefan, et al.
Publicado: (2025)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
por: Mukhopadhyay, Asish, et al.
Publicado: (2024)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
por: Gæde, Emil Toftegaard, et al.
Publicado: (2025)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
por: Pourdamghani, Arash, et al.
Publicado: (2024)

The Merkle Mountain Belt
por: Cevallos, Alfonso, et al.
Publicado: (2025)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
por: Lehmann, Hans-Peter, et al.
Publicado: (2023)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
por: Baruchel, Thomas
Publicado: (2025)

The Bathroom Model: A Realistic Approach to Hash Table Algorithm Optimization
por: Wang, Qiantong
Publicado: (2025)

Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024)

Efficient Streaming Algorithms for Two-Dimensional Congruence Testing and Geometric Hashing
por: Chang, Yen-Cheng, et al.
Publicado: (2026)