Cover Image

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Shlyk, Vasiliy S.
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Databases 68P10, 68W40 F.2.2; H.2.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
by: Alpay, Faruk, et al.
Published: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
by: Bressan, Marco, et al.
Published: (2026)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
by: Filmus, Yuval, et al.
Published: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
by: Alpay, Faruk, et al.
Published: (2026)

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

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
by: Eslami, Navid, et al.
Published: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Amnesiac Flooding: Easy to break, hard to escape
by: Austin, Henry, et al.
Published: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)

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

Fast FPT Algorithms for Grundy Number on Dense Graphs
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)

Minimum-cost paths for electric cars
by: Dorfman, Dani, et al.
Published: (2024)

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

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)

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)

PPSZ is better than you think
by: Scheder, Dominik
Published: (2022)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Strengths and Limitations of Greedy in Cup Games
by: Jasińska, Kalina, et al.
Published: (2026)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)