:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Clausecker, Robert, Lemire, Daniel, Schintke, Florian
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2412.16370
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster Positional‐Population Counts for AVX2, AVX‐512, and ASIMD
by: Robert Clausecker, et al.
Published: (2025)

Transcoding Unicode Characters with AVX-512 Instructions
by: Clausecker, Robert, et al.
Published: (2022)

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

Exact Short Products From Truncated Multipliers
by: Lemire, Daniel
Published: (2023)

Parsing Millions of DNS Records per Second
by: Koekkoek, Jeroen, et al.
Published: (2024)

Scanning HTML at Tens of Gigabytes per Second on ARM Processors
by: Lemire, Daniel
Published: (2025)

Batched Ranged Random Integer Generation
by: Brackett-Rozinsky, Nevin, et al.
Published: (2024)

Converting an Integer to a Decimal String in Under Two Nanoseconds
by: Gareau, Jaël Champagne, et al.
Published: (2026)

Parsing Millions of URLs per Second
by: Nizipli, Yagiz, et al.
Published: (2023)

Faster Base64 Encoding and Decoding Using AVX2 Instructions
by: Muła, Wojciech, et al.
Published: (2017)

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

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
by: Sharma, Vidya Sagar
Published: (2023)

Faster Parameterized Vertex Multicut
by: Chu, Huairui, et al.
Published: (2026)

Learning the Positions in CountSketch
by: Li, Yi, et al.
Published: (2023)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)

Faster All-Pairs Optimal Electric Car Routing
by: Dorfman, Dani, et al.
Published: (2025)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
by: Kumar, Mithilesh, et al.
Published: (2024)

Faster optimal univariate microgaggregation
by: Stamm, Felix I., et al.
Published: (2024)

Faster Algorithms for Graph Monopolarity
by: Philip, Geevarghese, et al.
Published: (2024)

Simple and Faster Algorithms for Knapsack
by: He, Qizheng, et al.
Published: (2023)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
by: Kadria, Avi, et al.
Published: (2025)

Path Contraction Faster than $2^n$
by: Agrawal, Akanksha, et al.
Published: (2025)

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

Faster Combinatorial k-Clique Algorithms
by: Abboud, Amir, et al.
Published: (2024)

Faster Pseudo-Deterministic Minimum Cut
by: Kenneth-Mordoch, Yotam
Published: (2026)

Faster Deterministic Streaming Vertex Coloring
by: Chechik, Shiri, et al.
Published: (2026)

Faster Edge Coloring by Partition Sieving
by: Akmal, Shyan, et al.
Published: (2025)

Faster Global Minimum Cut with Predictions
by: Moseley, Benjamin, et al.
Published: (2025)

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

Faster Algorithms for Longest Common Substring
by: Charalampopoulos, Panagiotis, et al.
Published: (2021)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
by: Hebert-Johnson, Ursula, et al.
Published: (2023)

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

Faster run-length compressed suffix arrays
by: Brown, Nathaniel K., et al.
Published: (2024)

3SUM in Preprocessed Universes: Faster and Simpler
by: Kasliwal, Shashwat, et al.
Published: (2024)

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

A Faster Algorithm for Pigeonhole Equal Sums
by: Jin, Ce, et al.
Published: (2024)

Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025)

Faster Algorithms for Shortest Unique or Absent Substrings
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)

Faster Algorithms for Text-to-Pattern Hamming Distances
by: Chan, Timothy M., et al.
Published: (2023)

A Faster Algorithm for Constrained Correlation Clustering
by: Fischer, Nick, et al.
Published: (2025)