Query Complexity

Query Complexity is a computational complexity measure that characterizes the minimum number of queries to an input oracle required by an algorithm to compute a function, distinguishing it from other complexity measures by focusing specifically on query efficiency rather than time or space resources.

567

Publications

29.7K

Citations

933

Authors

383

Institutions

Publications per year

2017–2026

130

Authors

933

  1. DR
    Dana Ron

    Tel Aviv University, Israel

    18 publications · 744 citations

    16

    h-index

  2. AA
    Andris Ambainis

    University of Latvia, Latvia

    17 publications · 749 citations

    14

    h-index

  3. EB
    Eli Ben‐Sasson

    Technion – Israel Institute of Technology, Israel

    13 publications · 823 citations

    13

    h-index

  4. RA
    Rocco A. Servedio

    Columbia University, United States

    13 publications · 502 citations

    11

    h-index

  5. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    11 publications · 454 citations

    11

    h-index

1–5 of 933

Venues

  1. SIAM Journal on Computing

    28 publications · 2.4K citations

    22

    h-index

  2. arXiv (Cornell University)

    Repository · 56 publications · 1.4K citations

    22

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 16 publications · 294 citations

    13

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 11 publications · 495 citations

    11

    h-index

  5. ArXiv.org

    Repository · 12 publications · 231 citations

    11

    h-index

1–5