Complexity of Searching is a theoretical construct in algorithmic complexity that characterizes the computational resources required by search algorithms to locate a target element within a data structure, distinguished by its dependence on input size and organization.
195
Publications
10.9K
Citations
360
Authors
208
Institutions
Publications per year
2017–2026
15
Parents
Publications
195
The complexity of searching a graph
Nimrod Megiddo, S. L. Hakimi, M. R. Garey et al. · Journal of the ACM · 1988 · 371 citations · Full text
1–5 of 195
Authors
360
- AB
4
h-index
- AW
4
h-index
- AA
4
h-index
- MT
3
h-index
- DS
3
h-index
1–5 of 360
Institutions
208
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
15 publications
1K citations
University of California, Los Angeles
Los Angeles, United States
6 h-index
8 publications
406 citations
University of California, Berkeley
Berkeley, United States
6 h-index
8 publications
458 citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
6 publications
638 citations
IBM (United States)
Armonk, United States
4 h-index
5 publications
254 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
4 h-index
4 publications
172 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
4 publications
355 citations
The Ohio State University
Columbus, United States
3 h-index
3 publications
208 citations
1–8 of 208
Venues
- Information Processing Letters
9 publications · 573 citations
9
h-index
- SIAM Journal on Computing
6 publications · 469 citations
6
h-index
- Theoretical Computer Science
6 publications · 175 citations
6
h-index
- Artificial Intelligence
4 publications · 348 citations
4
h-index
- Discrete Applied Mathematics
4 publications · 123 citations
4
h-index
1–5