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

Authors

1.3K

  1. AB
    Anatole Beck

    University of Wisconsin–Madison, United States

    8 publications · 581 citations

    8

    h-index

  2. FM
    Friedhelm Meyer auf der Heide

    Paderborn University, Germany

    3 publications · 124 citations

    3

    h-index

  3. MA
    Mohamed Abd Allah El‐Hadidy

    Tanta University, Egypt

    3 publications · 69 citations

    3

    h-index

  4. MB
    Micah Beck

    University of Tennessee at Knoxville, United States

    3 publications · 93 citations

    3

    h-index

  5. MM
    Marius Muja

    University of British Columbia, Canada

    2 publications · 2.9K citations

    2

    h-index

1–5 of 1.3K

Venues

  1. Israel Journal of Mathematics

    6 publications · 519 citations

    6

    h-index

  2. Communications of the ACM

    5 publications · 118 citations

    5

    h-index

  3. IEEE Transactions on Signal Processing

    3 publications · 135 citations

    3

    h-index

  4. 3

    h-index

  5. China Communications

    2 publications · 170 citations

    2

    h-index

1–5