65 citations · 262 across the 38 of their papers we have counts for
Showing 2017 · cs.CCShow all
2 papers · 2 filters
cs.CC2017
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
Michael Kapralov, Jelani Nelson, Jakub Pachocki +3
In the communication problem (universal relation) [KRW95], Alice and Bob respectively receive with the promise that . The last player to…
cs.CC2017★ 5 cited
Optimal lower bounds for universal relation, samplers, and finding duplicates
Jelani Nelson, Jakub Pachocki, Zhengyu Wang
In the communication problem (universal relation) [KRW95], Alice and Bob respectively receive and in with the promise that . The last pla…