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
Parents
6
A Discrepancy Lower Bound for Information Complexity
Mark Braverman, Omri Weinstein · Algorithmica · 2015 · 27 citations
One-round secure comparison of integers
Blake Ian F., Kolesnikov Vladimir · Journal of Mathematical Cryptology · 2009 · 17 citations · Full text
1–5 of 6
14
1
h-index
1 publications · 32 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 14
13
Alcatel Lucent (Germany)
Stuttgart, Germany
1 h-index
1 publications
17 citations

Université de Perpignan
Perpignan, France
1 h-index
1 publications
79 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
17 citations

York University
Toronto, Canada
1 h-index
1 publications
17 citations
Imec the Netherlands
Eindhoven, Netherlands
1 h-index
1 publications
79 citations

Université de Montpellier
Montpellier, France
1 h-index
1 publications
79 citations
Princeton University
Princeton, United States
1 h-index
1 publications
27 citations
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
1 publications
27 citations
1–8 of 13
JMC · 1 publications · 17 citations
1
h-index
PoPETs · 1 publications · 79 citations
1
h-index
Repository · 1 publications · 32 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 27 citations
1
h-index
1–5