Imagen de Portada

Theory Meets Practice for Bit Vectors Supporting Rank and Select

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kurpicz, Florian, Rigi-Luperti, Niccolò, Sanders, Peter
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scalable Distributed String Sorting
por: Kurpicz, Florian, et al.
Publicado: (2024)

Fast and Lightweight Distributed Suffix Array Construction -- First Results
por: Haag, Manuel, et al.
Publicado: (2024)

Practical Parallel Block Tree Construction: First Results
por: Clausecker, Robert, et al.
Publicado: (2025)

Partitioning Trillion Edge Graphs on Edge Devices
por: Chhabra, Adil, et al.
Publicado: (2024)

SPIDER: Improved Succinct Rank and Select Performance
por: Laws, Matthew D., et al.
Publicado: (2024)

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

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval
por: Becht, Matthias, et al.
Publicado: (2024)

Engineering Select Support for Hybrid Bitvectors
por: Chiu, Eric, et al.
Publicado: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
por: Kuszmaul, William, et al.
Publicado: (2025)

Engineering Rank/Select Data Structures for Large-Alphabet Strings
por: Arroyuelo, Diego, et al.
Publicado: (2023)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
por: Li, Yi, et al.
Publicado: (2022)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Engineering Optimal Parallel Task Scheduling
por: Akram, Matthew, et al.
Publicado: (2024)

Tera-Scale Multilevel Graph Partitioning
por: Salwasser, Daniel, et al.
Publicado: (2024)

Engineering Minimal k-Perfect Hash Functions
por: Hermann, Stefan, et al.
Publicado: (2025)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
por: Hermann, Stefan, et al.
Publicado: (2024)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
por: Blauth, Jannis, et al.
Publicado: (2022)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
por: Gottesbüren, Lars, et al.
Publicado: (2025)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
por: Funke, Daniel, et al.
Publicado: (2024)

QuadRank: Engineering a High Throughput Rank
por: Koerkamp, R. Groot
Publicado: (2026)

PHast -- Perfect Hashing made fast
por: Beling, Piotr, et al.
Publicado: (2025)

RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication
por: Dehghankar, Mohsen, et al.
Publicado: (2026)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
por: Kia, Solmaz S.
Publicado: (2025)

On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
por: Gao, Yiming, et al.
Publicado: (2025)

Distribution Testing Meets Sum Estimation
por: Pradhan, Pinki, et al.
Publicado: (2025)

Modern Minimal Perfect Hashing: A Survey
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Efficient Dynamic Rank Aggregation
por: Alimi, Morteza, et al.
Publicado: (2025)

Dynamic Rank, Basis, and Matching
por: Brand, Jan van den, et al.
Publicado: (2026)

Consistent Low-Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2026)

Transversal Rank, Conformality and Enumeration
por: Schirneck, Martin
Publicado: (2026)

Hitting Meets Packing: How Hard Can it Be?
por: Focke, Jacob, et al.
Publicado: (2024)

Fair Correlation Clustering Meets Graph Parameters
por: Blaha, Johannes, et al.
Publicado: (2026)

Quantization for Vector Search under Streaming Updates
por: Aden-Ali, Ishaq, et al.
Publicado: (2025)

On Beating $2^n$ for the Closest Vector Problem
por: Abboud, Amir, et al.
Publicado: (2025)

Hardness of Approximation for Shortest Path with Vector Costs
por: Carlson, Charlie, et al.
Publicado: (2025)

Instance-Optimality in PageRank Computation
por: Thorup, Mikkel, et al.
Publicado: (2025)

Improved Approximation for Ranking on General Graphs
por: Derakhshan, Mahsa, et al.
Publicado: (2025)

Catalytic Tree Evaluation From Matching Vectors
por: Henzinger, Alexandra, et al.
Publicado: (2026)

Sum Estimation via Vector Similarity Search
por: Mussmann, Stephen, et al.
Publicado: (2026)