William Stafford Parsons

Tiny Offline Browser Games and Open Computer Science Research

I create pick-up-and-play, single-player web browser games built from scratch and conduct computer science research to create improved fundamental algorithms and data structures.

Games

Contrivity

Contrivity

Spawn into the hostile quantum laboratory and destroy oscillations.

Segmentism

Segmentism

Soar over the desolate quantum dystopia and obliterate oscillations.

Research

TBD: WSP-Shortest-Path: The Fastest Pathfinding Algorithm With Traversal From Source to Destination

TBD: WSP-Sort-Stable: The Fastest Portable Sorting Algorithm With Linear Auxiliary Space Complexity

TBD: WSP-Map: The Fastest Hash Table With Low Memory Requirements, High Average Load Factors, Minimal Fragmentation and No Key Rehashes

TBD: WSP-Glyph: An Optimal Series of Flexible, Portable Algorithms That Convert and Validate Between UTF-8, UTF-16 and UTF-32 Character Encodings in Segments

WSP-Vortex: The Fastest Mersenne Twister Improvement With Faster Speed Than Xorshift32 and Flexible State Sizes

WSP-Hash-64: The Fastest Portable 64-Bit Hashing Algorithm With Aligned Multi-Byte Memory Reading and Good Quality

WSP-PRNG-16: The Fastest 16-Bit PRNG With Good Quality

WSP-TRNG: A Classical TRNG Algorithm With Quantum-Level Entropy Generated Internally

WSP-Search-Sorted: The Fastest Search Algorithm Derived From Binary Search

WSP-Hash-OAAT: The Fastest One-at-a-Time Hashing Algorithm With Good Quality

WSP-Sort-Unstable: The Fastest Shell Sort Gap Sequence Calculation and Sorting Algorithm Without Auxiliary Partition Space

WSP-Hash-32: The Fastest Portable 32-Bit Hashing Algorithm With Aligned Multi-Byte Memory Reading and Good Quality

WSP-Navigate: An Optimal 2D Grid Step Navigation Calculation Algorithm

WSP-Hash-256: An Optimal 256-Bit Cryptographic Hashing Algorithm Without Vulnerabilities From Input Padding or Prime Number Constants

WSP-PRNG-32: The Fastest One-at-a-Time 32-Bit PRNG With Good Quality