Binary Search

Binary Search is a searching algorithm that, by repeatedly dividing the search interval in half and operating on a sorted array, distinguishes itself from other search methods through its logarithmic time complexity and comparison-based elimination of half the remaining elements at each step.

838

Publications

47.6K

Citations

2.2K

Authors

858

Institutions

Publications per year

2017–2026

233

Authors

2.2K

  1. JP
    Jan P. Allebach

    Purdue University West Lafayette, United States

    20 publications · 1.5K citations

    17

    h-index

  2. HL
    Hyesook Lim

    Ewha Womans University, South Korea

    8 publications · 220 citations

    8

    h-index

  3. RP
    Renato Paes Leme

    Google (United States), United States

    6 publications · 273 citations

    6

    h-index

  4. TA
    Tor Arne Johansen

    Norwegian University of Science and Technology, Norway

    6 publications · 532 citations

    6

    h-index

  5. SS
    Sartaj Sahni

    University of Florida, United States

    6 publications · 112 citations

    6

    h-index

1–5 of 2.2K

Venues

  1. IEEE Transactions on Image Processing

    16 publications · 695 citations

    14

    h-index

  2. Communications of the ACM

    13 publications · 8.5K citations

    13

    h-index

  3. arXiv (Cornell University)

    Repository · 18 publications · 475 citations

    13

    h-index

  4. SIAM Journal on Computing

    11 publications · 735 citations

    11

    h-index

  5. IEEE Transactions on Computers

    10 publications · 306 citations

    10

    h-index

1–5