Parallel Binary Search

Parallel Binary Search is a parallel algorithmic method that extends the classical binary search paradigm by concurrently evaluating multiple search intervals across distributed or multi-threaded processing units to accelerate the localization of target elements within sorted data structures.

26

Publications

1.1K

Citations

57

Authors

40

Institutions

Publications per year

2017–2026

4

Authors

57

  1. JM
    Jean‐Frédéric Myoupo

    Université de Picardie Jules Verne, France

    2 publications · 28 citations

    2

    h-index

  2. JR
    Jon Russo

    Lockheed Martin (United States), United States

    2 publications · 92 citations

    2

    h-index

  3. MY
    Mei Yang

    University of Nevada, Las Vegas, United States

    2 publications · 85 citations

    2

    h-index

  4. GE
    Gregory E. Coxson

    Lockheed Martin (United States), United States

    2 publications · 92 citations

    2

    h-index

  5. TB
    Trevor Brown

    University of Toronto, Canada

    1 publications · 10 citations

    1

    h-index

1–5 of 57

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 104 citations

    4

    h-index

  2. IEEE Transactions on Computers

    2 publications · 156 citations

    2

    h-index

  3. 1

    h-index

  4. Expert Systems with Applications

    1 publications · 16 citations

    1

    h-index

  5. Digital Scholarship - UNLV (University of Nevada Reno)

    Repository · 1 publications · 37 citations

    1

    h-index

1–5