:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Vanderkam, Dan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms I.2.8, E.1
Online Access:	https://arxiv.org/abs/2507.02117
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Updating Lower and Upper Bounds for the Job-Shop Scheduling Problem Test Instances
by: Graviers, Marc-Emmanuel Coupvent des, et al.
Published: (2025)

Dual-Step Optimization for Binary Sequences with High Merit Factors
by: Pšeničnik, Blaž, et al.
Published: (2024)

Evolving A* to Efficiently Solve the k Shortest-Path Problem (Extended Version)
by: López, Carlos Linares, et al.
Published: (2024)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
by: Gila, Ofek, et al.
Published: (2025)

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

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
by: Shigemizu, Mika, et al.
Published: (2018)

A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management
by: Ganesan, Ashwin
Published: (2026)

Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
by: van der Linden, Jacobus G. M., et al.
Published: (2023)

Parallel Self-Avoiding Walks for a Low-Autocorrelation Binary Sequences Problem
by: Bošković, Borko, et al.
Published: (2022)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)

Discovering Algorithms with Computational Language Processing
by: Bourdais, Theo, et al.
Published: (2025)

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

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

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection
by: Coppé, Vianney, et al.
Published: (2022)

Optimal Secure Coded Distributed Computation over all Fields
by: Soto, Pedro
Published: (2025)

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

The Energy-Throughput Trade-off in Lossless-Compressed Source Code Storage
by: Ferragina, Paolo, et al.
Published: (2026)

On the Complexity of Neural Computation in Superposition
by: Adler, Micah, et al.
Published: (2024)

Fast Quantum Amplitude Encoding of Typical Classical Data
by: Pagni, Vittorio, et al.
Published: (2025)

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

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

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

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

Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
by: Marot-Lassauzaie, Marc, et al.
Published: (2025)

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

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

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

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

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

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)

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

FDQN: A Flexible Deep Q-Network Framework for Game Automation
by: Gujavarthy, Prabhath Reddy
Published: (2024)

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

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

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

A framework for understanding data science
by: Brodie, Michael L
Published: (2024)

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

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

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