| 2009 |
|---|
| 28 | EE | Péter Gács,
Mathieu Hoyrup,
Cristobal Rojas:
Randomness on Computable Probability Spaces - A Dynamical Point of View.
STACS 2009: 469-480 |
| 2005 |
|---|
| 27 | EE | Péter Gács:
Uniform test of algorithmic randomness over a general space.
Theor. Comput. Sci. 341(1-3): 91-137 (2005) |
| 2004 |
|---|
| 26 | EE | Péter Gács:
Compatible Sequences and a Slow Winkler Percolation.
Combinatorics, Probability & Computing 37(6): 815-856 (2004) |
| 2003 |
|---|
| 25 | EE | Péter Gács:
Universal randomness test, over a general space
CoRR cs.CC/0312039: (2003) |
| 2002 |
|---|
| 24 | EE | Péter Gács:
Clairvoyant scheduling of random walks.
STOC 2002: 99-108 |
| 23 | | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Correction to "Algorithmic statistics".
IEEE Transactions on Information Theory 48(8): 2427 (2002) |
| 2001 |
|---|
| 22 | EE | Péter Gács:
Quantum Algorithmic Entropy.
IEEE Conference on Computational Complexity 2001: 274-283 |
| 21 | EE | Péter Gács:
Compatible sequences and a slow Winkler percolation.
STOC 2001: 694-703 |
| 20 | EE | Péter Gács:
Deterministic computations whose history is independent of the order of asynchronous updating
CoRR cs.DC/0101026: (2001) |
| 19 | | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Algorithmic statistics.
IEEE Transactions on Information Theory 47(6): 2443-2463 (2001) |
| 2000 |
|---|
| 18 | EE | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Towards an Algorithmic Statistics.
ALT 2000: 41-55 |
| 17 | EE | Péter Gács:
Reliable Cellular Automata with Self-Organization
CoRR math.PR/0003117: (2000) |
| 16 | EE | Péter Gács,
John Tromp,
Paul M. B. Vitányi:
Algorithmic Statistics
CoRR math.PR/0006233: (2000) |
| 15 | | Péter Gács:
The Clairvoyant Demon Has A Hard Task.
Combinatorics, Probability & Computing 9(5): (2000) |
| 1998 |
|---|
| 14 | | Charles H. Bennett,
Péter Gács,
Ming Li,
Paul M. B. Vitányi,
Wojciech H. Zurek:
Information Distance.
IEEE Transactions on Information Theory 44(4): 1407-1423 (1998) |
| 1997 |
|---|
| 13 | EE | Péter Gács:
Reliable Cellular Automata with Self-Organization.
FOCS 1997: 90-99 |
| 1994 |
|---|
| 12 | | Péter Gács,
A. Gal:
Lower bounds for the complexity of reliable Boolean circuits with noisy gates.
IEEE Transactions on Information Theory 40(2): 579- (1994) |
| 1993 |
|---|
| 11 | EE | 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: 21-30 |
| 1992 |
|---|
| 10 | EE | Aditi Dhagat,
Péter Gács,
Peter Winkler:
On Playing "Twenty Questions" with a Liar.
SODA 1992: 16-22 |
| 1988 |
|---|
| 9 | | Péter Gács,
John H. Reif:
A Simple Three-Dimensional Real-Time Reliable Cellular Array.
J. Comput. Syst. Sci. 36(2): 125-147 (1988) |
| 1986 |
|---|
| 8 | | Péter Gács:
Every Sequence Is Reducible to a Random One
Information and Control 70(2/3): 186-192 (1986) |
| 7 | | Péter Gács:
Reliable Computation with Cellular Automata.
J. Comput. Syst. Sci. 32(1): 15-78 (1986) |
| 1985 |
|---|
| 6 | | Péter Gács,
John H. Reif:
A Simple Three-Dimensional Real-Time Reliable Cellular Array
STOC 1985: 388-395 |
| 1983 |
|---|
| 5 | | Péter Gács:
Reliable Computation with Cellular Automata
STOC 1983: 32-41 |
| 4 | | Péter Gács:
On the Relation between Descriptional Complexity and Algorithmic Probability.
Theor. Comput. Sci. 22: 71-93 (1983) |
| 1981 |
|---|
| 3 | | Péter Gács:
On the Relation between Descriptional Complexity and Algorithmic Probability
FOCS 1981: 296-303 |
| 2 | | Péter Gács,
Leonid A. Letvin:
Causal Nets or What is a Deterministic Computation
Information and Control 51(1): 1-19 (1981) |
| 1979 |
|---|
| 1 | | Péter Gács:
Exact Expressions for some Randomness Tests.
Theoretical Computer Science 1979: 124-131 |
