Péter Gács

According to our database, Péter Gács authored at least 33 papers between 1977 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

Stable Multi-Level Monotonic Eroders.

Péter Gács, Ilkka Törmä

Theory Comput. Syst., 2022

Inequalities for space-bounded Kolmogorov complexity.

Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen

Comput., 2022

2021

A reliable Turing machine.

Ilir Çapuni, Péter Gács

CoRR, 2021

A new version of Toom's proof.

Péter Gács

CoRR, 2021

Lecture notes on descriptional complexity and randomness.

Péter Gács

CoRR, 2021

2020

Inequalities for space-bounded Kolmogorov complexity.

Péter Gács, Andrei E. Romashchenko, Alexander Shen

CoRR, 2020

2015

Clairvoyant embedding in one dimension.

Péter Gács

Random Struct. Algorithms, 2015

2013

A Turing Machine Resisting Isolated Bursts Of Faults.

Ilir Çapuni, Péter Gács

Chic. J. Theor. Comput. Sci., 2013

2011

Clairvoyant scheduling of random walks.

Péter Gács

Random Struct. Algorithms, 2011

Randomness on Computable Probability Spaces - A Dynamical Point of View.

Péter Gács, Mathieu Hoyrup, Cristobal Rojas

Theory Comput. Syst., 2011

Algorithmic tests and randomness with respect to a class of measures

Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen

CoRR, 2011

2005

Uniform test of algorithmic randomness over a general space.

Péter Gács

Theor. Comput. Sci., 2005

2004

Compatible Sequences and a Slow Winkler Percolation.

Péter Gács

Comb. Probab. Comput., 2004

2003

Universal randomness test, over a general space

Péter Gács

CoRR, 2003

2002

Correction to "Algorithmic statistics".

Péter Gács, John Tromp, Paul M. B. Vitányi

IEEE Trans. Inf. Theory, 2002

2001

Algorithmic statistics.

Péter Gács, John Tromp, Paul M. B. Vitányi

IEEE Trans. Inf. Theory, 2001

Deterministic computations whose history is independent of the order of asynchronous updating

Péter Gács

CoRR, 2001

Quantum Algorithmic Entropy.

Péter Gács

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000

The Clairvoyant Demon Has A Hard Task.

Péter Gács

Comb. Probab. Comput., 2000

Towards an Algorithmic Statistics.

Péter Gács, John Tromp, Paul M. B. Vitányi

Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1998

Information Distance.

Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek

IEEE Trans. Inf. Theory, 1998

1997

Reliable Cellular Automata with Self-Organization.

Péter Gács

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1994

Lower bounds for the complexity of reliable Boolean circuits with noisy gates.

Péter Gács, Anna Gál

IEEE Trans. Inf. Theory, 1994

1993

Thermodynamics of computation and information distance.

Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

On Playing "Twenty Questions" with a Liar.

Aditi Dhagat, Péter Gács, Peter Winkler

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1989

Self-Correcting Two-Dimensional Arrays.

Péter Gács

Adv. Comput. Res., 1989

1988

A Simple Three-Dimensional Real-Time Reliable Cellular Array.

Péter Gács, John H. Reif

J. Comput. Syst. Sci., 1988

1986

Reliable Computation with Cellular Automata.

Péter Gács

J. Comput. Syst. Sci., 1986

Every Sequence Is Reducible to a Random One

Péter Gács

Inf. Control., 1986

1983

On the Relation between Descriptional Complexity and Algorithmic Probability.

Péter Gács

Theor. Comput. Sci., 1983

1981

Causal Nets or What is a Deterministic Computation

Péter Gács, Leonid A. Letvin

Inf. Control., October, 1981

1980

Exact Expressions for Some Randomness Tests.

Péter Gács

Math. Log. Q., 1980

1977

Some Remarks on Generalized Spectra.

László Lovász, Péter Gács

Math. Log. Q., 1977