Péter Gács - Concepedia

Author

Péter Gács

Boston University ORCID

Also Known As

G\'acs, P\'eter, Gacs ,Peter, Gacs, Peter, Gacs,Peter, Gács, Peter, P Gács, P. Gacs, P. Gács, PETER GÁCS, Peter Gacs

Publications

2.5K

Citations

H-Index

Concepts

All Affiliations

Boston University University of Rochester Massachusetts Institute of Technology Centrum Wiskunde & Informatica Fields Institute for Research in Mathematical Sciences

About

Péter Gács is an author at Boston University specializing in probability theory, engineering, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	14	18	1.7K
2	Education	1	1	14
3	Public Health	1	1	13
4	Social Sciences	1	1	20
5	Applied Physics	1	1	14

Péter Gács

Publications

2.2K

Citations

H-Index

Page 1

	Year	Citations
Information distance Charles H. Bennett, Péter Gács, Ming Li, IEEE Transactions on Information Theory Computational Complexity TheoryEngineeringAutomated ReasoningEntropyOrdinary Computations	1998	497
Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator Rudolf Ahlswede, Péter Gács The Annals of Probability EngineeringInformation TheoryPositive ConstantImprecise ProbabilityMarkov Kernel	1976	172
Reliable computation with cellular automata Péter Gács Journal of Computer and System Sciences EngineeringCellular AutomataFormal MethodsAutomaton NetworkComputational Complexity	1986	153
Uniform test of algorithmic randomness over a general space Péter Gács Theoretical Computer Science EngineeringAlgorithmic Information TheoryVerificationComputational ComplexityProbability Theory	2005	140
Reliable cellular automata with self-organization Péter Gács Pattern FormationComputational ScienceEngineeringSelf-organizing SystemConstant Size	2002	139
Algorithmic statistics Péter Gács, John Tromp, Paul Vitányi IEEE Transactions on Information Theory EngineeringInformation TheoryData ScienceImprecise ProbabilityStatistical Foundation	2001	109
Every sequence is reducible to a random one Péter Gács Information and Control Pseudo-random SequenceProbability TheoryRandomized AlgorithmRandom OnePseudorandom Number Generator	1986	106
Kolmogorov's Contributions to Information Theory and Algorithmic Complexity Thomas M. Cover, Péter Gács, Robert M. Gray The Annals of Probability EngineeringInformation TheoryAbstract ComplexityEntropyComplexity Theory	1989	94
Lower bounds for the complexity of reliable Boolean circuits with noisy gates Péter Gács, Anna Gál IEEE Transactions on Information Theory Circuit ComplexityNoisy GatesEngineeringBoolean FunctionComputational Complexity Theory	1994	80
On the relation between descriptional complexity and algorithmic probability Péter Gács Theoretical Computer Science Algorithmic ProbabilityEngineeringAbstract ComplexityEntropyAutomated Reasoning	1983	71

Page 1