| Information distance CH Bennett, P Gács, M Li, PMB Vitányi, WH Zurek IEEE Transactions on information theory 44 (4), 1407-1423, 1998 | 847 | 1998 |
| Common information is far less than mutual information. P Gács, J Korner Problems of Control and Information Theory 2, 149-162, 1973 | 519 | 1973 |
| On the symmetry of algorithmic information P Gács Soviet Math. Dokl 15, 1477-1480, 1974 | 505* | 1974 |
| Reliable cellular automata with self-organization P Gács Journal of Statistical Physics 103, 45-267, 2001 | 270 | 2001 |
| Reliable computation with cellular automata P Gács Proceedings of the fifteenth annual ACM symposium on Theory of computing, 32-41, 1983 | 237 | 1983 |
| One-dimensional homogeneous media dissolving finite islands P Gács, G Kurdyumov, L Levin Problems of Information Transmission 14 (3), 92-96, 1978 | 231* | 1978 |
| Khachiyan’s algorithm for linear programming P Gacs, L Lovász Mathematical Programming Study 14, 61-68, 1981 | 217 | 1981 |
| Spreading of sets in product spaces and hypercontraction of the Markov operator R Ahlswede, P Gács The annals of probability, 925-939, 1976 | 209 | 1976 |
| Bounds on conditional probabilities with applications in multi-user communication R Ahlswede, P Gács, J Körner Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 34 (2), 157-177, 1976 | 207 | 1976 |
| Uniform test of algorithmic randomness over a general space P Gács Theoretical Computer Science 341 (1-3), 91-137, 2005 | 166 | 2005 |
| Kolmogorov's contributions to information theory and algorithmic complexity TM Cover, P Gacs, RM Gray The annals of probability 17 (3), 840-865, 1989 | 152 | 1989 |
| Every sequence is reducible to a random one P Gács INFO. CONTROL. 70 (2), 186-192, 1986 | 152 | 1986 |
| Lecture notes on descriptional complexity and randomness P Gács arXiv preprint arXiv:2105.04704, 2021 | 111 | 2021 |
| Quantum algorithmic entropy P Gács Journal of Physics A: Math. Gen. 34 (2001), 6859-6880, 2001 | 108 | 2001 |
| On Playing" Twenty Questions" with a Liar. A Dhagat, P Gács, P Winkler SODA 92, 16-22, 1992 | 102 | 1992 |
| Lower bounds for the complexity of reliable Boolean circuits with noisy gates P Gács, A Gál IEEE Transactions on Information Theory 40 (2), 579-583, 1994 | 98 | 1994 |
| On the relation between descriptional complexity and algorithmic probability P Gács Theoretical Computer Science 22 (1-2), 71-93, 1983 | 95 | 1983 |
| Randomness on computable probability spaces—a dynamical point of view P Gács, M Hoyrup, C Rojas Theory of Computing Systems 48 (3), 465-485, 2011 | 93 | 2011 |
| A simple three-dimensional real-time reliable cellular array P Gács, J Reif Journal of Computer and System Sciences 36 (2), 125-147, 1988 | 83 | 1988 |
| Exact expressions for some randomness tests P Gács Theoretical Computer Science 4th GI Conference: Aachen, March 26–28, 1979 …, 1979 | 79 | 1979 |
Paul VitanyiCWI and University of AmsterdamVerified email at cwi.nl