Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.