linear-time
There are 16 repositories under linear-time topic.
JavierAntoran/concurrent-Aho-Corasick-string-match
Concurrent implementation of Aho-Corasick string matching algorithm in C.
Vadimbuildercxx/mamba_fast_simple
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.
integer-sorting/radix-sort
:oden: Radix sorting algorithms for JavaScript
algofaktura/easy_dc_rust
A rust translation of my easy_dc algorithm and very first rust program.
LeonSering/fair_and_fast_k_center_clustering
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.
qiaw99/3-coloring-polynomial-time
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
aamodpant15/counting_sort
Counting Sort O(n) implementation based on CLRS
CTzatzakis/MST-IPs
C++ Implementation of Kruskal's Minimum Spanning Tree algorithm on IP nodes
joshuaSYSS/iFUB-Algorithm
Presenting potential linear O(M) Diamter finding algorithm with worst case O(m * n). This is simply a C++ implementation of this iFUB algorithm.
npar0005/Z-Algorithm
A linear-time string preprocessing algorithm. Can be used for linear-time pattern matching O(n+m)
terzinodipaese/initialisation-of-an-array-in-logarithmic-time
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).
wang2346581/kthSmallest
find kth Smallest element in list
ynd24/String-Pattern-Matching-Linear-Time
Using Python, created an algorithm inspired by Rabin-Karp Algorithm for string pattern matching in linear time
foresterre/linearsort
Do your sorting in perfect O(n) linear time! 🧸, ... A crate of sorts.
ianjray/wildcard
C Wildcard Matching (Linear Time)
M4rukku/Ukkonens-Linear-Time-Shortest-Common-Superstring
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.