default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Krajca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]Petr Krajca, Radomir Skrabal:
Decoupling Types and Representations of Values for Runtime Optimizations. FedCSIS (Position Papers) 2023: 67-76- 2022
- [j10]Jan Konecny
, Petr Krajca:
On pruning techniques in map-reduce style CbO algorithms. Ann. Math. Artif. Intell. 90(11-12): 1107-1124 (2022) - [j9]Radek Janostik, Jan Konecny, Petr Krajca:
LCM from FCA point of view: A CbO-style algorithm with speed-up features. Int. J. Approx. Reason. 142: 64-80 (2022) - [j8]Radek Janostik, Jan Konecny, Petr Krajca:
Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis. Inf. Sci. 616: 182-203 (2022) - 2021
- [j7]Radek Janostik, Jan Konecny, Petr Krajca:
LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis. Inf. Sci. 572: 223-240 (2021) - [j6]Jan Konecny, Petr Krajca:
Systematic categorization and evaluation of CbO-based algorithms in FCA. Inf. Sci. 575: 265-288 (2021) - [c17]Petr Krajca:
Improving the Performance of Lindig-Style Algorithms with Empty Intersections. ICCS 2021: 91-104 - [c16]Radek Janostik, Jan Konecny, Petr Krajca:
Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis. ICFCA 2021: 91-106 - [c15]Petr Krajca, Martin Trnecka:
Reducing Negative Impact of Noise in Boolean Matrix Factorization with Association Rules. IDA 2021: 365-375 - 2020
- [j5]Radek Janostik, Jan Konecny, Petr Krajca:
Interface between Logical Analysis of Data and Formal Concept Analysis. Eur. J. Oper. Res. 284(2): 792-800 (2020) - [c14]Radek Janostik, Jan Konecny, Petr Krajca:
LCM is Well Implemented CbO: Study of LCM from FCA Point of View. CLA 2020: 47-58 - [c13]Jan Konecny, Petr Krajca:
Pruning in Map-Reduce Style CbO Algorithms. ICCS 2020: 103-116 - [i2]Radek Janostik, Jan Konecny, Petr Krajca:
LCM is well implemented CbO: study of LCM from FCA point of view. CoRR abs/2010.06980 (2020) - [i1]Radek Janostik, Jan Konecny, Petr Krajca:
LinCbO: fast algorithm for computation of the Duquenne-Guigues basis. CoRR abs/2011.04928 (2020)
2010 – 2019
- 2019
- [j4]Jan Konecny, Petr Krajca:
On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method. Inf. Sci. 491: 48-62 (2019) - [c12]Petr Krajca, Martin Trnecka:
Parallelization of the GreConD Algorithm for Boolean Matrix Factorization. ICFCA 2019: 208-222 - 2018
- [j3]Jan Konecny, Petr Krajca:
On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient. Inf. Sci. 467: 431-445 (2018) - [c11]Petr Krajca, Martin Trnecka:
Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and Their Application to Clustering. MDAI 2018: 169-181 - 2015
- [c10]Petr Krajca:
Optimized and Parallel Query Processing in Similarity-Based Databases. MDAI 2015: 167-179 - 2013
- [c9]Petr Krajca:
Incremental JIT Compiler for Implicitly Parallel Functional Language. FedCSIS 2013: 1499-1506 - [c8]Petr Krajca, Vilém Vychodil:
Foundations of relational similarity-based query language RESIQL. FOCI 2013: 15-23 - [c7]Petr Krajca, Vilém Vychodil:
Query Optimization Strategies in Similarity-Based Databases. MDAI 2013: 179-191 - 2012
- [j2]Petr Krajca, Jan Outrata, Vilém Vychodil:
Computing Formal Concepts by Attribute Sorting. Fundam. Informaticae 115(4): 395-417 (2012) - 2011
- [c6]Petr Krajca, Jan Outrata, Vilém Vychodil:
Using Frequent Closed Itemsets for Data Dimensionality Reduction. ICDM 2011: 1128-1133 - 2010
- [j1]Petr Krajca, Jan Outrata, Vilém Vychodil:
Parallel algorithm for computing fixpoints of Galois connections. Ann. Math. Artif. Intell. 59(2): 257-272 (2010) - [c5]Petr Krajca, Jan Outrata, Vilém Vychodil:
Advances in Algorithms Based on CbO. CLA 2010: 325-337 - [c4]Petr Krajca, Vilém Vychodil:
Software transactional memory for implicitly parallel functional language. SAC 2010: 2123-2130
2000 – 2009
- 2009
- [c3]Petr Krajca, Vilém Vychodil:
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework. IDA 2009: 333-344 - [c2]Petr Krajca, Vilém Vychodil:
Comparison of Data Structures for Computing Formal Concepts. MDAI 2009: 114-125 - [c1]Petr Krajca, Vilém Vychodil:
Data parallel dialect of scheme: outline of the formal model, implementation, performance. SAC 2009: 1938-1939
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
