Algorithmic Lower Bounds
Algorithmic Lower Bounds is a theoretical construct in computer science that establishes the minimum computational resources, such as time or space, required by any algorithm to solve a given problem, thereby providing a fundamental limit against which algorithmic efficiency can be measured.
398
Publications
18.1K
Citations
735
Authors
332
Institutions
Publications per year
2017–2026
86
Parents
398
1–5 of 398
735
10
h-index
8
h-index
5
h-index
5
h-index
5
h-index
1–5 of 735
332
University of California, Berkeley
Berkeley, United States
16 h-index
36 publications
1.6K citations
Stanford University
Stanford, United States
15 h-index
33 publications
6.7K citations
University of Washington
Seattle, United States
12 h-index
22 publications
1.4K citations
Technion – Israel Institute of Technology
Haifa, Israel
12 h-index
20 publications
873 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
19 publications
1.5K citations
Princeton University
Princeton, United States
11 h-index
16 publications
990 citations

Tel Aviv University
Tel Aviv, Israel
11 h-index
18 publications
685 citations
University of Michigan
Ann Arbor, United States
10 h-index
13 publications
634 citations
1–8 of 332
Repository · 38 publications · 996 citations
18
h-index
16 publications · 805 citations
15
h-index
8 publications · 449 citations
8
h-index
Repository · 8 publications · 155 citations
8
h-index
JACM · 8 publications · 512 citations
8
h-index
1–5