OdderonSearch is the evolved linear search.
ChargeHash is the evolved string hash.
AnyonSearch is the evolved binary search.
TachyonSort is the evolved unstable sort.
Fast Bloom filter using 128-bit MurmurHash3 with double hashing using Kirsch-Mitzenmacher technique. Optimal parameters auto-calculated. Works in Node.js and browsers.
NeutrinoSort is the evolved stable sort.
QuarkBurst is the evolved stateful PRNG.
A space-efficient stepper pattern: compact horizontal indicators that expand to detailed vertical instructions. Vanilla HTML/CSS/JS, no dependencies.
Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves.
This repository contains presentation slides prepared to explain and present a published research paper as part of an academic learning. The research paper was authored by my faculty, who provided his published research paper to me as an academic challenge. I was asked to study the paper carefully and explain its concepts and key ideas.
Space-efficient approximate mappings using perfect hash functions. Supports arbitrary function approximation (X→Y) with configurable storage (8/16/32/64-bit) and accuracy trade-offs.
Space-efficient maplet data structures for approximate key-value mappings - Rust implementation with Python bindings
To associate your repository with the space-efficient topic, visit your repo's landing page and select "manage topics."