Cover Image

Faster Linear-Space Data Structures for Path Frequency Queries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Rata, Ovidiu
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms E.1.7
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

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

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

Faster Linear-Size And-Or Path and Adder Circuits
by: Brenner, Ulrich, et al.
Published: (2024)

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

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

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

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

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

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

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
by: Brown, Nathaniel K., et al.
Published: (2026)

Single-Source Regular Path Querying in Terms of Linear Algebra
by: Belyanin, Georgiy, et al.
Published: (2024)

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

Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
Published: (2026)

Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
by: Beretta, Lorenzo, et al.
Published: (2025)

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

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
by: Jo, Seungbum, et al.
Published: (2022)

Faster Algorithms for Dual-Failure Replacement Paths
by: Chechik, Shiri, et al.
Published: (2024)

Faster Approximate Linear Matroid Intersection
by: Terao, Tatsuya
Published: (2026)

Faster and Simpler Online Computation of String Net Frequency
by: Inenaga, Shunsuke
Published: (2024)

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

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

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
by: Ashvinkumar, Vikrant, et al.
Published: (2024)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
by: Liu, Yuxi, et al.
Published: (2024)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
by: Boneh, Itai, et al.
Published: (2025)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
by: Li, Jason, et al.
Published: (2025)

Faster Relational Algorithms Using Geometric Data Structures
by: Esmailpour, Aryan, et al.
Published: (2026)

How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
by: von Geijer, Kåre, et al.
Published: (2024)

Efficient Trace Frequency Queries in Sparse Graphs
by: Awofeso, Christine, et al.
Published: (2025)

Faster Space-Efficient STR-IC-LCS Computation
by: Yonemoto, Yuki, et al.
Published: (2022)

Towards Efficient Data Structures for Approximate Search with Range Queries
by: Kian, Ladan, et al.
Published: (2026)

Faster Algorithm for Structured John Ellipsoid Computation
by: Cao, Yang, et al.
Published: (2022)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
by: Inoue, Yuta, et al.
Published: (2026)

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

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

The Merkle Mountain Belt
by: Cevallos, Alfonso, et al.
Published: (2025)

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