Petr Savický

933 total citations
34 papers, 408 citations indexed

About

Petr Savický is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Petr Savický has authored 34 papers receiving a total of 408 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 16 papers in Artificial Intelligence and 4 papers in Electrical and Electronic Engineering. Recurrent topics in Petr Savický's work include semigroups and automata theory (10 papers), Complexity and Algorithms in Graphs (8 papers) and Formal Methods in Verification (8 papers). Petr Savický is often cited by papers focused on semigroups and automata theory (10 papers), Complexity and Algorithms in Graphs (8 papers) and Formal Methods in Verification (8 papers). Petr Savický collaborates with scholars based in Czechia, Germany and Slovakia. Petr Savický's co-authors include Jaroslava Hlaváčová, Pavel Pudlák, Věra Kůrková, Jan Kratochvı́l, Zsolt Tuza, Jiří Vomlel, V. Rödl, Vojtěch Rödl, T. Hengstebeck and F. Hakl and has published in prestigious journals such as Neural Networks, SIAM Journal on Computing and Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment.

In The Last Decade

Petr Savický

29 papers receiving 361 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Petr Savický Czechia	12	235	188	48	39	29	34	408
Marko Budinich Italy	7	163 0.7×	108 0.6×	53 1.1×	61 1.6×	9 0.3×	28	341
Johannes Grabmeier Germany	8	205 0.9×	157 0.8×	28 0.6×	29 0.7×	8 0.3×	13	401
A. C. Norman United Kingdom	9	145 0.6×	98 0.5×	103 2.1×	24 0.6×	8 0.3×	19	350
David J. Haglin United States	12	146 0.6×	95 0.5×	98 2.0×	60 1.5×	18 0.6×	44	407
Arne Storjohann Canada	14	290 1.2×	492 2.6×	39 0.8×	29 0.7×	5 0.2×	53	631
Angus Macintyre United Kingdom	20	260 1.1×	502 2.7×	16 0.3×	28 0.7×	5 0.2×	88	1.4k
Hugh C. Williams Canada	14	244 1.0×	101 0.5×	30 0.6×	66 1.7×	2 0.1×	46	481
Aravindan Vijayaraghavan United States	8	140 0.6×	182 1.0×	82 1.7×	28 0.7×	2 0.1×	28	340
Jonathan S. Golan Israel	13	263 1.1×	701 3.7×	45 0.9×	21 0.5×	2 0.1×	53	1.3k
William Gasarch United States	12	603 2.6×	529 2.8×	134 2.8×	37 0.9×	2 0.1×	83	845

Countries citing papers authored by Petr Savický

Since Specialization

Citations

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ý

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Petr Savický

This figure shows the co-authorship network connecting the top 25 collaborators of Petr Savický. A scholar is included among the top collaborators of Petr Savický 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 Savický. Petr Savický is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Kučera, Petr & Petr Savický. (2021). Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. Proceedings of the AAAI Conference on Artificial Intelligence. 35(5). 3832–3840.

Šı́ma, Jiřı́ & Petr Savický. (2018). Quasi-periodic β-expansions and cut languages. Theoretical Computer Science. 720. 1–23. 2 indexed citations

Savický, Petr, et al.. (2016). Term satisfiability in FLew-algebras. Theoretical Computer Science. 631. 1–15. 1 indexed citations

Kučera, Petr, et al.. (2011). Boolean functions with a simple certificate for CNF complexity. Discrete Applied Mathematics. 160(4-5). 365–382. 8 indexed citations

Savický, Petr & Jiří Vomlel. (2007). Exploiting tensor rank-one decomposition in probabilistic inference. Kybernetika. 43(5). 747–764. 17 indexed citations

Böck, R. K., A. Chilingarian, M. Gaug, et al.. (2003). Methods for multidimensional event classification: a case study using images from a Cherenkov gamma-ray telescope. Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment. 516(2-3). 511–528. 85 indexed citations

Savický, Petr. (2002). On determinism versus unambiquous nondeterminism for decision trees. Electronic colloquium on computational complexity. 4 indexed citations

Savický, Petr & Jiřı́ Sgall. (2000). DNF tautologies with a limited number of occurrences of every variable. Theoretical Computer Science. 238(1-2). 495–498. 11 indexed citations

Savický, Petr, et al.. (2000). A read-once lower bound and a (1,+k)-hierarchy for branching programs. Theoretical Computer Science. 238(1-2). 347–362. 7 indexed citations

10.

Jukna, Stasys, Alexander Razborov, Petr Savický, & Ingo Wegener. (1999). On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs. Computational Complexity. 8(4). 357–370. 2 indexed citations

11.

Savický, Petr & Alan R. Woods. (1998). The number of Boolean functions computed by formulas of a given size. Random Structures and Algorithms. 13(3-4). 349–382. 12 indexed citations

12.

Kůrková, Věra, et al.. (1998). Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Networks. 11(4). 651–659. 32 indexed citations

13.

Savický, Petr, et al.. (1997). A lower bound on branching programs reading some bits twice. Theoretical Computer Science. 172(1-2). 293–301. 4 indexed citations

14.

Lefmann, Hanno, Pavel Pudlák, & Petr Savický. (1997). On Sparse Parity Check Matrices. Designs Codes and Cryptography. 12(2). 107–130. 5 indexed citations

15.

Savický, Petr, et al.. (1996). A large lower bound for 1-branching programs. Digital Repository (National Repository of Grey Literature). 3. 14 indexed citations

16.

Bollig, Beate, et al.. (1995). ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION. Parallel Processing Letters. 5(2). 275–280. 1 indexed citations

17.

Savický, Petr, et al.. (1993). On shifting networks. Theoretical Computer Science. 116(2). 415–419. 9 indexed citations

18.

Savický, Petr. (1990). Random boolean formulas representing any boolean function with asymptotically equal probability. Discrete Mathematics. 83(1). 95–103. 11 indexed citations

19.

Pudlák, Pavel, V. Rödl, & Petr Savický. (1988). Graph complexity. Acta Informatica. 25(5). 515–535. 27 indexed citations

20.

Savický, Petr. (1987). Boolean functions represented by random formulas. Commentationes Mathematicae Universitatis Carolinae. 28(2). 397–398.

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.

Explore authors with similar magnitude of impact