Algorithms Design (In C)
(ime.usp.br)
The 20th century was the century of the equation; the 21st century is the century of the algorithm.
The 20th century was the century of the equation; the 21st century is the century of the algorithm.
Lehmer's Continued Fraction Factorization Algorithm
(leetarxiv.substack.com)
In 1931, at Stanford University, D.H Lehmer and R.E. Powers1 published a general integer factorization algorithm based on the theory of continued fractions.2
In 1931, at Stanford University, D.H Lehmer and R.E. Powers1 published a general integer factorization algorithm based on the theory of continued fractions.2
Shift-to-Middle Array: A Faster Alternative to Std:Deque?
(github.com/attilatorda)
The Shift-To-Middle Array is a dynamic array designed to optimize insertions and deletions at both ends, offering a high-performance alternative to std::deque, std::vector, and linked lists.
The Shift-To-Middle Array is a dynamic array designed to optimize insertions and deletions at both ends, offering a high-performance alternative to std::deque, std::vector, and linked lists.
Numbering should start at zero (1982)
(cs.utexas.edu)
When dealing with a sequence of length N, the elements of which we wish to distinguish by subscript, the next vexing question is what subscript value to assign to its starting element.
When dealing with a sequence of length N, the elements of which we wish to distinguish by subscript, the next vexing question is what subscript value to assign to its starting element.
Amazon accused of using algorithms to push warehouse workers to breaking point
(theregister.com)
Amazon has used tricks, algorithms, and surveillance to discourage warehouse employees from unionizing, according to a paper published in the journal Socius.
Amazon has used tricks, algorithms, and surveillance to discourage warehouse employees from unionizing, according to a paper published in the journal Socius.
Quantum Speedup Found for Class of Hard Problems
(quantamagazine.org)
It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks.
It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks.
Image Dithering: Eleven Algorithms and Source Code
(tannerhelland.com)
Today’s graphics programming topic - dithering - is one I receive a lot of emails about, which some may find surprising.
Today’s graphics programming topic - dithering - is one I receive a lot of emails about, which some may find surprising.
Undergraduate Disproves 40-Year-Old Conjecture, Invents New Kind of Hash Table
(wired.com)
A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
Visualising data structures and algorithms through animation
(visualgo.net)
Initially conceived in 2011 by Associate Professor Steven Halim, VisuAlgo aimed to facilitate a deeper understanding of data structures and algorithms for his students by providing a self-paced, interactive learning platform.
Initially conceived in 2011 by Associate Professor Steven Halim, VisuAlgo aimed to facilitate a deeper understanding of data structures and algorithms for his students by providing a self-paced, interactive learning platform.
Karatsuba Matrix Multiplication and Its Efficient Hardware Implementations
(arxiv.org)
While the Karatsuba algorithm reduces the complexity of large integer multiplication, the extra additions required minimize its benefits for smaller integers of more commonly-used bitwidths.
While the Karatsuba algorithm reduces the complexity of large integer multiplication, the extra additions required minimize its benefits for smaller integers of more commonly-used bitwidths.
A Polyomino Tiling Algorithm (2018)
(gfredericks.com)
Over eight years ago I created the Polyomino Tiler (a browser application that attempts to tile arbitrary grids with sets of polyominoes), but I haven't ever written about the algorithm it uses.
Over eight years ago I created the Polyomino Tiler (a browser application that attempts to tile arbitrary grids with sets of polyominoes), but I haven't ever written about the algorithm it uses.
D-Wave quantum annealers solve problems classical algorithms struggle with
(arstechnica.com)
The latest claim of a clear quantum supremacy solves a useful problem.
The latest claim of a clear quantum supremacy solves a useful problem.
NIST selects HQC as fifth algorithm for post-quantum encryption
(nist.gov)
NIST has chosen a new algorithm for post-quantum encryption called HQC, which will serve as a backup for ML-KEM, the main algorithm for general encryption.
NIST has chosen a new algorithm for post-quantum encryption called HQC, which will serve as a backup for ML-KEM, the main algorithm for general encryption.
The world beneath the shadows of YouTube's algorithm
(bbc.com)
There's a secret side of YouTube, just beyond the guiding hand of the algorithm – and it’s nothing like what you know. The vast majority of YouTube's estimated 14.8 billion videos have almost never been seen. Until now.
There's a secret side of YouTube, just beyond the guiding hand of the algorithm – and it’s nothing like what you know. The vast majority of YouTube's estimated 14.8 billion videos have almost never been seen. Until now.
Kill your Feeds – Stop letting algorithms dictate what you think
(usher.dev)
We are being boiled like frogs. It happened gradually, one algorithmic tweak at a time. What started as a way to connect with friends has become a system that gives the corporations that run social media control over what we consume and the ability to subtly shape how we think.
We are being boiled like frogs. It happened gradually, one algorithmic tweak at a time. What started as a way to connect with friends has become a system that gives the corporations that run social media control over what we consume and the ability to subtly shape how we think.
Karatsuba Matrix Multiplication and Its Efficient Hardware Implementations
(arxiv.org)
While the Karatsuba algorithm reduces the complexity of large integer multiplication, the extra additions required minimize its benefits for smaller integers of more commonly-used bitwidths.
While the Karatsuba algorithm reduces the complexity of large integer multiplication, the extra additions required minimize its benefits for smaller integers of more commonly-used bitwidths.
The silent (R)evolution of SAT (2023)
(cacm.acm.org)
Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
The Kernighan-Lin Search Algorithm
(arxiv.org)
The traveling salesman problem (TSP) and the graph partitioning problem (GPP) are two important combinatorial optimization problems with many applications.
The traveling salesman problem (TSP) and the graph partitioning problem (GPP) are two important combinatorial optimization problems with many applications.
Kyber512's Security Level (2023)
(keymaterial.net)
Sigh. I really didn’t want to have to write this blog post. There is a story going around, claiming that the NSA somehow unduly influenced NIST to choose Kyber over NTRU, despite Kyber not being secure enough. The story is based on this blog post, by famous cryptographer Daniel J. Bernstein (also known as djb), who happens to be one of the authors of the NTRU variant NTRU-prime, which was also competing in the NIST competition.
Sigh. I really didn’t want to have to write this blog post. There is a story going around, claiming that the NSA somehow unduly influenced NIST to choose Kyber over NTRU, despite Kyber not being secure enough. The story is based on this blog post, by famous cryptographer Daniel J. Bernstein (also known as djb), who happens to be one of the authors of the NTRU variant NTRU-prime, which was also competing in the NIST competition.
Constantly Divisionless Random Numbers
(dotat.at)
Last year I wrote about inlining just the fast path of Lemire’s algorithm for nearly-divisionless unbiased bounded random numbers.
Last year I wrote about inlining just the fast path of Lemire’s algorithm for nearly-divisionless unbiased bounded random numbers.
Bluesky: Network topology, polarization, and algorithmic curation
(plos.org)
Bluesky is a novel and decentralized social media site that opened up in an invite-only beta release in February 2023.
Bluesky is a novel and decentralized social media site that opened up in an invite-only beta release in February 2023.