Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style
icon Submit Paper


RSS-Feed
REPORTS > DETAIL:

Revision(s):

Revision #1 to TR25-059 | 8th May 2025 23:36

Communication complexity of pointer chasing via the fixed-set lemma

Contact
Add Comment
RSS-Feed




Revision #1 Authors: Emanuele Viola
Accepted on: 8th May 2025 23:36
Downloads: 89
Keywords: 


Abstract:

I give a very simple, apparently new proof of a tight communication lower bound for pointer chasing.



Changes to previous version:

Very minor.


Paper:

TR25-059 | 6th May 2025 17:16

Communication complexity of pointer chasing via the fixed-set lemma





TR25-059 Authors: Emanuele Viola
Publication: 6th May 2025 17:16
Downloads: 353
Keywords: 


Abstract:

I give a very simple, apparently new proof of a tight communication lower bound for pointer chasing.


ISSN 1433-8092 | Imprint