Cover Image

LatticeHashForest: An Efficient Data Structure for Repetitive Data and Operations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghorui, Anamitra, Khedker, Uday P.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Information Theory Operating Systems Programming Languages E.1; F.3.2; H.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Points-to Analysis Using MDE: A Multi-level Deduplication Engine for Repetitive Data and Operations
by: Ghorui, Anamitra, et al.
Published: (2026)

Bounded Local Generator Classes for Deterministic State Evolution
by: Martin II, R. Jay
Published: (2026)

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

Accelerating Probabilistic Response-Time Analysis: Revised Critical Instant and Optimized Convolution
by: Takahashi, Hiroto, et al.
Published: (2025)

Generalized compression and compressive search of large datasets
by: Prior, Morgan E., et al.
Published: (2024)

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements
by: Gomes, Pedro Silva, et al.
Published: (2025)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
by: Wu, Wei, et al.
Published: (2022)

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

Sublime: Sublinear Error & Space for Unbounded Skewed Streams
by: Eslami, Navid, et al.
Published: (2026)

Representation of Classical Data on Quantum Computers
by: Lang, Thomas, et al.
Published: (2024)

ConflictSync: Bandwidth Efficient Synchronization of Divergent State
by: Gomes, Pedro Silva, et al.
Published: (2025)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
by: Masson, Charles, et al.
Published: (2024)

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

Clustering Permutations: New Techniques with Streaming Applications
by: Chakraborty, Diptarka, et al.
Published: (2022)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
by: Hušek, Radek, et al.
Published: (2020)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
by: Boneh, Itai, et al.
Published: (2025)

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric
by: Chakraborty, Arya
Published: (2024)

Arcee: An OCM-Solver
by: Boehmer, Kimon, et al.
Published: (2024)

Planar Multiway Cut with Terminals on Few Faces
by: Pandey, Sukanya, et al.
Published: (2025)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
by: Degryse, Mathis, et al.
Published: (2026)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
by: De Stefani, Lorenzo, et al.
Published: (2024)

Faster Multi-Source Directed Reachability via Shortcuts and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2024)

PtrHash: Minimal Perfect Hashing at RAM Throughput
by: Koerkamp, Ragnar Groot
Published: (2025)

Finding the Center and Centroid of a Graph with Multiple Sources
by: Chou, Matthew
Published: (2024)

Towards Efficient Hash Maps in Functional Array Languages
by: Due, William Henrich, et al.
Published: (2025)

Max-Cut with $ε$-Accurate Predictions
by: Cohen-Addad, Vincent, et al.
Published: (2024)

PAC Learning is just Bipartite Matching (Sort of)
by: Dughmi, Shaddin
Published: (2025)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
by: Hochbaum, Dorit S.
Published: (2016)

String 2-Covers with No Length Restrictions
by: Boneh, Itai, et al.
Published: (2024)

Hairpin Completion Distance Lower Bound
by: Boneh, Itai, et al.
Published: (2024)

Maximizing Diversity in (near-)Median String Selection
by: Chakraborty, Diptarka, et al.
Published: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
by: Crochemore, Maxime, et al.
Published: (2025)

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

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

Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
by: Peterseim, Benedikt, et al.
Published: (2026)

Online Paging with Heterogeneous Cache Slots
by: Chrobak, Marek, et al.
Published: (2022)

Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
by: Prior, Morgan E., et al.
Published: (2023)

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

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

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)