default search action
Petr Osicka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Tomás Masopust, Petr Osicka:
On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems. CoRR abs/2402.17000 (2024) - 2023
- [j6]Petr Jancar
, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. Log. Methods Comput. Sci. 19(1) (2023) - [c10]Jirí Balun, Tomás Masopust, Petr Osicka:
Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. MFCS 2023: 16:1-16:15 - [i3]Jirí Balun, Tomás Masopust, Petr Osicka:
Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification. CoRR abs/2304.09920 (2023) - 2020
- [i2]Petr Jancar, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. CoRR abs/2008.11753 (2020)
2010 – 2019
- 2018
- [c9]Petr Jancar
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets. RP 2018: 59-74 - [i1]Petr Jancar, Petr Osicka, Zdenek Sawa:
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets. CoRR abs/1801.01073 (2018) - 2017
- [c8]Petr Osicka, Martin Trnecka
Boolean Matrix Decomposition by Formal Concept Sampling. CIKM 2017: 2243-2246 - 2014
- [j5]Radim Belohlávek, Petr Osicka:
Triadic fuzzy Galois connections as ordinary connections. Fuzzy Sets Syst. 249: 83-99 (2014) - [j4]Jan Konecny, Petr Osicka:
Triadic concept lattices in the framework of aggregation structures. Inf. Sci. 279: 512-527 (2014) - 2013
- [j3]Radim Belohlávek, Martin Kostak
Formal concept analysis with background knowledge: a case study in paleobiological taxonomy of belemnites. Int. J. Gen. Syst. 42(4): 426-440 (2013) - 2012
- [j2]Radim Belohlávek, Petr Osicka:
Triadic concept lattices of data with graded attributes. Int. J. Gen. Syst. 41(2): 93-108 (2012) - [c7]Eduard Bartl, Radim Belohlávek, Petr Osicka, Hana Rezanková
Dimensionality Reduction in Boolean Data: Comparison of Four BMF Methods. CHDD 2012: 118-133 - [c6]Radim Belohlávek, Petr Osicka:
Triadic fuzzy Galois connections as ordinary connections. FUZZ-IEEE 2012: 1-6 - [c5]Petr Osicka:
Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context. IPMU (3) 2012: 221-230 - [c4]Radim Belohlávek, Jan Konecny, Petr Osicka:
Simple Proof of Basic Theorem for General Concept Lattices by Cartesian Representation. MDAI 2012: 294-305 - 2011
- [c3]Radim Belohlávek, Petr Osicka, Vilém Vychodil:
Factorizing Three-Way Ordinal Data Using Triadic Formal Concepts. FQAS 2011: 400-411 - 2010
- [j1]Petr Osicka:
On similarity preservation in fuzzy relation systems with hedges. Int. J. Gen. Syst. 39(5): 507-523 (2010) - [c2]Jan Konecny, Petr Osicka:
General Approach to Triadic Concept Analysis. CLA 2010: 116-126 - [c1]Radim Belohlávek, Petr Osicka:
Triadic Concept Analysis of Data with Fuzzy Attributes. GrC 2010: 661-665
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 2024-04-25 05:53 CEST 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: