!!! moved to jnum subproject under crush-software !!!
The Utah Raster Toolkit 3.0, patchlevel 2
Fills a rectangle using given tetris shapes
Hashed dynamic determinants for convex hulls
sorting algorithm for binary keys
Deap is a doubly heap for both min and max number access.
S-Match is a semantic matching framework.
Some Useful C-Utilities
Framework for Hierarchical Graph Decomposition
DisChoco: Distributed Constraint Reasoning Solver
Petri network optimization with Martinez-Silva algorithm
RSA 4096 C++ library