On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Karthik C. S., Pasin Manurangsi. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. In Avrim Blum, editor, 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA. Volume 124 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

This author has not been identified. Look up 'Karthik C. S.' in GoogleThis author has not been identified. Look up 'Pasin Manurangsi' in Google

runs on WebDSL