Péter Gács - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2022

Inequalities for space-bounded Kolmogorov complexityBruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen. computability, 11(3-4):165-185, 2022. [doi]

Stable Multi-Level Monotonic ErodersPéter Gács, Ilkka Törmä. mst, 66(1):322-353, 2022. [doi]

2015

Clairvoyant embedding in one dimensionPéter Gács. rsa, 47(3):520-560, 2015. [doi]

2013

A Turing Machine Resisting Isolated Bursts Of FaultsIlir Çapuni, Péter Gács. cjtcs, 2013, 2013. [doi]

2012

A Turing Machine Resisting Isolated Bursts of FaultsIlir Çapuni, Péter Gács. sofsem 2012: 165-176 [doi]

2011

Clairvoyant scheduling of random walksPéter Gács. rsa, 39(4):413-485, 2011. [doi]

Randomness on Computable Probability Spaces - A Dynamical Point of ViewPéter Gács, Mathieu Hoyrup, Cristobal Rojas. mst, 48(3):465-485, 2011. [doi]

2009

Randomness on Computable Probability Spaces - A Dynamical Point of ViewPéter Gács, Mathieu Hoyrup, Cristobal Rojas. STACS 2009: 469-480 [doi]

2005

Uniform test of algorithmic randomness over a general spacePéter Gács. TCS, 341(1-3):91-137, 2005. [doi]

2004

Compatible Sequences and a Slow Winkler PercolationPéter Gács. cpc, 37(6):815-856, 2004. [doi]

2002

Correction to Algorithmic statistics Péter Gács, John Tromp, Paul M. B. Vitányi. TIT, 48(8):2427, 2002.

Clairvoyant scheduling of random walksPéter Gács. stoc 2002: 99-108 [doi]

2001

Algorithmic statisticsPéter Gács, John Tromp, Paul M. B. Vitányi. TIT, 47(6):2443-2463, 2001.

Quantum Algorithmic EntropyPéter Gács. cocoon 2001: 274-283 [doi]

Compatible sequences and a slow Winkler percolationPéter Gács. stoc 2001: 694-703 [doi]

2000

Towards an Algorithmic StatisticsPéter Gács, John Tromp, Paul M. B. Vitányi. alt 2000: 41-55 [doi]

The Clairvoyant Demon Has A Hard TaskPéter Gács. cpc, 9(5):421-424, 2000.

1998

Information DistanceCharles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek. TIT, 44(4):1407-1423, 1998.

1997

Reliable Cellular Automata with Self-OrganizationPéter Gács. focs 1997: 90-99 [doi]

1994

Lower bounds for the complexity of reliable Boolean circuits with noisy gatesPéter Gács, A. Gal. TIT, 40(2):579, 1994.

1993

Thermodynamics of computation and information distanceCharles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek. stoc 1993: 21-30 [doi]

1992

On Playing Twenty Questions with a LiarAditi Dhagat, Péter Gács, Peter Winkler. soda 1992: 16-22 [doi]

1989

Self-Correcting Two-Dimensional ArraysPéter Gács. acr, 5:223-326, 1989.

1988

A Simple Three-Dimensional Real-Time Reliable Cellular ArrayPéter Gács, John H. Reif. jcss, 36(2):125-147, 1988.

1986

Every Sequence Is Reducible to a Random OnePéter Gács. iandc, 70(2/3):186-192, August/September 1986.

Reliable Computation with Cellular AutomataPéter Gács. jcss, 32(1):15-78, 1986.

1985

A Simple Three-Dimensional Real-Time Reliable Cellular ArrayPéter Gács, John H. Reif. stoc 1985: 388-395

1983

Reliable Computation with Cellular AutomataPéter Gács. stoc 1983: 32-41

On the Relation between Descriptional Complexity and Algorithmic ProbabilityPéter Gács. TCS, 22:71-93, 1983.

1981

Causal Nets or What is a Deterministic ComputationPéter Gács, Leonid A. Letvin. iandc, 51(1):1-19, October 1981.

On the Relation between Descriptional Complexity and Algorithmic ProbabilityPéter Gács. focs 1981: 296-303

1980

Exact Expressions for Some Randomness TestsPéter Gács. mlq, 26(25-27):385-394, 1980. [doi]

1979

Exact Expressions for some Randomness TestsPéter Gács. tcs 1979: 124-131

Sign in or sign up to see more results.

runs on WebDSL