Imagen de Portada

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Garg, Ishant
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms F.2.2; E.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

Streaming Algorithms for Bin Packing and Vector Scheduling
por: Cormode, Graham, et al.
Publicado: (2019)

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

Beating Meet-in-the-Middle for Subset Balancing Problems
por: Randolph, Tim, et al.
Publicado: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
por: Randolph, Tim, et al.
Publicado: (2024)

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

Connected Components in Linear Work and Near-Optimal Time
por: Farhadi, Alireza, et al.
Publicado: (2023)

On the Approximability of Unsplittable Flow on a Path with Time Windows
por: Armbruster, Alexander, et al.
Publicado: (2025)

static_maps: consteval std::map and std::unordered_map Implementations in C++23
por: Myhal, Isaac D., et al.
Publicado: (2026)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
por: Dreier, Jan, et al.
Publicado: (2026)

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

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
por: Gillman, David, et al.
Publicado: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
por: Bläsius, Thomas, et al.
Publicado: (2024)

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

Offline green bin packing and its constrained variant
por: Gong, Mingyang, et al.
Publicado: (2026)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
por: Blomer, Valentin, et al.
Publicado: (2026)

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

Search and evacuation with a near majority of faulty agents
por: Czyzowicz, J., et al.
Publicado: (2026)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
por: Bergougnoux, Benjamin, et al.
Publicado: (2026)

A $2$-branching construction for the $χ\leq 2r$ bound
por: Date, Vinicius Tikara Venturi, et al.
Publicado: (2026)

SimdQuickHeap: The QuickHeap Reconsidered
por: Breitling, Johannes, et al.
Publicado: (2026)

Approximately Partitioning Vertices into Short Paths
por: Gong, Mingyang, et al.
Publicado: (2026)

On the Online Weighted Non-Crossing Matching Problem
por: Boyar, Joan, et al.
Publicado: (2026)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
por: Roditty, Liam, et al.
Publicado: (2026)

Forwarding Packets Greedily
por: Boyar, Joan, et al.
Publicado: (2026)

Online Combinatorial Optimization with Graphical Dependencies
por: Gao, Zhimeng, et al.
Publicado: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
por: Bruchhold, Sebastian, et al.
Publicado: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
por: Awofeso, Christine, et al.
Publicado: (2025)

Online computation of normalized substring complexity
por: Kucherov, Gregory, et al.
Publicado: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
por: Gong, Mingyang, et al.
Publicado: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
por: Mosenzon, Ron
Publicado: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
por: Lindermayr, Alexander, et al.
Publicado: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
por: Emmerich, Michael
Publicado: (2025)

Online $b$-Matching with Stochastic Rewards
por: Albers, Susanne, et al.
Publicado: (2024)

Hierarchical Exponential Search Via K-Spines
por: Dong, Bob
Publicado: (2025)