amargaritov / starlitLinks
Hutter Prize Submission 2021a: STARLIT + cmix
☆101Updated 2 years ago
Alternatives and similar repositories for starlit
Users that are interested in starlit are comparing it to the libraries listed below
Sorting:
- ☆41Updated 2 years ago
- Convergence verification of the Collatz problem☆69Updated last week
- ☆51Updated last year
- Hutter Prize Submission☆35Updated 11 months ago
- Data compression using LSTM in TensorFlow☆104Updated 2 years ago
- Hutter Prize Submission☆14Updated 4 years ago
- cmix is a lossless data compression program aimed at optimizing compression ratio at the cost of high CPU/memory usage.☆663Updated 3 months ago
- ☆150Updated 3 years ago
- Tools for finding Busy Beaver Turing Machines and Proving others as non-halting☆44Updated this week
- Data compression using LSTM☆136Updated 2 years ago
- MCM file compressor☆115Updated 7 years ago
- libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.☆37Updated last month
- Runtime and miner for the LODA language written in C++☆27Updated last week
- An evolutionary approach to find small and low latency sorting networks☆68Updated 5 months ago
- deflate stream reconstruction library☆36Updated 6 years ago
- Viznut's C-only GPT-2 implementation☆52Updated 3 years ago
- A library for building efficient set-membership filters and dictionaries based on the Satisfiability problem.☆82Updated 3 years ago
- Optimizing Brainfuck interpreter in the C preprocessor☆62Updated 3 years ago
- An easy to decode base64 modification.☆41Updated 3 years ago
- Creating minimal perfect hash functions☆61Updated 2 weeks ago
- Train neural networks that distill into logic circuits, using JAX☆62Updated 3 months ago
- 👥 Sorting powered by human intelligence☆18Updated 5 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆220Updated last week
- Busy Beaver deciders backed by Coq proof☆54Updated 6 months ago
- A (new?) compression algorithm that uses combinatorics.☆25Updated last year
- 🦠 AD in less than 20 lines☆54Updated 4 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆111Updated 3 weeks ago
- A text compressor based on the PAQ architecture.☆19Updated last week
- A thin, highly portable toolkit for efficiently compiling dense loop-based computation.☆148Updated 2 years ago
- String Matching Algorithms Research Tool☆104Updated last year