摘要: This paper presents a parallel algorithm for computing for- mal concepts. Presented is sequential version upon which we build the one. We describe algorithm, its implementation, scalability, and provide an initial experimental evaluation of eciency. The algo- rithm fast, memory ecient, can be optimized so that all critical operations are reduced to low-level bit-array operations. One key features it avoids synchronization has positive impacts on speed implementation.