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

Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh. Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 475-486, IEEE Computer Society, 2017. [doi]

Abstract

Abstract is missing.