default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilip Habarta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Lubomír Stepánek
, Filip Habarta, Ivana Malá, Lubos Marek:
Let's estimate all parameters as probabilities: Precise estimation using Chebyshev's inequality, Bernoulli distribution, and Monte Carlo simulations. FedCSIS 2023: 1223-1227- [c8]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
A lower bound for proportion of visibility polygon's surface to entire polygon's surface: Estimated by Art Gallery Problem and proven that cannot be greatly improved. FedCSIS 2023: 1229-1233 - 2022
- [c7]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
Dirichlet's principle revisited: An inverse Dirichlet's principle definition and its bound estimation improvement using stochastic combinatorics. FedCSIS (Communication Papers) 2022: 113-116 - [c6]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
A short note on post-hoc testing using random forests algorithm: Principles, asymptotic time complexity analysis, and beyond. FedCSIS 2022: 489-497 - [c5]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek, Stefka Fidanova:
Application of an Inverse Dirichlet's Principle to Discrete Recreational Problems: Bound Estimation's Optimization Using Combinatorial Probability and Comparison of Numerical Bound Estimation Using Various Algorithms, Including Recursive Inclusion-Exclusion Principle. WCO 2022: 289-313 - 2021
- [c4]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
Alternatives for greedy discrete subsampling: various approaches including cluster subsampling of COVID-19 data with no response variable. FedCSIS (Position Papers) 2021: 103-111 - [c3]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
A random forest-based approach for survival curves comparing: principles, computational aspects and asymptotic time complexity analysis. FedCSIS 2021: 301-311 - 2020
- [c2]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
Reducing the First-Type Error Rate of the Log-Rank Test: Asymptotic Time Complexity Analysis of An Optimized Test's Alternative. WCO@FedCSIS 2020: 281-302 - [c1]Lubomír Stepánek, Filip Habarta, Ivana Malá, Lubos Marek:
Analysis of asymptotic time complexity of an assumption-free alternative to the log-rank test. FedCSIS 2020: 453-460
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-08-05 21:17 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:
