Sublinear Algorithms
Sublinear Algorithms is a class of algorithms whose running time grows asymptotically slower than the size of the input, enabling efficient computation on massive datasets by examining only a fraction of the input.
1.3K
Publications
73K
Citations
2.3K
Authors
780
Institutions
Publications per year
2017–2026
266
1.3K
A new approach to variable metric algorithms
R. Fletcher · The Computer Journal · 1970 · 4.1K citations · Full text
Linear pattern matching algorithms
Peter Weiner · 1973 · 1.8K citations
Fast Algorithms for Finding Nearest Common Ancestors
Dov Harel, Robert E. Tarjan · SIAM Journal on Computing · 1984 · 1.1K citations
1–5 of 1.3K
2.3K
Massachusetts Institute of Technology, United States
16 publications · 1.2K citations
15
h-index
15
h-index
13
h-index
11
h-index
11
h-index
1–5 of 2.3K
780
Massachusetts Institute of Technology
Cambridge, United States
28 h-index
70 publications
4.6K citations

Tel Aviv University
Tel Aviv, Israel
26 h-index
78 publications
3K citations
Princeton University
Princeton, United States
24 h-index
60 publications
4.3K citations

Centre National de la Recherche Scientifique
Paris, France
23 h-index
62 publications
2.5K citations
Stanford University
Stanford, United States
22 h-index
62 publications
4.1K citations
AT&T (United States)
Bedminster, United States
19 h-index
23 publications
1.9K citations
University of California, Berkeley
Berkeley, United States
18 h-index
39 publications
1.6K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
16 h-index
25 publications
1.8K citations
1–8 of 780
46 publications · 2.1K citations
27
h-index
33 publications · 4.3K citations
24
h-index
Repository · 75 publications · 3K citations
24
h-index
32 publications · 1.5K citations
22
h-index
42 publications · 1.9K citations
21
h-index
1–5