default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Gács
Person information
- affiliation: Computer Science Department, Boston University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Bruno Bauwens
, Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. Comput. 11(3-4): 165-185 (2022)- [j20]Péter Gács, Ilkka Törmä:
Stable Multi-Level Monotonic Eroders. Theory Comput. Syst. 66(1): 322-353 (2022) - 2021
- [i12]Péter Gács:
Lecture notes on descriptional complexity and randomness. CoRR abs/2105.04704 (2021) - [i11]Péter Gács:
A new version of Toom's proof. CoRR abs/2105.05968 (2021) - [i10]Ilir Çapuni, Péter Gács:
A reliable Turing machine. CoRR abs/2112.02152 (2021) - 2020
- [i9]Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. CoRR abs/2010.10221 (2020)
2010 – 2019
- 2018
- [i8]Péter Gács, Ilkka Törmä:
Stable Multi-Level Monotonic Eroders. CoRR abs/1809.09503 (2018) - 2015
- [j19]Péter Gács:
Clairvoyant embedding in one dimension. Random Struct. Algorithms 47(3): 520-560 (2015) - 2013
- [j18]Ilir Çapuni, Péter Gács:
A Turing Machine Resisting Isolated Bursts Of Faults. Chic. J. Theor. Comput. Sci. 2013 (2013) - 2012
- [c13]Ilir Çapuni, Péter Gács:
A Turing Machine Resisting Isolated Bursts of Faults. SOFSEM 2012: 165-176 - [i7]Ilir Çapuni, Péter Gács:
A Turing Machine Resisting Isolated Bursts Of Faults. CoRR abs/1203.1335 (2012) - 2011
- [j17]Péter Gács, Mathieu Hoyrup, Cristobal Rojas:
Randomness on Computable Probability Spaces - A Dynamical Point of View. Theory Comput. Syst. 48(3): 465-485 (2011) - [j16]Péter Gács:
Clairvoyant scheduling of random walks. Random Struct. Algorithms 39(4): 413-485 (2011) - [i6]Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen:
Algorithmic tests and randomness with respect to a class of measures. CoRR abs/1103.1529 (2011) - 2010
- [i5]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. CoRR abs/1006.3520 (2010)
2000 – 2009
- 2009
- [c12]Péter Gács, Mathieu Hoyrup, Cristobal Rojas:
Randomness on Computable Probability Spaces - A Dynamical Point of View. STACS 2009: 469-480 - 2005
- [j15]Péter Gács:
Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. 341(1-3): 91-137 (2005) - 2004
- [j14]Péter Gács:
Compatible Sequences and a Slow Winkler Percolation. Comb. Probab. Comput. 13(6): 815-856 (2004) - 2003
- [i4]Péter Gács:
Universal randomness test, over a general space. CoRR cs.CC/0312039 (2003) - 2002
- [j13]Péter Gács, John Tromp, Paul M. B. Vitányi:
Correction to "Algorithmic statistics". IEEE Trans. Inf. Theory 48(8): 2427 (2002) - [c11]Péter Gács:
Clairvoyant scheduling of random walks. STOC 2002: 99-108 - 2001
- [j12]Péter Gács, John Tromp, Paul M. B. Vitányi:
Algorithmic statistics. IEEE Trans. Inf. Theory 47(6): 2443-2463 (2001) - [c10]Péter Gács:
Quantum Algorithmic Entropy. CCC 2001: 274-283 - [c9]Péter Gács:
Compatible sequences and a slow Winkler percolation. STOC 2001: 694-703 - [i3]Péter Gács:
Deterministic computations whose history is independent of the order of asynchronous updating. CoRR cs.DC/0101026 (2001) - 2000
- [j11]Péter Gács:
The Clairvoyant Demon Has A Hard Task. Comb. Probab. Comput. 9(5): 421-424 (2000) - [c8]Péter Gács, John Tromp, Paul M. B. Vitányi:
Towards an Algorithmic Statistics. ALT 2000: 41-55 - [i2]Péter Gács:
Reliable Cellular Automata with Self-Organization. CoRR math.PR/0003117 (2000) - [i1]Péter Gács, John Tromp, Paul M. B. Vitányi:
Algorithmic Statistics. CoRR math.PR/0006233 (2000)
1990 – 1999
- 1998
- [j10]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. IEEE Trans. Inf. Theory 44(4): 1407-1423 (1998) - 1997
- [c7]Péter Gács:
Reliable Cellular Automata with Self-Organization. FOCS 1997: 90-99 - 1994
- [j9]Péter Gács, Anna Gál:
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inf. Theory 40(2): 579-583 (1994) - 1993
- [c6]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
- [c5]Aditi Dhagat, Péter Gács, Peter Winkler:
On Playing "Twenty Questions" with a Liar. SODA 1992: 16-22
1980 – 1989
- 1989
- [j8]Péter Gács:
Self-Correcting Two-Dimensional Arrays. Adv. Comput. Res. 5: 223-326 (1989) - 1988
- [j7]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
- [j6]Péter Gács:
Every Sequence Is Reducible to a Random One. Inf. Control. 70(2/3): 186-192 (1986) - [j5]Péter Gács:
Reliable Computation with Cellular Automata. J. Comput. Syst. Sci. 32(1): 15-78 (1986) - 1985
- [c4]Péter Gács, John H. Reif:
A Simple Three-Dimensional Real-Time Reliable Cellular Array. STOC 1985: 388-395 - 1983
- [j4]Péter Gács:
On the Relation between Descriptional Complexity and Algorithmic Probability. Theor. Comput. Sci. 22: 71-93 (1983) - [c3]Péter Gács:
Reliable Computation with Cellular Automata. STOC 1983: 32-41 - 1981
- [j3]Péter Gács, Leonid A. Letvin:
Causal Nets or What is a Deterministic Computation. Inf. Control. 51(1): 1-19 (1981) - [c2]Péter Gács:
On the Relation between Descriptional Complexity and Algorithmic Probability. FOCS 1981: 296-303 - 1980
- [j2]Péter Gács:
Exact Expressions for Some Randomness Tests. Math. Log. Q. 26(25-27): 385-394 (1980)
1970 – 1979
- 1979
- [c1]Péter Gács:
Exact Expressions for some Randomness Tests. Theoretical Computer Science 1979: 124-131 - 1977
- [j1]László Lovász, Péter Gács:
Some Remarks on Generalized Spectra. Math. Log. Q. 23(36): 547-554 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
