**linux (10)
**
Job Scheduling |
**Bpr (10)
**
Suffix Trees and Arrays |

**Fast Matrix Multiplication (10)
**
Matrix Multiplication |
**Lp_solve (10)
**
Linear Programming |

**FFTPACK (10)
**
Discrete Fourier Transform |
**FFTW (10)
**
Discrete Fourier Transform |

**BSD Sort (10)
**
Sorting |
**GNU Coreutils (10)
**
Sorting |

**JOBSHOP (10)
**
Job Scheduling |
**Tablix (10)
**
Job Scheduling |

**Goldberg's Network Optimization Codes (10)
**
Shortest Path,
Matching,
Edge and Vertex Connectivity,
Network Flow |
**Cliquer (10)
**
Clique |

**Concorde (10)
**
Traveling Salesman Problem,
Hamiltonian Cycle |
**Chaco (10)
**
Graph Partition |

**Joe Culberson's Graph Coloring Resources (10)
**
Vertex Coloring,
Edge Coloring |
**GeoSteiner (10)
**
Steiner Tree |

**GNU grep (10)
**
String Matching |
**GZIP (10)
**
Text Compression |

**Nettle (10)
**
Cryptography |
**fftw3 (9)
**
Discrete Fourier Transform |

**openssl (9)
**
Cryptography |
**Pizza&Chili (9)
**
Suffix Trees and Arrays |

**Finding Exact Solutions to the Bandwidth Minimization Problem (9)
**
Bandwidth Reduction |
**David Pisinger's optimization codes (9)
**
Knapsack Problem,
Bin Packing |

**GSL (9)
**
Discrete Fourier Transform |
**CAGES (9)
**
Generating Permutations,
Generating Subsets,
Generating Partitions,
Generating Graphs,
Clique,
Graph Isomorphism |

**Graphviz (9)
**
Drawing Graphs Nicely,
Drawing Trees |
**TSP solvers (9)
**
Traveling Salesman Problem |

**Vandegriend's Finding Hamiltonian Cycles (9)
**
Hamiltonian Cycle |
**SCOTCH (9)
**
Graph Partition |

**JOSTLE (9)
**
Graph Partition |
**Mike Trick's Graph Coloring Resources (9)
**
Vertex Coloring,
Edge Coloring |

**FLUTE (9)
**
Steiner Tree |
**Triangle (9)
**
Triangulation |

**TRE (9)
**
Approximate String Matching |
**libxsmm (8)
**
Matrix Multiplication |

**qbsolv (8)
**
Constrained and Unconstrained Optimization |
**libtomcrypt (8)
**
Random Number Generation |

**FiniteStateEntropy (8)
**
Text Compression |
**pigz (8)
**
Text Compression |

**libsodium (8)
**
Cryptography |
**Fast Priority Queues for Cached Memory (8)
**
Priority Queues |

**Strmat (8)
**
Suffix Trees and Arrays,
String Matching |
**The Bandwidth Problem (8)
**
Bandwidth Reduction |

**GAUL (8)
**
Constrained and Unconstrained Optimization |
**GLPK (8)
**
Linear Programming |

**Random Number Generation using Shift Register and Quasi method (8)
**
Random Number Generation |
**NIST statistical test suite (8)
**
Random Number Generation |

**Parallel Random Number Generation (8)
**
Random Number Generation |
**SPRNG (8)
**
Random Number Generation |

**Weisses Data Structure (8)
**
Searching |
**Frank Ruskey's Combinatorial Generation Resources (8)
**
Generating Permutations,
Generating Subsets,
Generating Partitions,
Generating Graphs |

**BIPM (8)
**
Matching,
Minkowski Sum |
**Keld Helsgaun's traveling salesman (8)
**
Traveling Salesman Problem |

**graphcol (8)
**
Vertex Coloring |
**EGC (8)
**
Robust Geometric Primitives |

**QHull (8)
**
Convex Hull,
Triangulation,
Voronoi Diagrams |
**Fortune's 2D Voronoi diagram code (8)
**
Triangulation,
Voronoi Diagrams |

**VRONI (8)
**
Medial-Axis Transform |
**Douglas-Peucker line simplification algorithm implementation by Jack Snoeyink (8)
**
Simplifying Polygons |

**Shape similarity testing via turning functions (8)
**
Shape Similarity |
**Fire-Engine and Spare-Parts String and Language Algorithms (8)
**
String Matching,
Finite State Machine Minimization |

**GnuPG (8)
**
Cryptography |
**OpenSSL (8)
**
Cryptography |

**CAP (8)
**
Longest Common Substring/Subsequence,
Shortest Common Superstring |
**Celera Assembler (8)
**
Shortest Common Superstring |

**kdtree (7)
**
Kd-Trees |
**nlopt (7)
**
Constrained and Unconstrained Optimization |

**amatch (7)
**
String Matching,
Approximate String Matching,
Longest Common Substring/Subsequence |
**agrep (7)
**
Approximate String Matching,
Longest Common Substring/Subsequence |

**Multiprecision Integer and Rational Arithmetic (7)
**
Factoring and Primality Testing |
**FFT (7)
**
Discrete Fourier Transform,
Generating Permutations,
Generating Subsets,
Generating Partitions |

**ParMetis (7)
**
Generating Partitions,
Graph Partition,
Polygon Partitioning |
**NAUTY (7)
**
Generating Graphs,
Graph Isomorphism |

**SATLIB (7)
**
Satisfiability |
**William Cook' Research Software (7)
**
Matching |

**John Kececioglu's research software (7)
**
Matching |
**GraphEd (7)
**
Drawing Trees,
Planarity Detection and Embedding |

**PHYLIP (7)
**
Steiner Tree |
**Fast Robust Predicates for Computational Geometry (7)
**
Robust Geometric Primitives |

**BioGeometry (7)
**
Convex Hull |
**GTS-GNU Triangulated Surface Library (7)
**
Triangulation |

**Ranger (7)
**
Nearest Neighbor Search,
Range Search |
**Program (7)
**
Bin Packing |

**Power Crust (7)
**
Medial-Axis Transform |
**SVMlight (7)
**
Shape Similarity |

**agrep (7)
**
Approximate String Matching,
Longest Common Substring/Subsequence |
**Bioalgorithms' Longest Common Subsequence (7)
**
Longest Common Substring/Subsequence |

**planarity (6)
**
Planarity Detection and Embedding |
**PARI (6)
**
Factoring and Primality Testing,
Arbitrary-Precision Arithmetic |

**Clarkson's higher dimensional convex hull code (6)
**
Convex Hull |
**SYMPHONY (6)
**
Set Cover,
Set Packing |

**genetic-vertex-coloring (5)
**
Vertex Coloring |
**voronoi (5)
**
Voronoi Diagrams |

**brieflz (5)
**
Text Compression |
**huffman (5)
**
Text Compression |

**Handbook of Algorithms and Data Structures (5)
**
Arbitrary-Precision Arithmetic,
Searching,
Median and Selection,
Range Search,
String Matching,
Approximate String Matching,
Finite State Machine Minimization |
**POSIT (5)
**
Satisfiability |

**RAPID (5)
**
Satisfiability,
Shortest Path,
Matching,
Network Flow,
Clique,
Independent Set,
Vertex Cover,
Vertex Coloring |
**Algorithm and Data Structure Repository (5)
**
Connected Components |

**Neural-Networks for Cliques and Coloring (5)
**
Clique,
Independent Set,
Vertex Cover |
**Salowe's Rectilinear Steiner trees (5)
**
Steiner Tree |

**Arrange (5)
**
Point Location,
Maintaining Line Arrangements |
**SNNS (5)
**
Shape Similarity |

**HT/DIG (5)
**
Approximate String Matching |
**JPEG (3)
**
Text Compression |

**Libstree (0)
**
Suffix Trees and Arrays |
**Adaptive Simulated Annealing (0)
**
Constrained and Unconstrained Optimization |

**GMP (0)
**
Arbitrary-Precision Arithmetic |