Péter Gács

Publication Activity (10 Years)

Years Active: 1977-2022
Publications (10 Years): 7

Top Topics

Top Venues

Chic. J. Theor. Comput. Sci.

Theory Comput. Syst.

Random Struct. Algorithms

Publications

Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen
Inequalities for space-bounded Kolmogorov complexity. Comput. 11 (3-4) (2022)
Péter Gács, Ilkka Törmä
Stable Multi-Level Monotonic Eroders. Theory Comput. Syst. 66 (1) (2022)
Péter Gács
A new version of Toom's proof. CoRR (2021)
Ilir Çapuni, Péter Gács
A reliable Turing machine. CoRR (2021)
Péter Gács
Lecture notes on descriptional complexity and randomness. CoRR (2021)
Péter Gács, Andrei E. Romashchenko, Alexander Shen
Inequalities for space-bounded Kolmogorov complexity. CoRR (2020)
Péter Gács, Ilkka Törmä
Stable Multi-Level Monotonic Eroders. CoRR (2018)
Péter Gács
Clairvoyant embedding in one dimension. Random Struct. Algorithms 47 (3) (2015)
Ilir Çapuni, Péter Gács
A Turing Machine Resisting Isolated Bursts Of Faults. Chic. J. Theor. Comput. Sci. 2013 (2013)
Ilir Çapuni, Péter Gács
A Turing Machine Resisting Isolated Bursts of Faults. SOFSEM (2012)
Ilir Çapuni, Péter Gács
A Turing Machine Resisting Isolated Bursts Of Faults CoRR (2012)
Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen
Algorithmic tests and randomness with respect to a class of measures CoRR (2011)
Péter Gács, Mathieu Hoyrup, Cristobal Rojas
Randomness on Computable Probability Spaces - A Dynamical Point of View. Theory Comput. Syst. 48 (3) (2011)
Péter Gács
Clairvoyant scheduling of random walks. Random Struct. Algorithms 39 (4) (2011)
Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
Information Distance CoRR (2010)
Péter Gács, Mathieu Hoyrup, Cristobal Rojas
Randomness on Computable Probability Spaces - A Dynamical Point of View. STACS (2009)
Péter Gács
Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. 341 (1-3) (2005)
Péter Gács
Compatible Sequences and a Slow Winkler Percolation. Comb. Probab. Comput. 13 (6) (2004)
Péter Gács
Universal randomness test, over a general space CoRR (2003)
Péter Gács
Clairvoyant scheduling of random walks. STOC (2002)
Péter Gács, John Tromp, Paul M. B. Vitányi
Correction to "Algorithmic statistics". IEEE Trans. Inf. Theory 48 (8) (2002)
Péter Gács
Quantum Algorithmic Entropy. Computational Complexity Conference (2001)
Péter Gács, John Tromp, Paul M. B. Vitányi
Algorithmic statistics. IEEE Trans. Inf. Theory 47 (6) (2001)
Péter Gács
Compatible sequences and a slow Winkler percolation. STOC (2001)
Péter Gács
Deterministic computations whose history is independent of the order of asynchronous updating CoRR (2001)
Péter Gács, John Tromp, Paul M. B. Vitányi
Algorithmic Statistics CoRR (2000)
Péter Gács
Reliable Cellular Automata with Self-Organization CoRR (2000)
Péter Gács, John Tromp, Paul M. B. Vitányi
Towards an Algorithmic Statistics. ALT (2000)
Péter Gács
The Clairvoyant Demon Has A Hard Task. Comb. Probab. Comput. 9 (5) (2000)
Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
Information Distance. IEEE Trans. Inf. Theory 44 (4) (1998)
Péter Gács
Reliable Cellular Automata with Self-Organization. FOCS (1997)
Péter Gács, Anna Gál
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inf. Theory 40 (2) (1994)
Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
Thermodynamics of computation and information distance. STOC (1993)
Aditi Dhagat, Péter Gács, Peter Winkler
On Playing "Twenty Questions" with a Liar. SODA (1992)
Péter Gács
Self-Correcting Two-Dimensional Arrays. Adv. Comput. Res. 5 (1989)
Péter Gács, John H. Reif
A Simple Three-Dimensional Real-Time Reliable Cellular Array. J. Comput. Syst. Sci. 36 (2) (1988)
Péter Gács
Reliable Computation with Cellular Automata. J. Comput. Syst. Sci. 32 (1) (1986)
Péter Gács
Every Sequence Is Reducible to a Random One Inf. Control. 70 (2/3) (1986)
Péter Gács, John H. Reif
A Simple Three-Dimensional Real-Time Reliable Cellular Array STOC (1985)
Péter Gács
Reliable Computation with Cellular Automata STOC (1983)
Péter Gács
On the Relation between Descriptional Complexity and Algorithmic Probability. Theor. Comput. Sci. 22 (1983)
Péter Gács
On the Relation between Descriptional Complexity and Algorithmic Probability FOCS (1981)
Péter Gács, Leonid A. Letvin
Causal Nets or What is a Deterministic Computation Inf. Control. 51 (1) (1981)
Péter Gács
Exact Expressions for Some Randomness Tests. Math. Log. Q. 26 (25-27) (1980)
Péter Gács
Exact Expressions for some Randomness Tests. Theoretical Computer Science (1979)
László Lovász, Péter Gács
Some Remarks on Generalized Spectra. Math. Log. Q. 23 (36) (1977)