Greater-than Function

The "Greater-Than Function" is a Boolean function in communication complexity that, given two n-bit integers x and y held by two parties, returns 1 if x is greater than y and 0 otherwise, serving as a canonical problem for studying the minimum communication required to compute discrete order relations.

6

Publications

176

Citations

14

Authors

13

Institutions

Publications per year

2017–2026

3

Variants

Gt Function

Authors

14

  1. SH
    Stefan Heimersheim

    University of Cambridge, United Kingdom

    1 publications · 32 citations

    1

    h-index

  2. AN
    Augustine N. Mavor-Parker

    1 publications · 32 citations

    1

    h-index

  3. SN
    Shota Nakasato

    Institute of Information Security, Japan

    1 publications · 10 citations

    1

    h-index

  4. MB
    Mark Braverman

    Princeton University, United States

    1 publications · 27 citations

    1

    h-index

  5. AG
    Adrià Garriga-Alonso

    University of Cambridge, United Kingdom

    1 publications · 32 citations

    1

    h-index

1–5 of 14

Venues

  1. Journal of Mathematical Cryptology

    JMC · 1 publications · 17 citations

    1

    h-index

  2. Proceedings on Privacy Enhancing Technologies

    PoPETs · 1 publications · 79 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 32 citations

    1

    h-index

  4. Applied Mathematics and Computation

    1 publications · 11 citations

    1

    h-index

  5. Algorithmica

    1 publications · 27 citations

    1

    h-index

1–5