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 Systems 14(2): 127–144.

Boyer, Robert S. and J. Strother Moore. 1977. A fast string searching algorithm. Communications of the ACM 20(10): 762–772.

Brent, Richard P. 1980. An improved Monte Carlo factorization algorithm. BIT 20: 176–184.

Cauchy, Augustin-Louis. 1821. Cours D’Analyse de L’Ecole Royale Polytechnique. L’Académie des Sciences.

Chrystal, G. 1904. Algebra: An Elementary Text-Book. Parts I and II. Adam and Charles Black, 1904. Reprint, AMS Chelsea Publishing, 1964.

Dehnert, James C. and Alexander A. Stepanov. 2000. Fundamentals of generic programming. In Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April/May 1998. Selected Papers, eds. Mehdi Jazayeri, Rüdiger G. K. Loos, and David R. Musser, vol. 1766 of Lecture Notes in Computer Science, pages 1–11. Springer.

Diaconis, Persi and Paul Erdös. 2004. On the distribution of the greatest common divisor. In A Festschrift for Herman Rubin, ed. Anirban DasGupta, vol. 45 of Lecture Notes—Monograph Series, pages 56–61. Institute of Mathematical Statistics.

Dijkstra, Edsger W. 1972. Notes on structured programming. In Structured Programming, eds. O.-J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, pages 1–82. London and New York: Academic Press.

Dirichlet, P. G. L. 1863. Forlesungen über Zahlentheorie. Vieweg und Sohn, 1863. With supplements by Richard Dedekind. English translation by John Stillwell. Lectures on Number Theory, American Mathematical Society and London Mathematical Society, 1999.

Dudziski, Krzysztof and Andrzej Dydek. 1981. On a stable minimum storage merging algorithm. Information Processing Letters 12(1): 5–8.

Dwyer, Barry. 1974. Simple algorithms for traversing a tree without an auxiliary stack. Information Processing Letters 2: 143–145.

Fiduccia, Charles M. 1985. An efficient formula for linear recurrences. SIAM Journal on Computing 14(1): 106–112.

Fletcher, William and Roland Silver. 1966. Algorithm 284: Interchange of two blocks of data. Communications of the ACM 9(5): 326.

Floyd, Robert W. and Donald E. Knuth. 1990. Addition Machines. SIAM Journal on Computing 19(2): 329–340.

Frobenius, Georg Ferdinand. 1895. Über endliche gruppen. In Sitzungesberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin, Phys.-math. Classe, pages 163–194. Berlin.

Grassmann, Hermann Günther. 1861. Lehrbuch der Mathematik für höhere Lehranstalten, vol. 1. Berlin: Enslin.

Gries, David and Harlan Mills. 1981. Swapping sections. Tech. Rep. 81–452, Department of Computer Science, Cornell University.

Heath, Sir Thomas L. 1925. The Thirteen Books of Euclid’s Elements. Cambridge University Press, 1925. Reprint, Dover, 1956.

Heath, T. L. 1912. The Works of Archimedes. Cambridge University Press, 1912. Reprint, Dover, 2002.

Hoare, C. A. R. 1962. Quicksort. The Computer Journal 5(1): 10–16.

Iverson, Kenneth. 1962. A Programming Language. Wiley.

Knuth, Donald E. 1997. The Art of Computer Programming Volume 2: Seminumerical Algorithms (3rd edition). Reading, MA: Addison-Wesley.

Knuth, Donald E. 1998. The Art of Computer Programming Volume 3: Sorting and Searching (2nd edition). Reading, MA: Addison Wesley.

Knuth, Donald E. 2005. The Art of Computer Programming Volume 1, fascicle 1: MMIX: A RISC Computer for the New Millenium. Boston: Addison-Wesley.

Knuth, Donald E., J. Morris, and V. Pratt. 1977. Fast pattern matching in strings. SIAM Journal on Computing 6: 323–350.

Kwak, Jin Ho and Sungpyo Hong. 2004. Linear Algebra. Birkhäuser.

Lagrange, J.-L. 1795. Leçons élémentaires sur les mathématiques, données à l’école normale en 1795. 1795. Reprinted: Oeuvres, vol. VII, pages 181–288. Paris: Gauthier-Villars, 1877.

Levy, Leon S. 1982. An improved list-searching algorithm. Information Processing Letters 15(1): 43–45.

Lindstrom, Gary. 1973. Scanning list structures without stack or tag bits. Information Processing Letters 2: 47–51.

Mauchly, John W. 1946. Sorting and collating. In Theory and Techniques for Design of Electronic Digital Computers. Moore School of Electrical Engineering, University of Pennsylvania, 1946. Reprinted in: The Moore School Lectures, eds. Martin Campbell-Kelly and Michael R. Williams, pages 271–287. Cambridge, Massachusetts: MIT Press, 1985.

McCarthy, D. P. 1986. Effect of improved multiplication efficiency on exponentation algorithms derived from addition chains. Mathematics of Computation 46(174): 603–608.

Miller, J. C. P. and D. J. Spencer Brown. 1966. An algorithm for evaluation of remote terms in a linear recurrence sequence. The Computer Journal 9(2): 188–190.

Morris, Joseph M. 1979. Traversing binary trees simply and cheaply. Information Processing Letters 9(5): 197–200.

Musser, David R. 1975. Multivariate polynomial factorization. Journal of the ACM 22(2): 291–308.

Musser, David R. and Gor V. Nishanov. 1997. A fast generic sequence matching algorithm. Tech. Rep., Computer Science Department, Rensselaer Polytechnic Institute. Archived as http://arxiv.org/abs/0810.0264v1.

Patterson, David A. and John L. Hennessy. 2007. Computer Organization and Design: The Hardware/Software Interface (3rd revised edition). Morgan Kaufmann.

Peano, Giuseppe. 1908. Formulario Mathematico, Editio V. Torino: Fratres Bocca Editores, 1908. Reprinted: Roma: Edizioni Cremonese, 1960.

Rivest, R., A. Shamir, and L. Adleman. 1978. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2): 120–126.

Robins, Gay and Charles Shute. 1987. The Rhind Mathematical Papyrus. British Museum Publications.

Robson, J. M. 1973. An improved algorithm for traversing binary trees without auxiliary stack. Information Processing Letters 2: 12–14.

Schorr, H. and W. M. Waite. 1967. An efficient and machine-independent procedure for garbage collection in various list structures. Communications of the ACM 10(8): 501–506.

Sedgewick, R. T., T. G. Szymanski, and A. C. Yao. 1979. The complexity of finding cycles in periodic functions. In Proc. 11th SIGACT Meeting, ed. Michael J. Fischer, pages 376–390.

Sigler, Laurence E. 2002. Fibonacci’s Liber Abaci: Leonardo Pisano’s Book of Calculation. Springer-Verlag.

Stein, Josef. 1967. Computational problems associated with Racah algebra. J. Comput. Phys. 1: 397–405.

Stepanov, Alexander and Meng Lee. 1995. The Standard Template Library. Technical Report 95–11(R.1), HP Laboratories.

Stroustrup, Bjarne. 2000. The C++ Programming Language: Special Edition (3rd edition). Boston: Addison-Wesley.

Tarjan, Robert Endre. 1983. Data Structures and Network Algorithms. SIAM.

Tarjan, Robert Endre. 1985. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods 6(2): 306–318.

Thompson, Ken and Dennis Ritchie. 1974. The UNIX time-sharing system. Communications of the ACM 17(7): 365–375.

van der Waerden, Bartel Leenert. 1930. Moderne Algebra Erster Teil. Julius Springer, 1930. English translation by Fred Blum. Modern Algebra, New York: Frederic Ungar Publishing, 1949.

Weilert, André. 2000. (1+i)-ary GCD computation in [i] as an analogue of the binary GCD algorithm. J. Symb. Comput. 30(5): 605–617.

Wirth, Niklaus. 1977. What can we do about the unnecessary diversity of notation for syntactic definitions? Communications of the ACM 20(11): 822–823.