- Freely using the textbook by Cormen, Leiserson, Rivest, Stein Computer Science Department
- Compatible sequences and a slow Winkler percolation
- Algebraic algorithms Freely using the textbook: Victor Shoup's "A Computational
- Advanced algorithms Freely using the textbook by Cormen, Leiserson, Rivest, Stein
- Causal Nets What Is a Deterministic Computation?
- Lecture notes on descriptional complexity and randomness
- Constructive law of large numbers with application to countable Markov chains
- COMPATIBLE SEQUENCES AND A SLOW WINKLER PERCOLATION
- Reliably computing cellular automata Boston University
- THE ANGEL WINS PETER GACS
- Randomness, complexity and information in metric Peter Gacs
- A constructive law of large numbers with application to countable Markov chains
- Noname manuscript No. (will be inserted by the editor)
- Clairvoyant scheduling of random walks Peter Gacs
- QUANTUM ALGORITHMIC ENTROPY PETER G ACS
- THE CLAIRVOYANT DEMON HAS A HARD TASK PETER G ACS
- Deterministic computations whose history is independent
- A NEW VERSION OF TOOM'S PROOF PETER G ACS
- INFORMATION DISTANCE CHARLES H. BENNETT, PETER G ACS, MING LI, PAUL M.B. VIT ANYI, AND WOJCIECH H. ZUREK
- Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
- Expanded and improved proof of the relation between description complexity and algorithmic
- Zeitschr. t.maJ;h. Logik und Grundlagen d. Math. Bd. 26, S. 385-394 (1980)
- KOMPLEXITXT UND ZUFXLLIGKEIT Inaugural -Dissertation
- Algorithmic randomness test for a class of Computer Science Department
- Combinatorial Structures Freely using the textbooks by Lovsz-Pelikn-Vesztergombi and
- Elements of the theory of computing: lectures Peter Gacs
- Computational complexity lectures Peter Gacs
- Approximation algorithms Freely using Vazirani's book
- Explicit lossless expanders Understanding the construction of Capalbo, Reingold, Vadhan,
- The Ergodic Theorem and randomness Department of Computer Science
- Reprinted from INFORMATION ANU CONTROL All Rights Reserved by Academic Press, New York and London
- Megbizhato szamolas Gacs Peter
- Clairvoyant scheduling of random walks
- Reliable Cellular Automata with SelfOrganization Peter Gacs 1
- Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator Author(s): Rudolf Ahlswede and Peter Gacs
- Raymond J. Solomonoff 1926-2009 Peter Gacs
- THE BOLTZMANN ENTROPY AND RANDOMNESS TESTS PETER G ACS
- Probability in computing Peter Gacs
- On Playing "Twenty Questions" with a Liar BUCS Tech Report #91-006
- Algorithmic Statistics Peter Gacs, John T. Tromp, and Paul M.B. Vitanyi
- RELIABLE CELLULAR AUTOMATA WITH SELF-ORGANIZATION PETER G ACS
- The Angel wins Peter Gacs
- Reliable computation Peter Gacs
- A TOOM RULE THAT INCREASES THE THICKNESS OF SETS PETER G ACS
- PUBLICATIONS OF PETER G ACS [1] Peter Gacs, Packing of convex sets in the plane with a large number of neighbors, Acta Sci. Hung. 23 (1972), 383388.
- Theory of computation Boston University
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES 32, 15-78 (1986) Reliable Computation with Cellular Automata
- BOSTON UNIVERSITY GRADUATE SCHOOL OF ARTS AND SCIENCES
