Searching Algorithms

Searching Algorithms is a class of computational methods within algorithm design that systematically locates a specific element or value within a data structure by determining its presence, position, or absence through a defined sequence of comparisons or evaluations, distinguished from other algorithmic approaches by its focus on retrieval efficiency and search space organization.

6K

Publications

468.3K

Citations

11.3K

Authors

2.6K

Institutions

Publications per year

2017–2026

1.1K

Authors

11.3K

  1. GN
    Gonzalo Navarro

    University of Chile, Chile

    38 publications · 2.4K citations

    29

    h-index

  2. AF
    Ariel Felner

    Ben-Gurion University of the Negev, Israel

    42 publications · 2K citations

    25

    h-index

  3. XL
    Xuemin Lin

    UNSW Sydney, Australia

    34 publications · 2.8K citations

    24

    h-index

  4. YT
    Yufei Tao

    Chinese University of Hong Kong, Hong Kong SAR China

    26 publications · 3.9K citations

    23

    h-index

  5. JX
    Jeffrey Xu Yu

    Chinese University of Hong Kong, Hong Kong SAR China

    27 publications · 2K citations

    21

    h-index

1–5 of 11.3K

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 93 publications · 6.4K citations

    45

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 116 publications · 5.8K citations

    43

    h-index

  3. SIAM Journal on Computing

    72 publications · 17.9K citations

    43

    h-index

  4. Journal of the ACM

    JACM · 44 publications · 11.3K citations

    39

    h-index

  5. Communications of the ACM

    62 publications · 21.6K citations

    38

    h-index

1–5