Cover Image

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Li, Yifei
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms F.2.1; I.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
by: Andersson, Joel, et al.
Published: (2026)

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

Selective algorithm processing of subset sum distributions
by: Dawes, Nick
Published: (2024)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

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

Tensor Decomposition for Non-Clifford Gate Minimization
by: Khoruzhii, Kirill, et al.
Published: (2026)

Fast Quantum Amplitude Encoding of Typical Classical Data
by: Pagni, Vittorio, et al.
Published: (2025)

A universal sequence of tensors for the asymptotic rank conjecture
by: Kaski, Petteri, et al.
Published: (2024)

Discovering Algorithms with Computational Language Processing
by: Bourdais, Theo, et al.
Published: (2025)

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

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

$XX^{t}$ Can Be Faster
by: Rybin, Dmitry, et al.
Published: (2025)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

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

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

Min-CSPs on Complete Instances
by: Anand, Aditya, et al.
Published: (2024)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

A Heuristic for Direct Product Graph Decomposition
by: Calderoni, Luca, et al.
Published: (2021)

Online Paging with Heterogeneous Cache Slots
by: Chrobak, Marek, et al.
Published: (2022)

Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
by: Flouro, Aaron R., et al.
Published: (2026)

Deterministic complexity analysis of Hermitian eigenproblems
by: Sobczyk, Aleksandros
Published: (2024)

Stable Iterative Solvers for Ill-conditioned Linear Systems
by: Kalantzis, Vasileios, et al.
Published: (2025)

Invariant subspaces and PCA in nearly matrix multiplication time
by: Sobczyk, Aleksandros, et al.
Published: (2023)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
by: Cicirello, Vincent A.
Published: (2024)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
by: Shao, Xuancheng, et al.
Published: (2007)

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
by: Murthy, Sandeep
Published: (2007)

CART-ELC: Oblique Decision Tree Induction via Exhaustive Search
by: Laack, Andrew D.
Published: (2025)

A Computational Proof of the Highest-Scoring Boggle Board
by: Vanderkam, Dan
Published: (2025)

On the formalization of the notion of a concurrent algorithm
by: Middelburg, C. A.
Published: (2024)