Peter Gács

From MaRDI portal
Person:200200

Available identifiers

zbMath Open gacs.peterMaRDI QIDQ200200

List of research outcomes





PublicationDate of PublicationType
Probabilistic cellular automata with Andrei Toom2024-08-27Paper
Probabilistic cellular automata with Andrei Toom2023-06-22Paper
Inequalities for space-bounded Kolmogorov complexity2023-01-12Paper
Stable multi-level monotonic eroders2022-02-14Paper
A reliable Turing machine2021-12-03Paper
A new version of Toom's proof2021-05-12Paper
Stable Multi-Level Monotonic Eroders2018-09-25Paper
Clairvoyant embedding in one dimension2015-11-13Paper
Thermodynamics of computation and information distance2015-05-07Paper
Compatible sequences and a slow Winkler percolation2015-02-27Paper
Algorithmic tests and randomness with respect to a class of measures2014-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54146222014-05-07Paper
A Turing Machine Resisting Isolated Bursts of Faults2012-06-15Paper
Clairvoyant scheduling of random walks2012-04-24Paper
Randomness on computable probability spaces - A dynamical point of view2012-04-24Paper
https://portal.mardi4nfdi.de/entity/Q32240902012-03-29Paper
Randomness on computable probability spaces -- a dynamical point of view2011-05-23Paper
Clairvoyant scheduling of random walks2010-08-05Paper
The angel wins2007-06-19Paper
Uniform test of algorithmic randomness over a general space2005-09-22Paper
Correction to "Algorithmic statistics"2005-05-11Paper
Compatible Sequences and a Slow Winkler Percolation2005-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44732302004-08-04Paper
Algorithmic statistics2002-08-04Paper
Quantum algorithmic entropy2002-01-27Paper
Reliable cellular automata with self-organization2001-08-28Paper
The clairvoyant demon has a hard task2001-04-17Paper
A Toom rule that increases the thickness of sets.2000-02-02Paper
Information distance1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q47633841995-04-11Paper
Lower bounds for the complexity of reliable Boolean circuits with noisy gates1995-03-05Paper
https://portal.mardi4nfdi.de/entity/Q43024561994-09-13Paper
Kolmogorov's contributions to information theory and algorithmic complexity1989-01-01Paper
A simple three-dimensional real-time reliable cellular array1988-01-01Paper
Every sequence is reducible to a random one1986-01-01Paper
Reliable computation with cellular automata1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36800461985-01-01Paper
On the relation between descriptional complexity and algorithmic probability1983-01-01Paper
Causal nets or what is a deterministic computation?1982-01-01Paper
Khachiyan’s algorithm for linear programming1981-01-01Paper
Causal nets or what is a deterministic computation?1981-01-01Paper
Exact Expressions for Some Randomness Tests1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41811001979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38590931978-01-01Paper
Some Remarks on Generalized Spectra1977-01-01Paper
Correction to bounds on conditional probabilities with applications1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41321171977-01-01Paper
Spreading of sets in product spaces and hypercontraction of the Markov operator1976-01-01Paper
Bounds on conditional probabilities with applications in multi-user communication1976-01-01Paper
On a problem of Cox concerning point processes in \(R^k\) of `controlled variability'1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40748081974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40428291974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40795031973-01-01Paper
Hausdorff-dimension and probability distributions1973-01-01Paper
Packing of convex sets in the plane with a great number of neighbours1972-01-01Paper

Research outcomes over time

This page was built for person: Peter Gács