The communication complexity of pointer chasing: applications of entropy and sampling
From MaRDI portal
Publication:6483601
DOI10.1145/301250.301413MaRDI QIDQ6483601
Siddharth Venkatesh, Stephen J. Ponzio
Publication date: 29 September 2016
Published in: 1345.68133 (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: The communication complexity of pointer chasing: applications of entropy and sampling