Best-case Analysis
Best-Case Analysis is a performance analysis technique in the study of sorting algorithms that characterizes the minimum computational effort required under the most favorable input conditions.
59
Publications
3.9K
Citations
206
Authors
152
Institutions
Publications per year
2017–2026
19
Variants
Best Case Analysis
Parents
59
Worst and best-case coverage in sensor networks
Seapahn Megerian, Farinaz Koushanfar, M. Potkonjak et al. · IEEE Transactions on Mobile Computing · 2004 · 330 citations
Is finding security holes a good idea?
Eric Rescorla · IEEE Security & Privacy · 2005 · 272 citations
1–5 of 59
206
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 206
152
University of Wisconsin–Madison
Madison, United States
3 h-index
3 publications
721 citations

University of Ottawa
Ottawa, Canada
2 h-index
2 publications
102 citations

University of Minnesota
Minneapolis, United States
2 h-index
6 publications
159 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
3 publications
33 citations
University of Oxford
Oxford, United Kingdom
2 h-index
2 publications
64 citations
London School of Hygiene & Tropical Medicine
London, United Kingdom
2 h-index
4 publications
327 citations
Yale University
New Haven, United States
2 h-index
5 publications
242 citations
Max Planck Society
Munich, Germany
2 h-index
2 publications
141 citations
1–8 of 152
3 publications · 446 citations
3
h-index
2 publications · 65 citations
2
h-index
IJED · 1 publications · 44 citations
1
h-index
1 publications · 49 citations
1
h-index
QJE · 1 publications · 225 citations
1
h-index
1–5