5 citations · 21 across the 18 of their papers we have counts for
1 paper · 1 filter
Orr Fischer, Rotem Oshman, Adi Rosen +1
Pointer-chasing is a central problem in two-party communication complexity: given input size n and a parameter k, the two players Alice and Bob are given functions $N_A, N_B: […