On the Communication Complexity of Approximate Fixed Points

Article Details
Title:	On the Communication Complexity of Approximate Fixed Points
Article URLs:	https://doi.org/10.1109/FOCS.2016.32 http://doi.ieeecomputersociety.org/10.1109/FOCS.2016.32
Alternative Article URLs:
Authors:	Tim Roughgarden	Stanford University, Department of Computer Science
Authors:	Omri Weinstein	New York University, Department of Computer Science
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/focs/RoughgardenW16
Author Comments:

IEEE Foundations of Computer Science, FOCS 2016