Probabilistic Analysis Of Algorithms
Probabilistic Analysis of Algorithms is the systematic evaluation of algorithmic performance under probabilistic assumptions about inputs or internal operations, distinguishing it from deterministic worst-case or average-case analyses by modeling uncertainty through stochastic processes.
209
Publications
17.9K
Citations
437
Authors
245
Institutions
Publications per year
2017–2026
25
Parents
209
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977 · 892 citations
1–5 of 209
437
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 437
245
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
13 publications
1.9K citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
7 publications
1K citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
8 publications
708 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
7 publications
417 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
11 publications
2.3K citations
University of Oxford
Oxford, United Kingdom
5 h-index
6 publications
497 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
14 publications
384 citations
University of California San Diego
San Diego, United States
4 h-index
4 publications
294 citations
1–8 of 245
7 publications · 2.1K citations
7
h-index
6 publications · 153 citations
6
h-index
Repository · 5 publications · 315 citations
5
h-index
JACM · 4 publications · 2.7K citations
4
h-index
AAP · 4 publications · 287 citations
4
h-index
1–5