pell alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view pell alternatives based on common mentions on social networks and blogs.

arithmoi

9.5 5.6 pell VS arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences
build

9.5 1.6 pell VS build

Build Systems à la Carte

Scout APM: A developer's best friend. Try free for 14-days

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Promo scoutapm.com

toysolver

9.3 8.2 pell VS toysolver

My sandbox for experimenting with solver algorithms.
ersatz

9.0 3.6 pell VS ersatz

A monad for interfacing with external SAT solvers
iproute

8.9 0.0 pell VS iproute

IP Routing Table in Haskell
graphs

8.4 0.0 pell VS graphs

a monadic graph library
aeson-diff

8.3 1.0 pell VS aeson-diff

Generate and apply diffs between JSON documents.
funsat

8.3 0.0 pell VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
primes

8.2 0.0 pell VS primes

Prime Numbers for Haskell
presburger

8.1 0.0 pell VS presburger

Decision procedures for Presburger arithmetic in Haskell
HMM

8.1 0.0 pell VS HMM

hidden markov models in haskell
union-find

8.0 0.0 pell VS union-find

Efficient union and equivalence testing of sets.
imj-animation

7.7 0.6 pell VS imj-animation

Monorepo for a multi-player game engine, and game examples
text-metrics

7.7 3.0 pell VS text-metrics

Calculate various string metrics efficiently in Haskell
lca

7.5 0.0 pell VS lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
search-algorithms

7.1 0.0 pell VS search-algorithms

Haskell library containing common graph search algorithms
ADPfusion

7.1 5.8 pell VS ADPfusion

Efficient, high-level dynamic programming
Adaptive

7.0 0.0 pell VS Adaptive

Library for incremental computing.
dtw

6.9 0.0 pell VS dtw

Implementation of Dynamic Time Warping in Haskell
edit-distance

6.7 1.5 pell VS edit-distance

Edit distance library for Haskell
treeviz

6.3 0.0 pell VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
binary-search

6.1 0.0 pell VS binary-search

Binary and exponential searches
qchas

6.1 0.0 pell VS qchas

A library for implementing Quantum Algorithms
incremental-sat-solver

6.1 0.0 pell VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
integer-logarithms

5.9 0.4 pell VS integer-logarithms

Integer logarithms, originally split from arithmoi package
ListTree

5.9 3.9 pell VS ListTree

A List monad transformer and related tools
cmaes

5.7 0.0 L1 pell VS cmaes

CMA-ES wrapper in Haskell
twentyseven

5.5 0.0 pell VS twentyseven

Rubik's cube solver in Haskell
DP

5.2 0.0 pell VS DP

Holder for a bunch of semirings used in ChartParsing
sgd

5.2 0.0 pell VS sgd

Stochastic gradient descent Haskell library
GraphSCC

5.0 0.0 pell VS GraphSCC

Tarjan's algorithm for computing strongly connected components
infinite-search

4.8 0.0 pell VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
KMP

4.8 0.0 pell VS KMP

Knuth–Morris–Pratt string searching algorithm
union-find-array

4.8 1.9 pell VS union-find-array

ST based union find data structure
TrieMap

4.8 0.0 pell VS TrieMap

Generalized tries for Haskell
nonlinear-optimization-ad

4.6 0.0 pell VS nonlinear-optimization-ad

Wrapper of nonlinear-optimization package for using with ad and backprop packages
jps

4.4 0.0 pell VS jps

:point_right: jump point search for Haskell
primesieve

4.3 0.1 pell VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
spacefill

4.2 0.0 pell VS spacefill

Space-filling curves
adp-multi

4.1 0.0 pell VS adp-multi

Prototype of ADP for MCFL (multiple context-free languages)
edit-distance-vector

3.9 0.0 pell VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
graph-generators

3.8 0.0 pell VS graph-generators

A Haskell library for creating random Data.Graph instances using several pop
primal

3.8 3.2 pell VS primal

Primitive World of Haskell
pathfinding

3.7 0.0 pell VS pathfinding

Haskell pathfinding library
edit-distance-linear

3.6 0.0 pell VS edit-distance-linear

Levenshtein edit distance in linear memory (also turns out to be faster than C++)
stable-marriage

3.3 0.0 pell VS stable-marriage

library around stable marriage algorithms
bordacount

3.0 0.0 pell VS bordacount

Haskell implementation of the Borda count election method
epanet-haskell

2.6 0.0 L2 pell VS epanet-haskell

Call the EPANET toolkit via Haskell's Foreign Function Interface
dgim

2.3 0.0 pell VS dgim

:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.
primes-type

2.3 0.0 pell VS primes-type

Type-safe prime numbers.