Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams

Article Details
Title:	Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams
Article URLs:	https://doi.org/10.1109/FOCS.2017.50 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.50
Alternative Article URLs:
Authors:	Michael Kapralov	EPFL
	Jelani Nelson	Harvard University
	Jakub Pachocki	OpenAI
	Zhengyu Wang	Harvard University
	David P. Woodruff	Carnegie Mellon University
	Mobin Yahyazadeh	Sharif University of Technology
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/KapralovNPWWY17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017