Average-case Analysis
Average-Case Analysis is a method in algorithm analysis that characterizes the expected performance of a sorting algorithm under typical input conditions by averaging its behavior over all possible inputs of a given size.
184
Publications
11.5K
Citations
298
Authors
183
Institutions
Publications per year
2017–2026
14
184
An analysis of Bayesian classifiers
Pat Langley, and Wayne Iba, Kevin Thompson · 1992 · 1.1K citations
Smoothed analysis of algorithms
Daniel A. Spielman, Shang‐Hua Teng · Journal of the ACM · 2004 · 838 citations
1–5 of 184
298
10
h-index
Institut national de recherche en sciences et technologies du numérique, France
9 publications · 350 citations
9
h-index
7
h-index
7
h-index
6
h-index
1–5 of 298
183
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
10 publications
1.9K citations
University of California, Irvine
Irvine, United States
7 h-index
9 publications
315 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
14 publications
353 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
11 publications
537 citations
University of California, Berkeley
Berkeley, United States
5 h-index
7 publications
351 citations
AT&T (United States)
Bedminster, United States
5 h-index
8 publications
444 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
6 publications
515 citations
Akamai (United States)
Cambridge, United States
4 h-index
6 publications
1.7K citations
1–8 of 183
7 publications · 219 citations
7
h-index
5 publications · 167 citations
5
h-index
Repository · 5 publications · 128 citations
5
h-index
Repository · 4 publications · 75 citations
4
h-index
4 publications · 60 citations
4
h-index
1–5