Imagen de Portada

Transcoding Unicode Characters with AVX-512 Instructions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Clausecker, Robert, Lemire, Daniel
Formato:	Preprint
Publicado:	2022
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

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

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

Exact Short Products From Truncated Multipliers
por: Lemire, Daniel
Publicado: (2023)

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

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

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

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

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

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

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

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

Stable coresets: Unleashing the power of uniform sampling
por: Carmel, Amir, et al.
Publicado: (2025)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
por: Kenneth, Yotam, et al.
Publicado: (2023)

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

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

Simple Algorithms for Fully Dynamic Edge Connectivity
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

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

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Cut-Query Algorithms with Few Rounds
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

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

Twin-Width Meets Feedback Edges and Vertex Integrity
por: Balabán, Jakub, et al.
Publicado: (2024)

On Solving Linear Systems in Sublinear Time
por: Andoni, Alexandr, et al.
Publicado: (2018)

Improving Pinwheel Density Bounds for Small Minimums
por: Mishra, Ahan, et al.
Publicado: (2025)

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

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

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

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

Parameterized Complexity of Efficient Sortation
por: Ganian, Robert, et al.
Publicado: (2024)

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

Moderate Dimension Reduction for $k$-Center Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2023)

Prophet Inequalities over Time
por: Abels, Andreas, et al.
Publicado: (2022)

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
por: Agassy, Daniel, et al.
Publicado: (2022)

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

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

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

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

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

The $k$-Fold Matroid Secretary Problem
por: Gujjar, Rishi, et al.
Publicado: (2025)

Tree Proof-of-Position Algorithms
por: Kharman, Aida Manzano, et al.
Publicado: (2024)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
por: Eiben, Eduard, et al.
Publicado: (2024)