Péter Gács

Orcid: 0000-0003-2496-0332

Affiliations:
  • Computer Science Department, Boston University, USA


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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Stable Multi-Level Monotonic Eroders.
Theory Comput. Syst., 2022

Inequalities for space-bounded Kolmogorov complexity.
Comput., 2022

2021
A reliable Turing machine.
CoRR, 2021

A new version of Toom's proof.
CoRR, 2021

Lecture notes on descriptional complexity and randomness.
CoRR, 2021

2020
Inequalities for space-bounded Kolmogorov complexity.
CoRR, 2020

2015
Clairvoyant embedding in one dimension.
Random Struct. Algorithms, 2015

2012
A Turing Machine Resisting Isolated Bursts of Faults.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011
Algorithmic tests and randomness with respect to a class of measures
CoRR, 2011

2009
Randomness on Computable Probability Spaces - A Dynamical Point of View.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2005
Uniform test of algorithmic randomness over a general space.
Theor. Comput. Sci., 2005

2003
Universal randomness test, over a general space
CoRR, 2003

2002
Correction to "Algorithmic statistics".
IEEE Trans. Inf. Theory, 2002

Clairvoyant scheduling of random walks.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
Algorithmic statistics.
IEEE Trans. Inf. Theory, 2001

Deterministic computations whose history is independent of the order of asynchronous updating
CoRR, 2001

Compatible sequences and a slow Winkler percolation.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Quantum Algorithmic Entropy.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000
The Clairvoyant Demon Has A Hard Task.
Comb. Probab. Comput., 2000

Towards an Algorithmic Statistics.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1998
Information Distance.
IEEE Trans. Inf. Theory, 1998

1997
Reliable Cellular Automata with Self-Organization.
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.
IEEE Trans. Inf. Theory, 1994

1993
Thermodynamics of computation and information distance.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
On Playing "Twenty Questions" with a Liar.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1989
Self-Correcting Two-Dimensional Arrays.
Adv. Comput. Res., 1989

1986
Every Sequence Is Reducible to a Random One
Inf. Control., 1986

1985
A Simple Three-Dimensional Real-Time Reliable Cellular Array
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1983
Reliable Computation with Cellular Automata
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1981
Causal Nets or What is a Deterministic Computation
Inf. Control., October, 1981

On the Relation between Descriptional Complexity and Algorithmic Probability
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979
Exact Expressions for some Randomness Tests.
Proceedings of the Theoretical Computer Science, 1979

1977
Some Remarks on Generalized Spectra.
Math. Log. Q., 1977


  Loading...