Official implementation and interactive visualization of the Position Pure (PP) linear-time unranking algorithm.
Minimal and efficient JAX implementation of the Mamba State Space Model in JAX/Flax. Inspired by 'Mamba: Linear-Time Sequence Modeling with Selective State Spaces,' this repo provides fast, scalable, and well-documented state-of-the-art sequence modeling tools.
Concurrent implementation of Aho-Corasick string matching algorithm in C.
Linear-time sequence modeling that replaces attention's O(n²d) complexity with O(nd) summation-based aggregation. Demonstrates constraint-driven emergence: how functional representations can develop from optimization pressure and architectural constraints alone, without explicit pairwise interactions.
LSD Radix sort — O(nk) linear time for integers
🍢 Radix sorting algorithms for JavaScript
Attention-Driven Transformers replace most attention layers with simple linear–activation blocks, keeping a single top attention layer to drive global representation learning. This design improves forecasting accuracy and speed over standard transformer models.
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
A linear-time k-center algorithm with fairness conditions and worst-case guarantees that is very fast in practice. Written in Rust with Python bindings.
Implemented linear-time (O(n)) algorithms by iterating efficiently over datasets, analyzing performance trade-offs while ensuring scalability for large input sizes.
A rust translation of my easy_dc algorithm and very first rust program.
Minimal regex engine for fastC — Thompson NFA, no backreferences, linear-time matching. Part of the fastc-core six-month set.
Using Python, created an algorithm inspired by Rabin-Karp Algorithm for string pattern matching in linear time
Presenting potential linear O(M) Diamter finding algorithm with worst case O(m * n). This is simply a C++ implementation of this iFUB algorithm.
Counting Sort O(n) implementation based on CLRS
Do your sorting in perfect O(n) linear time! 🧸, ... A crate of sorts.
C++ Implementation of Kruskal's Minimum Spanning Tree algorithm on IP nodes
A linear-time string preprocessing algorithm. Can be used for linear-time pattern matching O(n+m)
RE2 in pure Python: linear-time, ReDoS-safe regular expressions - no C extension, no backtracking
Add a description, image, and links to the linear-time topic page so that developers can more easily learn about it.
To associate your repository with the linear-time topic, visit your repo's landing page and select "manage topics."