This is a preview of subscription content, log in via an institution to check access.
References
M.J. Fischer and M.S. Paterson, “The fast skew-closure algorithm,” L'Enseignement Mathématique XXVI 3–4, 1980, 345–360.
N. Pippenger, “Fast simulation of combinational logic networks by machines without random-access storage,” Proc. 15th Allerton Conf. on Communication, Control and Computing, 1977, 25–33.
M.J. Fischer and M.S. Paterson, “Fishspear: a priority queue algorithm,” Proc. 25th Ann. IEEE Symp. Foundations of Computer Science, 1984, 375–386. An improved version is to be published in JACM in 1993.
E.M. Fischer, “Priority queues and tape based machines,” Yale University Computer Science Senior Project, 1989.
T. Watts, “Implementation and testing of a new priority queue algorithm,” University of Warwick Final Year Computer Science Project, 1993, 101pp.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paterson, M. (1993). Evolution of an algorithm. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_65
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive