Petr Savický
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- semigroups and automata theory
- Advanced Algebra and Logic
- Rough Sets and Fuzzy Logic
Papers in
-
- semigroups and automata theory 10
- Complexity and Algorithms in Graphs 8
- Formal Methods in Verification 8
- Advanced Graph Theory Research 7
- Advanced Algebra and Logic 6
- Rough Sets and Fuzzy Logic 6
-
- Machine Learning and Algorithms 4
- Algorithms and Data Compression 3
- Co-authors
- Jaroslava Hlaváčová (1 shared paper)Pavel Pudlák (3 shared papers)Věra Kůrková (1 shared paper)Jan Kratochvı́l (1 shared paper)Zsolt Tuza (1 shared paper)V. Rödl (1 shared paper)Jiří Vomlel (1 shared paper)Vojtěch Rödl (1 shared paper)
In The Last Decade
Petr Savický
29 papers receiving 366 citations
Peers
Comparison fields: 5 of 70
- Computational Theory and Mathematics 187
- Computational Mathematics 5
- Discrete Mathematics and Combinatorics 26
- Artificial Intelligence 238
- Statistics and Probability 21
Countries citing papers authored by Petr Savický
This map shows the geographic impact of Petr Savický'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 Savický with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Petr Savický more than expected).
Fields of papers citing papers by Petr Savický
This network shows the impact of papers produced by Petr Savický. 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 Savický. The network helps show where Petr Savický may publish in the future.
Co-authors
The 25 scholars most cited alongside Petr Savický, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 34 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 87 | |
| 2 | 2002 | 52 | |
| 3 | 1998 | 32 | |
| 4 | 1993 | 30 | |
| 5 | Graph complexity | 1988 | 27 |
| 6 | 1988 | 23 | |
| 7 | 2006 | 21 | |
| 8 | Exploiting tensor rank-one decomposition in probabilistic inference | 2007 | 17 |
| 9 | A large lower bound for 1-branching programs | 1996 | 14 |
| 10 | 1998 | 12 | |
| 11 | 2000 | 11 | |
| 12 | 1990 | 11 | |
| 13 | 1993 | 9 | |
| 14 | 2008 | 9 | |
| 15 | 2011 | 8 | |
| 16 | 1997 | 7 | |
| 17 | 2000 | 7 | |
| 18 | 1995 | 5 | |
| 19 | 1997 | 5 | |
| 20 | 1995 | 5 |
About Petr Savický
Petr Savický is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications and Computer Vision and Pattern Recognition, having authored 34 papers that have together received 414 indexed citations. Recurring topics across this work include semigroups and automata theory (10 papers), Complexity and Algorithms in Graphs (8 papers), Formal Methods in Verification (8 papers), Advanced Graph Theory Research (7 papers), Advanced Algebra and Logic (6 papers), Rough Sets and Fuzzy Logic (6 papers), Machine Learning and Algorithms (4 papers) and Algorithms and Data Compression (3 papers). The work is most often cited by research in Computational Theory and Mathematics (187 citations), Computational Mathematics (5 citations), Discrete Mathematics and Combinatorics (26 citations), Artificial Intelligence (238 citations) and Statistics and Probability (21 citations). Petr Savický has collaborated with scholars based in Czechia, Germany and Spain. Frequent co-authors include Jaroslava Hlaváčová, Pavel Pudlák, Věra Kůrková, Jan Kratochvı́l, Zsolt Tuza, V. Rödl, Jiří Vomlel, Vojtěch Rödl, Marcel Jiřina and R. K. Böck. Their work appears in journals such as Theoretical Computer Science, Acta Informatica, Discrete Mathematics, Random Structures and Algorithms and Kybernetika.
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.