| Special values of multiple polylogarithms J Borwein, D Bradley, D Broadhurst, P Lisoněk Transactions of the American Mathematical Society 353 (3), 907-941, 2001 | 508 | 2001 |
| Writing on wet paper J Fridrich, M Goljan, P Lisonek, D Soukal Signal Processing, IEEE Transactions on 53 (10), 3923-3935, 2005 | 406 | 2005 |
| Combinatorial aspects of multiple zeta values JM Borwein, DM Bradley, DJ Broadhurst, P Lisonek JOURNAL OF COMBINATORICS 5, 569-580, 1998 | 143 | 1998 |
| On steganographic embedding efficiency J Fridrich, P Lisoněk, D Soukal International Workshop on Information Hiding, 282-296, 2006 | 116 | 2006 |
| Grid colorings in steganography J Fridrich, P Lisonek Information Theory, IEEE Transactions on 53 (4), 1547-1549, 2007 | 86 | 2007 |
| New maximal two-distance sets P Lisoněk Journal of Combinatorial Theory, Series A 77 (2), 318-338, 1997 | 72 | 1997 |
| Finite metric spaces of strictly negative type P Hjorth, P Lisonĕk, S Markvorsen, C Thomassen Linear algebra and its applications 270 (1), 255-273, 1998 | 61 | 1998 |
| Kochen-Specker set with seven contexts P Lisoněk, P Badzia̧g, JR Portillo, A Cabello Physical Review A 89 (4), 042101, 2014 | 54 | 2014 |
| Classification of some optimal ternary linear codes of small length M Van Eupen, P Lisonvek Designs, Codes and Cryptography 10 (1), 63-84, 1997 | 49 | 1997 |
| Applications of integer relation algorithms JM Borwein, P Lisoněk Discrete Mathematics 217 (1), 65-82, 2000 | 47 | 2000 |
| Linear codes for high payload steganography M Khatirinejad, P Lisoněk Discrete Applied Mathematics 157 (5), 971-981, 2009 | 36 | 2009 |
| On the connection between Kloosterman sums and elliptic curves P Lisoněk International Conference on Sequences and Their Applications, 182-187, 2008 | 36 | 2008 |
| Computational investigations of the Prouhet-Tarry-Escott problem P Borwein, P Lisoněk, C Percival Mathematics of computation 72 (244), 2063-2070, 2003 | 35 | 2003 |
| Computer-assisted studies in algebraic combinatorics P Lisonek Dissertation, 1994 | 35 | 1994 |
| Quantum codes from nearly self-orthogonal quaternary linear codes P Lisoněk, V Singh Designs, codes and cryptography 73 (2), 417-424, 2014 | 34 | 2014 |
| On zeros of Kloosterman sums P Lisoněk, M Moisio Designs, Codes and Cryptography 59 (1-3), 223-230, 2011 | 29 | 2011 |
| Bent functions on partial spreads P Lisoněk, HY Lu Designs, codes and cryptography 73 (1), 209-216, 2014 | 25 | 2014 |
| An efficient characterization of a family of hyperbent functions P Lisonek Information Theory, IEEE Transactions on 57 (9), 6010-6014, 2011 | 25 | 2011 |
| Improvement of the degree setting in Gosper's algorithm P Lisoněk, P Paule, V Strehl Journal of symbolic computation 16 (3), 243-258, 1993 | 21 | 1993 |
| Planar Eulerian triangulations are equivalent to spherical latin bitrades N Cavenagh, P Lisoněk Journal of Combinatorial Theory, Series A 115 (1), 193-197, 2008 | 19 | 2008 |
