Lower Bounds for Sorting is a theoretical result in computer science that establishes the minimum asymptotic time complexity required by any comparison-based sorting algorithm to correctly order elements in the worst case.
141
Publications
9.2K
Citations
230
Authors
123
Institutions
Publications per year
2017–2026
5
Parents
Publications
141
The input/output complexity of sorting and related problems
Alok Aggarwal · Communications of the ACM · 1988 · 1.2K citations · Full text
Optimal suffix tree construction with large alphabets
2002 · 452 citations
Andrew Chi-Chih Yao · Journal of the ACM · 1981 · 359 citations · Full text
Computing with Noisy Information
Uriel Feige, Prabhakar Raghavan, David Peleg et al. · SIAM Journal on Computing · 1994 · 314 citations
1–5 of 141
Authors
230
- AB
5
h-index
- SS
4
h-index
- RC
3
h-index
- MT
3
h-index
- VR
3
h-index
1–5 of 230
Institutions
123
Stanford University
Stanford, United States
7 h-index
7 publications
444 citations
IBM (United States)
Armonk, United States
7 h-index
8 publications
1.6K citations
University of Washington
Seattle, United States
6 h-index
8 publications
319 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
8 publications
864 citations
Stony Brook University
Stony Brook, United States
5 h-index
12 publications
334 citations
IBM Research - Almaden
San Jose, United States
4 h-index
7 publications
438 citations
Tel Aviv University
Tel Aviv, Israel
4 h-index
4 publications
165 citations
Princeton University
Princeton, United States
4 h-index
5 publications
380 citations
1–8 of 123
Venues
- SIAM Journal on Computing
15 publications · 1.3K citations
14
h-index
- Journal of the ACM
JACM · 7 publications · 1.1K citations
7
h-index
- IEEE Transactions on Computers
6 publications · 475 citations
6
h-index
- SIAM Journal on Discrete Mathematics
5 publications · 308 citations
5
h-index
- Theoretical Computer Science
5 publications · 353 citations
5
h-index
1–5