@misc{https://doi.org/10.48550/arxiv.1909.10958,
doi = {10.48550/ARXIV.1909.10958},
url = {https://arxiv.org/abs/1909.10958},
author = {Ganor,
Anat and S.,
Karthik C. and Pálvölgyi,
Dömötör},
keywords = {Computational Complexity (cs.CC),
Computational Geometry (cs.CG),
Computer Science and Game Theory (cs.GT),
FOS: Computer and information sciences,
FOS: Computer and information sciences},
title = {On Communication Complexity of Fixed Point Computation},
publisher = {arXiv},
year = {2019},
copyright = {arXiv.org perpetual,
non-exclusive license} }