Index Function
The Index Function is a total Boolean function in communication complexity where one party holds an input string and the other holds an index, and the function evaluates to the bit of the string at the specified index, capturing the minimal communication required to determine a single distributed input bit.
82
Publications
4.2K
Citations
187
Authors
106
Institutions
Publications per year
2017–2026
13
Parents
82
1–5 of 82
187
3
h-index
3
h-index
3
h-index
3
h-index
Weierstrass Institute for Applied Analysis and Stochastics, Germany
2 publications · 295 citations
2
h-index
1–5 of 187
106

Cornell University
Ithaca, United States
2 h-index
3 publications
70 citations
National University of Singapore
Singapore, Singapore
2 h-index
7 publications
128 citations

The University of Adelaide
Adelaide, Australia
2 h-index
6 publications
738 citations

University of Groningen
Groningen, The Netherlands
2 h-index
2 publications
127 citations

Huazhong University of Science and Technology
Wuhan, China
2 h-index
3 publications
68 citations
South China Normal University
Guangzhou, China
2 h-index
2 publications
64 citations

University of British Columbia
Vancouver, Canada
1 h-index
3 publications
57 citations
Wuhan University of Technology
Wuhan, China
1 h-index
3 publications
60 citations
1–8 of 106
2 publications · 307 citations
2
h-index
2 publications · 82 citations
2
h-index
2 publications · 32 citations
2
h-index
2 publications · 295 citations
2
h-index
2 publications · 86 citations
2
h-index
1–5