Communication complexity of pointer chasing via the fixed-set lemma
Computational Complexity
2025-09-11 v2
Authors:
Emanuele Viola
Abstract
I give a simple proof of a tight communication lower bound for pointer chasing.
Cite
@article{arxiv.2507.08919,
title = {Communication complexity of pointer chasing via the fixed-set lemma},
author = {Emanuele Viola},
journal= {arXiv preprint arXiv:2507.08919},
year = {2025}
}
Related papers
View all related →
Information Theory · Computer Science
Towards a Converse for the Nearest Lattice Point Problem
Vinay A. Vaishampayan
2018-03-28
Data Structures and Algorithms · Computer Science
Tight Bounds for Set Disjointness in the Message Passing Model
Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi +1
2013-05-22
Quantum Physics · Physics
Communication complexity bounds from information causality
Nikolai Miklin, Prabhav Jain, Mariami Gachechiladze
2026-02-12
Computational Complexity · Computer Science
The Corruption Bound, Log Rank, and Communication Complexity
Adi Shraibman
2017-09-25
Quantum Physics · Physics
The one-way communication complexity of the Boolean Hidden Matching Problem
Iordanis Kerenidis, Ran Raz
2007-05-23
Computational Complexity · Computer Science
Superlinear lower bounds for multipass graph processing
Venkatesan Guruswami, Krzysztof Onak
2016-02-10
Computational Complexity · Computer Science
On Communication Complexity of Fixed Point Computation
Anat Ganor, Karthik C. S., Dömötör Pálvölgyi
2022-05-27
Distributed, Parallel, and Cluster Computing · Computer Science
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar +1
2022-05-27
Computational Complexity · Computer Science
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
Joshua Brody, Amit Chakrabarti
2009-02-17
Computational Complexity · Computer Science
Communication Complexity (for Algorithm Designers)
Tim Roughgarden
2015-09-22
Information Theory · Computer Science
A Finite Block Length Achievability Bound for Low Probability of Detection Communication
Nick Letzepis
2018-07-31
Information Theory · Computer Science
Communication via Sensing
Mohammad Kazemi, Tolga M. Duman, Deniz Gündüz
2025-07-29
Computational Complexity · Computer Science
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Amit Chakrabarti, Oded Regev
2012-07-02
Data Structures and Algorithms · Computer Science
Cell-Probe Lower Bounds from Online Communication Complexity
Josh Alman, Joshua R. Wang, Huacheng Yu
2017-11-16
Information Theory · Computer Science
Spectral approach to the communication complexity of multi-party key agreement
Geoffroy Caillat-Grenier, Andrei Romashchenko
2024-04-16
Computational Complexity · Computer Science
Multiparty Communication Complexity of Collision Finding
Paul Beame, Michael Whitmeyer
2024-11-13
Information Theory · Computer Science
On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model
Manuj Mukherjee, Navin Kashyap
2014-01-14
Computational Complexity · Computer Science
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
Jeff M. Phillips, Elad Verbin, Qin Zhang
2015-02-10
Quantum Physics · Physics
Bounds on oblivious multiparty quantum communication complexity
François Le Gall, Daiki Suruga
2023-12-29
Computational Complexity · Computer Science
A direct proof for Lovett's bound on the communication complexity of low rank matrices
Thomas Rothvoss
2014-09-24
Computational Complexity · Computer Science
On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model
Yi Li, Xiaoming Sun, Chengu Wang, David P. Woodruff
2014-07-18
Computational Complexity · Computer Science
A Tight Lower Bound for Compact Set Packing
Huairui Chu
2023-02-21
Computational Complexity · Computer Science
Communication Complexity
Dömötör Pálvölgyi
2010-07-13
Computational Complexity · Computer Science
Streaming Communication Protocols
Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez
2016-09-23
Probability · Mathematics
Low complexity convergence rate bounds for push-sum algorithms with homogeneous correlation structure
Balázs Gerencsér, Miklós Kornyik
2025-07-23