linear-time

A tiny, dependency-free regex engine for Go: guaranteed linear-time matching (no ReDoS), a fluent builder, and Explain() to describe any pattern in plain English.

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.

Solved contextual adaptation with certified global mixing, native CUDA forward/backward, and long-sequence PyTorch experiments.

Concurrent implementation of Aho-Corasick string matching algorithm in C.

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.

Linear-time, ReDoS-safe C++20 header-only regex engine with bounded lookarounds + an re-compatible Python binding

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

Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs

RE2 in pure Python: linear-time, ReDoS-safe regular expressions - no C extension, no backtracking

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.

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.

Implemented linear-time (O(n)) algorithms by iterating efficiently over datasets, analyzing performance trade-offs while ensuring scalability for large input sizes.

A full toolkit for building any type of search engine: code or otherwise.

A regular expression engine that cannot backtrack: linear time in the input, whatever the pattern does

Counting Sort O(n) implementation based on CLRS

Presenting potential linear O(M) Diamter finding algorithm with worst case O(m * n). This is simply a C++ implementation of this iFUB algorithm.