| 2021 | AAAI | Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. | Petr Kucera, Petr Savick |
| 2020 | ISAIM | On the size of CNF formulas with high propagation strength. | Petr Kucera, Petr Savick |
| 2017 | IJCAI | Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract). | Petr Savick, Petr Kucera |
| 2017 | LATA | Cut Languages in Rational Bases. | Jir Sma, Petr Savick |
| 2017 | SAT | A Lower Bound on CNF Encodings of the At-Most-One Constraint. | Petr Kucera, Petr Savick, Vojtech Vorel |
| 2016 | ISAIM | Generating models of a matched formula with a polynomial delay. | Petr Savick, Petr Kucera |
| 2009 | ECSQARU | Triangulation Heuristics for BN2O Networks. | Petr Savick, Jir Vomlel |
| 2003 | IDA | Combining Pairwise Classifiers with Stacking. | Petr Savick, Johannes Frnkranz |
| 2000 | MFCS | A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. | Petr Savick, Detlef Sieling |
| 1999 | ICALP | Approximations by OBDDs and the Variable Ordering Problem. | Matthias Krause, Petr Savick, Ingo Wegener |
| 1997 | MFCS | On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. | Stasys Jukna, Alexander A. Razborov, Petr Savick, Ingo Wegener |
| 1997 | MFCS | A Hierarchy for (1, +k)-Branching Programs with Respect of k. | Petr Savick, Stanislav Zk |
| 1996 | COCOON | On Sparse Parity Chack Matrices (Extended Abstract). | Hanno Lefmann, Pavel Pudlk, Petr Savick |
| 1995 | MFCS | Some Typical Properties of Large AND/OR Boolean Formulas. | Hanno Lefmann, Petr Savick |
| 1988 | MFCS | Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract). | Petr Savick |