-
Sparse Sets and Where to Find Them
Building custom dictionaries for fun and profit
-
The 24-Vertex Problem
Solving a variation of the Hamiltonian path problem with the Held-Karp algorithm
-
D&D and Algorithms Revisited
Rolling the dice using fast computation of binomial coefficients and caching
-
Trees and Tribulations
Speeding up string search with a suffix tree and Ukkonen's algorithm
-
Breaching Breach Protocol
A take on solving Breach Protocol for Cyberpunk 2077
-
Numbers in Vectors
Analyzing and implementing a SIMD algorithm for parsing a series of integers
-
A QUIC Chat
Exploring the QUIC protocol by building a chat application
-
Programming Guitar Music
From making a beep to performing a "guitar" cover
-
D&D and Algorithms
Rolling the dice using brute-force and binomial coefficients
-
Computing the Convex Hull on GPU
With ILGPU it has never been easier to write CUDA code in .NET
-
Exploring Spans and Pipelines Revisited
Revisiting a previous post on spans and pipelines and improving parsing performance
-
Haystacks, Needles, and Hardware Intrinsics
.NET Core 3.0 allows us to dive a bit deeper into SIMD and intrinsics
-
Vectorized Computations and SIMD
Exploring SIMD-enabled types in .NET
-
Exploring Spans and Pipelines
Improving the performance of file parsing by using new goodies in .NET Core