:: Library Catalog

Cover Image

Saved in:

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

Similar Items

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

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

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

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

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

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)

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

All-Pairs Shortest Paths with Few Weights per Node
by: Abboud, Amir, et al.
Published: (2025)

Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing
by: Shi, Freda, et al.
Published: (2024)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
by: El-Hayek, Antoine, et al.
Published: (2024)

Exactly simulating stochastic chemical reaction networks in sub-constant time per reaction
by: Petrack, Joshua, et al.
Published: (2025)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
by: Petrov, Aleksandr V., et al.
Published: (2024)

Time-Bucketed Balance Records: Bounded-Storage Ephemeral Tokens for Resource-Constrained Systems
by: Scovil, Shaun, et al.
Published: (2025)

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
by: Jansen, Bart M. P., et al.
Published: (2025)

A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing
by: Bshouty, Nader H.
Published: (2026)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
by: Baswana, Surender, et al.
Published: (2025)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
by: Glover, Charles N.
Published: (2024)

Neuro-symbolic Syntactic Parsing: Shaping a Neural Network with the CYK Algorithm
by: Zanzotto, Fabio Massimo, et al.
Published: (2026)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)

A Graph-based Approach to Variant Extraction from Sequences
by: Santcroos, Mark A., et al.
Published: (2025)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
by: Kociumaka, Tomasz, et al.
Published: (2014)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
by: Yuan, Jing, et al.
Published: (2024)

Longest Common Extension of a Dynamic String in Parallel Constant Time
by: Albert, Daniel
Published: (2026)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
by: Rutschmann, Daniel
Published: (2026)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

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

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

Approximation Algorithms for Steiner Connectivity Augmentation
by: Hathcock, Daniel, et al.
Published: (2023)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
by: Kumar, Mithilesh, et al.
Published: (2016)

Distances in Planar Graphs are Almost for Free!
by: Mozes, Shay, et al.
Published: (2026)

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

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
by: Hébert-Johnson, Úrsula, et al.
Published: (2025)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
by: Ganian, Robert, et al.
Published: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
by: Das, Syamantak, et al.
Published: (2024)

Tight Bounds for Sorting Under Partial Information
by: van der Hoog, Ivor, et al.
Published: (2024)

Prophet Inequalities over Time
by: Abels, Andreas, et al.
Published: (2022)

Improved Tree Sparsifiers in Near-Linear Time
by: Agassy, Daniel, et al.
Published: (2025)

Expander Decomposition for Non-Uniform Vertex Measures
by: Agassy, Daniel, et al.
Published: (2025)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
by: Lokshtanov, Daniel, et al.
Published: (2026)