Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Posterior Cramer-Rao bounds for discrete-time nonlinear filtering
19981.1k citationsPetr Tichavský et al.IEEE Transactions on Signal Processingprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Petr Tichavský
Since
Specialization
Citations
This map shows the geographic impact of Petr Tichavský's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Petr Tichavský with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Petr Tichavský more than expected).
This network shows the impact of papers produced by Petr Tichavský. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Petr Tichavský. The network helps show where Petr Tichavský may publish in the future.
Co-authorship network of co-authors of Petr Tichavský
This figure shows the co-authorship network connecting the top 25 collaborators of Petr Tichavský.
A scholar is included among the top collaborators of Petr Tichavský based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Petr Tichavský. Petr Tichavský is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Tichavský, Petr & Jiří Vomlel. (2018). Representations of Bayesian networks by low-rank models. Digital Repository (National Repository of Grey Literature). 463–474.1 indexed citations
Tichavský, Petr, Anh Huy Phan, & Andrzej Cichocki. (2014). Tensor diagonalization - a new tool for PARAFAC and block-term decomposition.. arXiv (Cornell University).4 indexed citations
Koldovský, Zbyněk, Anh Huy Phan, Petr Tichavský, & Andrzej Cichocki. (2012). A treatment of EEG data by underdetermined blind source separation for motor imagery classification. ASEP. 1484–1488.5 indexed citations
14.
Tichavský, Petr & Zbyněk Koldovský. (2012). Algorithms for nonorthogonal approximate joint block-diagonalization. ASEP. 2094–2098.9 indexed citations
15.
Tichavský, Petr & Zbyněk Koldovský. (2011). Fast and accurate methods of independent component analysis: A Survey.. Kybernetika. 47. 426–438.16 indexed citations
Tichavský, Petr & Peter Händel. (2000). Estimation and smoothing of instantaneous frequency of noisy narrow band signals. European Signal Processing Conference. 1–4.1 indexed citations
Tichavský, Petr. (1988). Estimating the angles of arrival of multiple plane waves. The statistical performance of the music and the minimum norm algorithms. Kybernetika. 24(3). 196–206.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.