Some Remarks on Generalized Spectra. - László Lovász 001; Péter Gács (Math. Log. Q., 1977)

Exact Expressions for Some Randomness Tests. - Péter Gács (Math. Log. Q., 1980)

Causal Nets or What is a Deterministic Computation - Péter Gács; Leonid A. Letvin (Inf. Control., 1981)

On the Relation between Descriptional Complexity and Algorithmic Probability. - Péter Gács (Theor. Comput. Sci., 1983)

Every Sequence Is Reducible to a Random One - Péter Gács (Inf. Control., 1986)

Reliable Computation with Cellular Automata. - Péter Gács (J. Comput. Syst. Sci., 1986)

A Simple Three-Dimensional Real-Time Reliable Cellular Array. - Péter Gács; John H. Reif (J. Comput. Syst. Sci., 1988)

Self-Correcting Two-Dimensional Arrays. - Péter Gács (Adv. Comput. Res., 1989)

On Playing "Twenty Questions" with a Liar. - Aditi Dhagat; Péter Gács; Peter Winkler 001 (SODA, 1992)

Thermodynamics of computation and information distance. - Charles H. Bennett; Péter Gács; Ming Li 001; Paul M. B. Vitányi; Wojciech H. Zurek (STOC, 1993)

Lower bounds for the complexity of reliable Boolean circuits with noisy gates. - Péter Gács; Anna Gál (IEEE Trans. Inf. Theory, 1994)

Reliable Cellular Automata with Self-Organization. - Péter Gács (FOCS, 1997)

Information Distance. - Charles H. Bennett; Péter Gács; Ming Li 001; Paul M. B. Vitányi; Wojciech H. Zurek (IEEE Trans. Inf. Theory, 1998)

Towards an Algorithmic Statistics. - Péter Gács; John Tromp; Paul M. B. Vitányi (ALT, 2000)

The Clairvoyant Demon Has A Hard Task. - Péter Gács (Comb. Probab. Comput., 2000)

Quantum Algorithmic Entropy. - Péter Gács (CCC, 2001)

Deterministic computations whose history is independent of the order of asynchronous updating - Péter Gács (CoRR, 2001)

Algorithmic statistics. - Péter Gács; John Tromp; Paul M. B. Vitányi (IEEE Trans. Inf. Theory, 2001)

Correction to "Algorithmic statistics". - Péter Gács; John Tromp; Paul M. B. Vitányi (IEEE Trans. Inf. Theory, 2002)

Universal randomness test, over a general space - Péter Gács (CoRR, 2003)

Compatible Sequences and a Slow Winkler Percolation. - Péter Gács (Comb. Probab. Comput., 2004)

Uniform test of algorithmic randomness over a general space. - Péter Gács (Theor. Comput. Sci., 2005)

Algorithmic tests and randomness with respect to a class of measures - Laurent Bienvenu; Péter Gács; Mathieu Hoyrup; Cristobal Rojas; Alexander Shen 001 (CoRR, 2011)

Randomness on Computable Probability Spaces - A Dynamical Point of View. - Péter Gács; Mathieu Hoyrup; Cristobal Rojas (Theory Comput. Syst., 2011)

Clairvoyant scheduling of random walks. - Péter Gács (Random Struct. Algorithms, 2011)

A Turing Machine Resisting Isolated Bursts Of Faults. - Ilir Çapuni; Péter Gács (Chic. J. Theor. Comput. Sci., 2013)

Clairvoyant embedding in one dimension. - Péter Gács (Random Struct. Algorithms, 2015)

Inequalities for space-bounded Kolmogorov complexity. - Péter Gács; Andrei E. Romashchenko; Alexander Shen 001 (CoRR, 2020)

Lecture notes on descriptional complexity and randomness. - Péter Gács (CoRR, 2021)

A new version of Toom's proof. - Péter Gács (CoRR, 2021)

A reliable Turing machine. - Ilir Çapuni; Péter Gács (CoRR, 2021)

Inequalities for space-bounded Kolmogorov complexity. - Bruno Bauwens; Péter Gács; Andrei E. Romashchenko; Alexander Shen 001 (Comput., 2022)

Stable Multi-Level Monotonic Eroders. - Péter Gács; Ilkka Törmä (Theory Comput. Syst., 2022)