Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework. - Petr Krajca; Vilém Vychodil (IDA, 2009)

Comparison of Data Structures for Computing Formal Concepts. - Petr Krajca; Vilém Vychodil (MDAI, 2009)

Data parallel dialect of scheme: outline of the formal model, implementation, performance. - Petr Krajca; Vilém Vychodil (SAC, 2009)

Advances in Algorithms Based on CbO. - Petr Krajca; Jan Outrata; Vilém Vychodil (CLA, 2010)

Software transactional memory for implicitly parallel functional language. - Petr Krajca; Vilém Vychodil (SAC, 2010)

Parallel algorithm for computing fixpoints of Galois connections. - Petr Krajca; Jan Outrata; Vilém Vychodil (Ann. Math. Artif. Intell., 2010)

Using Frequent Closed Itemsets for Data Dimensionality Reduction. - Petr Krajca; Jan Outrata; Vilém Vychodil (ICDM, 2011)

Computing Formal Concepts by Attribute Sorting. - Petr Krajca; Jan Outrata; Vilém Vychodil (Fundam. Informaticae, 2012)

Incremental JIT Compiler for Implicitly Parallel Functional Language. - Petr Krajca (FedCSIS, 2013)

Foundations of relational similarity-based query language RESIQL. - Petr Krajca; Vilém Vychodil (FOCI, 2013)

Query Optimization Strategies in Similarity-Based Databases. - Petr Krajca; Vilém Vychodil (MDAI, 2013)

Optimized and Parallel Query Processing in Similarity-Based Databases. - Petr Krajca (MDAI, 2015)

Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and Their Application to Clustering. - Petr Krajca; Martin Trnecka (MDAI, 2018)

On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient. - Jan Konecny 001; Petr Krajca (Inf. Sci., 2018)

Parallelization of the GreConD Algorithm for Boolean Matrix Factorization. - Petr Krajca; Martin Trnecka (ICFCA, 2019)

On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method. - Jan Konecny 001; Petr Krajca (Inf. Sci., 2019)

LCM is Well Implemented CbO: Study of LCM from FCA Point of View. - Radek Janostik; Jan Konecny 001; Petr Krajca (CLA, 2020)

Pruning in Map-Reduce Style CbO Algorithms. - Jan Konecny 001; Petr Krajca (ICCS, 2020)

Interface between Logical Analysis of Data and Formal Concept Analysis. - Radek Janostik; Jan Konecny 001; Petr Krajca (Eur. J. Oper. Res., 2020)

Improving the Performance of Lindig-Style Algorithms with Empty Intersections. - Petr Krajca (ICCS, 2021)

Reducing Negative Impact of Noise in Boolean Matrix Factorization with Association Rules. - Petr Krajca; Martin Trnecka (IDA, 2021)

LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis. - Radek Janostik; Jan Konecny 001; Petr Krajca (Inf. Sci., 2021)

Systematic categorization and evaluation of CbO-based algorithms in FCA. - Jan Konecny 001; Petr Krajca (Inf. Sci., 2021)

On pruning techniques in map-reduce style CbO algorithms. - Jan Konecny 001; Petr Krajca (Ann. Math. Artif. Intell., 2022)

LCM from FCA point of view: A CbO-style algorithm with speed-up features. - Radek Janostik; Jan Konecny 001; Petr Krajca (Int. J. Approx. Reason., 2022)

Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis. - Radek Janostik; Jan Konecny 001; Petr Krajca (Inf. Sci., 2022)

Decoupling Types and Representations of Values for Runtime Optimizations. - Petr Krajca; Radomir Skrabal (FedCSIS (Position Papers), 2023)