Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson. Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. In Rasmus Pagh, Suresh Venkatasubramanian, editors, Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018. pages 87-96, SIAM, 2018. [doi]

This author has not been identified. Look up 'Juan José Besa Vial' in GoogleThis author has not been identified. Look up 'William E. Devanny' in GoogleThis author has not been identified. Look up 'David Eppstein' in GoogleThis author has not been identified. Look up 'Michael T. Goodrich' in GoogleThis author has not been identified. Look up 'Timothy Johnson' in Google

runs on WebDSL