Markovian Hitters and the Complexity of Blind Rendezvous

Article Details
Title:	Markovian Hitters and the Complexity of Blind Rendezvous
Article URLs:	https://doi.org/10.1137/1.9781611974331.ch45 http://dl.acm.org/citation.cfm?id=2884480
Alternative Article URLs:
Authors:	Sixia Chen	Central Connecticut State University
	Matthew Dippel	Northeastern University
	Alexander Russell	University of Connecticut
	Abhishek Samanta	Google, Inc
	Ravi Sundaram	Northeastern University
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1117427
DBLP Key:	conf/soda/ChenDRSS16
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2016