fcalgs by by Petr Krajca, Jan Outrata, and 
Vilem Vychodil. ; 
parallel recursive implementation of Kuznetsov's CbO (
Close by One) algorithm. The INPUT-FILE is in the 
usual FIMI format.  The code is C and “parallel” is an option; it can be run as the sequential algorithm.  In fact, the parallelism only kicks in after the sequential algorithm has built a good foundation for the threads to complete. Whereas CbO as originally described adds objects to the extent one by one, intersecting their intents with the previous intent (as long as the intersection is not empty), pcbo processes the dual problem: it adds attributes to the intent and intersects the extent of the new attribute with the extent of the previous concept. It appears to be about 100 times faster than any other algorithm for binary attributes.  More recently, Simon Andrews published an algorithm called 
In-Close similar in concept, but with different choices of pre-calculation and memory usage, which seems to be about 40 times faster than the sequential version of pcbo!