Bibliography
Agarwal, Saurabh and Gudmund Skovbjerg Frandsen. 2004. Binary GCD like algorithms for some complex quadratic rings. In Algorithmic Number Theory, 6th International Symposium, Burlington, VT, USA, June 13–18, 2004. Proceedings, ed. Duncan A. Buell, vol. 3076 of Lecture Notes in Computer Science, pages 57–71. Springer.
Bentley, Jon. 1984. Programming pearls. Communications of the ACM 27(4): 287–291.
Bolzano, Bernard. 1817. Rein analytischer Beweis des Lehrsatzes, daß zwischen je zwey Werthen, die ein entgegengesetztes Resultat gewhren, wenigstens eine reelle Wurzel der Gleichung liege. Prague: Gottlieb Haase.
Boute, Raymond T. 1992. The Euclidean definition of the functions div and mod. ACM Transactions on Programming Languages and ...
Get Elements of Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
