Concurrent implementation of Aho-Corasick string matching algorithm in C.
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.
🍢 Radix sorting algorithms for JavaScript
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
A rust translation of my easy_dc algorithm and very first rust program.
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.
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
C++ Implementation of Kruskal's Minimum Spanning Tree algorithm on IP nodes
Do your sorting in perfect O(n) linear time! 🧸, ... A crate of sorts.
An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.
Using Python, created an algorithm inspired by Rabin-Karp Algorithm for string pattern matching in linear time
A linear-time string preprocessing algorithm. Can be used for linear-time pattern matching O(n+m)
This procedure initialise an array in logarithmic time, that is O(log n). That is generally asymptotically better than the classic procedure, which takes linear time O(n).
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."