Linear Search
Linear Search is an algorithmic method for locating a target value within a list or array by sequentially examining each element in linear order until the desired element is found or the end of the structure is reached.
180
Publications
14.8K
Citations
1.3K
Authors
346
Institutions
Publications per year
2017–2026
27
Parents
180
A new approach to variable metric algorithms
R. Fletcher · The Computer Journal · 1970 · 4.1K citations · Full text
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
Marius Muja, David Lowe · 2009 · 2.6K citations · Full text
Packet classification using tuple space search
V. Srinivasan, Subhash Suri, George Varghese · 1999 · 489 citations
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Wenhai Sun, Bing Wang, Ning Cao et al. · 2013 · 335 citations
Fast Matching of Binary Features
Marius Muja, David Lowe · 2012 · 291 citations
1–5 of 180
1.3K
8
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 1.3K
346
Tsinghua University
Beijing, China
6 h-index
33 publications
1.3K citations

Tanta University
Tanta, Egypt
5 h-index
8 publications
195 citations
Columbia University
New York, United States
4 h-index
14 publications
502 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
5 publications
330 citations

Washington University in St. Louis
St Louis, United States
3 h-index
8 publications
2.4K citations
University of California, Riverside
Riverside, United States
3 h-index
5 publications
110 citations

UNSW Sydney
Sydney, Australia
3 h-index
5 publications
263 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
4 publications
565 citations
1–8 of 346
6 publications · 519 citations
6
h-index
5 publications · 118 citations
5
h-index
3 publications · 135 citations
3
h-index
3 publications · 39 citations
3
h-index
2 publications · 170 citations
2
h-index
1–5