4 citations · 5 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023★ 1 cited
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank
Nathaniel Harms, Viktor Zamaraev
We prove a characterization of the structural conditions on matrices of sign-rank 3 and unit disk graphs (UDGs) which permit constant-cost public-coin randomized communication prot…
cs.CC2019
Universal Communication, Universal Graphs, and Graph Labeling
Nathaniel Harms
We introduce a communication model called universal SMP, in which Alice and Bob receive a function belonging to a family , and inputs and . Alice and Bob us…