List of publications

  1. P. Pudlak, V. Rodl and P. Savicky, Graph Complexity, Acta Informatica 25 (1988), pp. 515-535.

  2. P. Savicky, Random Boolean Formulas Representing any Boolean Function with Assymptotically Equal Probability, Discrete Mathematics 83 (1990), pp. 95-103.

  3. P. Savicky, Bent Functions and Random Boolean Formulas, Discrete Mathematics 147 (1995), pp. 211-234.

  4. P. Savicky, On the Bent Boolean Functions That are Symmetric, European J. of Combinatorics 15 (1994), pp. 407-410.

  5. J. Kratochvil, P. Savicky and Zs. Tuza, One More Occurence of Variables Makes Satisfiability Jump from Trivial to NP-complete, SIAM J. Comput. Vol. 22, No. 1, 1993, pp. 203-210.

  6. P. Pudlak, P. Savicky, On Shifting Networks, Note, Theoretical Computer Science 116 (1993), pp. 415-419.

  7. P. Savicky, Improved Boolean formulas for the Ramsey graphs, Random Structures and Algorithms Vol. 6, No. 4 (1995), pp. 407-415.

  8. B. Bollig, M. Huhne, St. Polt, P. Savicky, On the Average Case Delay of Disjunction, Parallel Processing Letters Vol. 5, No. 2 (1995), pp. 275-280.

  9. P. Savicky, I. Wegener, Efficient algorithms for the transformation between different types of binary decision diagrams, Acta Informatica 34, pp. 245-256 (1997).

  10. P. Savicky, Complexity and Probability of some Boolean Formulas, Combinatorics, Probability and Computing 7 (1998), pp. 451-463.

  11. P. Savicky, S. Zak, A Lower Bound on Branching Programs Reading Some Bits Twice, Note, Theoretical Computer Science 172 (1997), pp. 293-301.

  12. P. Savicky, S. Zak, A Large Lower Bound for 1-Branching Programs, TR96-036, ECCC, Trier.

  13. P. Savicky, S. Zak, A Read-once Lower Bound and a (1,+k)-Hierarchy for Branching Programs, Theoretical Computer Science Vol. 238 (2000), pp. 347-362.

  14. V. Kurkova, P. Savicky, K. Hlavackova, Representations and rates of approximation of real-valued Boolean functions by neural networks, Neural Networks 11 (1998), 4, pp. 651-659.

  15. S. Jukna, A. Razborov, P. Savicky, I. Wegener, On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs, Computational Complexity 8:4 (1999).

  16. H. Lefmann, P. Savicky, Some typical properties of Large AND/OR Boolean formulas, Random Struct. Alg. 10 (1997), pp. 337-351.

  17. H. Lefmann, P. Pudlak, P. Savicky, On Sparse Parity Check Matrices, Designs, Codes and Cryptography, 12 (1997), pp. 107-130.

  18. P. Savicky, A. Woods, The number of Boolean functions computed by formulas of a given size, Random Structures and Algorithms Vol. 13, No. 3-4, pp. 349-382, 1998.

  19. P. Savicky, J. Sgall, DNF Tautologies with a Limited Number of Ocurrences of Every Variable, Theoretical Computer Science Vol. 238 (2000), No. 1-2, pp. 495-498.

  20. P. Savicky, A Probabilistic Nonequivalence Test for Syntactic (1,+k)-Branching Programs, TR98-051, ECCC, Trier.

  21. P. Savicky, On Random Orderings of Variables for Parity Ordered Binary Decision Diagrams, Random Structures and Algorithms, Vol. 16, 3, pp. 233-239,2000.

  22. P. Savicky, On determinism versus unambiquous nondeterminism for decision trees, TR02-009, ECCC, Trier.

  23. M. Krause, P. Savicky, I. Wegener. On the Influence of the Variable Ordering for Algorithmic Learning using OBDDs. Information and Computation, Vol. 201, 2005, pp. 160-177.

  24. D. Sieling, P. Savicky. A hierarchy result for read-once branching programs with restricted parity nondeterminism, TCS Vol. 340, 2005, pp. 594-605.

  25. P. Savicky, J. Klaschka, J. Antoch, Optimal Classification Trees. In: COMPSTAT 2000 Proceedings in Computational Statistics. (Ed.: Bethlehem J. G., van der Heijden P. G. M.) - Heidelberg, Physica-Verlag 2000, pp. 427-432

  26. P. Savicky, J. Klaschka. Optimally Trained Regression Trees and Occams Razor. In: COMPSTAT 2002. Proceedings in Computational Statistics. (Ed.: Haerdle W., Roenz B.) - Heidelberg, Physica-Verlag 2002, pp. 479-484

  27. P. Savicky, J. Hlavacova. Measures of Word Commonness. Journal of Quantitative Linguistics, Vol. 9, 2003, No. 3, pp. 215-231. (preliminary version)

  28. P. Savicky, J. Fuernkranz. Combining Pairwise Classifiers with Stacking. In: Advances in Intelligent Data Analysis V. (Ed.: Berthold M.R., Lenz H.J., Bradley E., Kruse R., Borgelt Ch.) - Berlin, Springer 2003, pp. 219-229.

  29. R.K. Bock, A. Chilingarian, M. Gaug, F. Hakl, T. Hengstebeck, M. Jirina, J. Klaschka, E. Kotrc, P. Savicky, S. Towers, A. Vaicilius, W. Wittek. Methods for Multidimensional Event Classification: A Case Study using Images from a Cherenkov Gamma-Ray Telescope. Nuclear Instruments and Methods in Physics Research A, Vol. 516, 2004, pp. 511-528.

  30. P. Savicky, E. Kotrc. Experimental Study of Leaf Confidences for Random Forest. Proceedings of COMPSTAT 2004, In: Computational Statistics. (Ed.: Antoch J.) - Heidelberg, Physica Verlag 2004, pp. 1767-1774.

  31. P. Savicky, R. Cignoli, F. Esteva, L. Godo and C. Noguera. On Product Logic with Truth-constants. Journal of Logic and Computation 2006 16(2), pp. 205-225.

  32. P. Savicky and J. Vomlel. Tensor rank-one decomposition of probability tables. In the Proceedings of the 11th IPMU conference, 2006, Paris, France, pp. 2292-2299.

  33. J. Dvořák, P. Savicky. Softening Splits in Decision Trees Using Simulated Annealing. Proceedings ICANNGA 2007, Warsaw, Part I, LNCS Vol. 4431, pp. 721-729.

  34. Z. Haniková, P. Savicky. Distinguishing standard SBL-algebras with involutive negations by propositional formulas. Mathematical Logic Quarterly 54, No. 6, pp. 579 - 596, (2008).

  35. P. Savicky. A strong nonrandom pattern in Matlab default random number generator. Proceedings of Technical Computing Prague 2006.

  36. P. Savicky, Marko Robnik-Šikonja. Learning Random Numbers: A Matlab Anomaly. Applied Artificial Intelligence, Volume 22, Issue 3, March 2008, pages 254 - 265.

  37. P. Savicky and J. Vomlel. Exploiting tensor rank-one decomposition in probabilistic inference, Kybernetika, Vol. 43, Number 5 (Special Issue dedicated to the memory of Albert Perez), pp. 747-764, 2007.

  38. J. Vomlel and P. Savicky. Arithmetic circuits of the noisy-or models. In the Proceedings of the Fourth European Workshop on Probabilistic Graphical Models (PGM'08), Hirtshals, Denmark, September 17-19, 2008, pp. 297-304.

  39. P. Savicky and J. Vomlel. Triangulation heuristics for BN2O networks. In C. Sossai and G. Chemello (Eds.): ECSQARU 2009, Springer LNAI 5590, pp. 566-577, 2009.

  40. J. Vomlel and P. Savicky. An experimental comparison of triangulation heuristics on transformed BN2O networks. In the proceedings of The Eighth Workshop on Uncertainty Processing WUPES'09, Liblice, Czech Republic, September 19-23th, 2009, pp. 251-260.

  41. M. Mikuš and P. Savicky. Remarks on Gödel's code as a hash function. Tatra Mountains Mathematical Publications, Vol. 47, No. 3, 2010, pp. 67-80.

  42. O. Čepek, P. Kučera and P. Savicky. Boolean functions with a simple certificate for CNF complexity. Discrete Applied Mathematics, Volume 160, Issues 4–5, 2012, pp. 365–382.

  43. P. Savicky. Boolean functions with a vertex-transitive group of automorphisms. TR13-191, ECCC, Trier.

  44. Z. Haniková and P. Savicky. Term satisfiability in FLew-algebras. Theoretical Computer Science, Vol. 631, June 2016, pp. 1-15.

  45. P. Savicky and P. Kučera. Generating models of a matched formula with a polynomial delay. Journal of Artificial Intelligence Research, Vol. 56 (2016), pp. 379-402.

  46. J. Šíma and P. Savický. Cut Languages in Rational Bases. Conference LATA 2017

  47. P. Kučera, P. Savický, V. Vorel. A lower bound on CNF encodings of the at-most-one constraint. 20th International conference Theory and Applications of Satisfiability Testing - SAT 2017, Melbourne. arXiv:1704.08934