-
Alpaydin, Ethem. 2016. Machine Learning.
Cambridge, MA: MIT Press.
-
Bachrach, Ran, Ran El-Yaniv, and Martin
Reinstädtler. 2002. “On the Competitive Theory and
Practice of Online List Accessing Algorithms.” Algorithmica 32 (2):
201–245.
-
Barabási, Albert-László, and Pósfai Márton.
2016. Network
Science. Cambridge: Cambridge University
Press.
-
Bar-Noy, Amotz, Rajeev Motwani, and Joseph
Naor. 1992. “The Greedy Algorithm Is Optimal for Online
Edge Coloring.” Information
Processing Letters 44 (5):
251–253.
-
Bearden, J. Neil. 2006. “A New Secretary
Problem with Rank-Based Selection and Cardinal Payoffs.”
Journal of Mathematical
Psychology
50:58-59.
-
Benjamin, Arthur, Gary Chartrand, and Ping
Zhang. 2015. The Fascinating
World of Graph Theory. Princeton, NJ:
Princeton University Press.
-
Bentley, Jon. 2000. Programming Pearls. 2nd ed. Boston:
Addison-Wesley.
-
Berry, Michael W., and Murray Browne. 2005.
Understanding Text Engines:
Mathematical Modeling and Text Retrieval.
2nd ed. Philadelphia: Society for Industrial and Applied
Mathematics.
-
Biggs, Norman L., E. Keith Lloyd, and Robin
J. Wilson. 1986. Graph Theory,
1736–1936. Oxford: Clarendon
Press.
-
-
-
Brin, Sergey, and Lawrence Page. 1998. “The
Anatomy of a Large-Scale Hypertextual Web Search
Engine.” Computer Networks and
ISDN Systems 30 (1–7):
107–117.
-
Bryan, Kurt, and Tanya Leise. 2006. “The
$25,000,000,000 Eigenvector: The Linear Algebra
behind Google.” SIAM
Review 48 (3):
569–581.
-
Charniak, Eugene. 2018. Introduction to Deep
Learning. Cambridge, MA: MIT
Press.
-
Compeau, Phillip E. C., Pavel A. Pevzner,
and Glenn Tesler. 2011. “How to Apply de Bruijn Graphs
to Genome Assembly.” Nature
Biotechnology 29 (11):
987–991.
-
Copeland, B. Jack, and Oron Shagrir. 2019.
“The Church-Turing Thesis: Logical Limit or Breachable
Barrier?” Communications of the
ACM 62 (1): 66–74.
-
Demaine, Erik D., Francisco Gomez-Martin,
Henk Meijer, David Rappaport, Perouz Taslakian, Godfried
T. Toussaint, Terry Winograd, and David R. Wood. 2009.
“The Distance Geometry of Music.” Computational Geometry: Theory and
Applications 42 (5):
429–454.
-
Dyson, George. 2012. Turing’s Cathedral: The Origins of the
Digital Universe. New York: Vintage
Books.
-
Elsken, Thomas, Jan Hendrik Metzen, and
Frank Hutter. 2018. “Neural Architecture Search: A
Survey.” ArXiv, Cornell University. August 16.
http://arxiv.org/abs/1808.05377.
-
Eulerho, Leonhardo. 1736. “Solutio
Problematis Ad Geometrian Situs Pertinentis.” Commetarii Academiae Scientiarum
Imperialis Petropolitanae
8:128–140.
-
Ferguson, Thomas S. 1989. “Who Solved the
Secretary Problem?” Statistical
Science 4 (3):
282–289.
-
Fleischner, Herbert, ed. 1991. “Chapter X
Algorithms for Eulerian Trails and Cycle Decompositions,
Maze Search Algorithms.” In Eulerian Graphs and Related Topics,
50:X.1–X.34. Amsterdam: Elsevier.
-
Franceschet, Massimo. 2011. “PageRank:
Standing on the Shoulders of Giants.” Communications of the ACM
54 (6): 92–101.
-
Friend, Edward H. 1956. “Sorting on
Electronic Computer Systems.” Journal of the ACM 3 (3):
134–168.
-
Goodfellow, Ian, Yoshua Bengio, and Aaron
Courville. 2016. Deep
Learning. Cambridge, MA: MIT
Press.
-
Hand, David J. 2014. The Improbability Principle: Why
Coincidences, Miracles, and Rare Events Happen Every
Day. New York: Farrar, Straus and
Giroux.
-
Hawking, Stephen. 1988. A Brief History of Time.
New York: Bantam Books.
-
Hierholzer, Carl. 1873. “Ueber die
Möglichkeit, einen Linienzug ohne Wiederholung und ohne
Unterbrechung zu Umfahren.” Mathematische Annalen 6 (1):
30–32.
-
Hoare, C. A. R. 1961a. “Algorithm 63:
Partition.” Communications of
the ACM 4 (7):
321.
-
Hoare, C. A. R. 1961b. “Algorithm 64:
Quicksort.” Communications of
the ACM 4 (7):
321.
-
Hoare, C. A. R. 1961c. “Algorithm 65:
Find.” Communications of the
ACM 4 (7):
321–322.
-
Hodges, Andrew. 1983. Alan Turing: The Enigma.
New York: Simon and Schuster.
-
Hollerith, Herman. 1894. “The Electrical
Tabulating Machine.” Journal of
the Royal Statistical Society 57 (4):
678–689.
-
Hopcroft, John E., Rajeev Motwani, and
Jeffrey D. Ullman. 2001. Introduction to Automata Theory, Languages, and
Computation. 2nd ed. Boston:
Addison-Wesley.
-
Iwashita, Hiroaki, Yoshio Nakazawa, Jun
Kawahara, Takeaki Uno, and Shin-ichi Minato. 2013.
“Efficient Computation of the Number of Paths in a Grid
Graph with Minimal Perfect Hash Functions.” Technical
Report TCS-TR- A-13-64. Division of Computer Science,
Graduate School of Information Science, Technology,
Hokkaido University.
-
Kekulé, August. 1872. “Ueber Einige
Condensationsprodukte Des Aldehyds.” Annalen der Chemie und
Pharmacie 162 (1):
77–124.
-
Kleinberg, Jon M. 1998. “Authoritative
Sources in a Hyperlinked Environment.” In Proceedings of the Ninth Annual
ACM-SIAM Symposium on Discrete
Algorithms, 668–677. Philadelphia: Society
for Industrial and Applied
Mathematics.
-
Kleinberg, Jon M. 1999. “Authoritative
Sources in a Hyperlinked Environment.” Journal of the ACM 46 (5):
604–632.
-
Knuth, Donald E. 1970. “Von Neumann’s First
Computer Program.” Computing
Surveys 2 (4):
247–261.
-
Knuth, Donald E. 1972. “Ancient Babylonian
Algorithms.” Communications of
the ACM 15 (7):
671–677.
-
Knuth, Donald E. 1997. The Art of Computer Programming,
Volume 1: Fundamental Algorithms. 3rd ed.
Reading, MA: Addison-Wesley.
-
Knuth, Donald E. 1998. The Art of Computer Programming,
Volume 3: Sorting and Searching. 2nd ed.
Reading, MA: Addison-Wesley.
-
Knuth, Donald E. 2011. The Art of Computer Programming,
Volume 4A: Combinatorial Algorithms, Part
1. Upper Saddle River, NJ:
Addison-Wesley.
-
Langville, Amy N., and Carl D. Meyer. 2006.
Google’s PageRank and
Beyond: The Science of Search Engine
Rankings. Princeton, NJ: Princeton
University Press.
-
LeCun, Yann, Yoshua Bengio, and Geoffrey
Hinton. 2015. “Deep Learning.” Nature 521 (7553):
436–444.
-
Lewis, Harry R., and Christos H.
Papadimitriou. 1998. Elements of
the Theory of Computation. 2nd ed. Upper
Saddle River, NJ: Prentice Hall.
-
McCabe, John. 1965. “On Serial Files with
Relocatable Records.” Operations
Research 13 (4):
609–618.
-
McCulloch, Warren S., and Walter Pitts.
1943. “A Logical Calculus of the Ideas Immanent in
Nervous Activity.” Bulletin of
Mathematical Biophysics 5 (4):
115–133.
-
Merton, Robert K. 1968. “The Matthew Effect
in Science.” Science
159 (3810): 56–63.
-
Minsky, Marvin, and Seymour Papert. 1969.
Perceptrons: An Introduction
to Computational Geometry. Cambridge, MA:
MIT Press.
-
Misa, Thomas J., and Philip L. Frana. 2010.
“An Interview with Edsger W. Dijkstra.” Communications of the ACM
53 (8): 41–47.
-
Mitzenmacher, Michael, and Eli Upfal. 2017.
Probability and Computing:
Randomization and Probabilistic Techniques in
Algorithms and Data Analysis. 2nd ed.
Cambridge: Cambridge University
Press.
-
Parker, Matt. 2014. Things to Make and Do in the Fourth Dimension: A
Mathematician’s Journey through Narcissistic
Numbers, Optimal Dating Algorithms, at Least Two
Kinds of Infinity, and More. London:
Penguin Books.
-
Pattis, Richard E. 1988. “Textbook Errors
in Binary Searching.” SIGCSE
Bulletin 20 (1):
190–194.
-
Pevzner, Pavel A., Haixu Tang, and Michael
S. Waterman. 2001. “An Eulerian Path Approach to DNA
Fragment Assembly.” Proceedings
of the National Academy of Sciences 98
(17): 9748–9753.
-
Pinker, Steven. 2018. Enlightenment Now: The Case for
Reason, Science, Humanism, and Progress.
New York: Viking Press.
-
Rivest, Ronald. 1976. “On Self-Organizing
Sequential Search Heuristics.” Communications of the ACM 19 (2):
63–67.
-
Rosenblatt, Frank. 1957. “The Perceptron: A
Perceiving and Recognizing Automaton.” Report 85-460-1.
Cornell Aeronautical Laboratory.
-
Rumelhart, David E., Geoffrey E. Hinton,
and Ronald J. Williams. 1986. “Learning Representations
by Back-Propagating Errors.” Nature 323 (6088):
533–536.
-
Silver, David, Aja Huang, Chris J.
Maddison, Arthur Guez, Laurent Sifre, George van den
Driessche, Julian Schrittwieser, et al. 2016. “Mastering
the Game of Go with Deep Neural Networks and Tree
Search.” Nature 529
(7587): 484–489.
-
Silver, David, Julian Schrittwieser, Karen
Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez,
Thomas Hubert, et al. 2017. “Mastering the Game of Go
without Human Knowledge.” Nature 550 (7676):
354–359.
-
Strogatz, Steven. 2012. The Joy of x: A Guided Tour of Math,
from One to Infinity. New York: Houghton
Mifflin Harcourt.
-
Taleb, Nassim Nicholas. 2007. The Black Swan: The Impact of the
Highly Improbable. New York: Random
House.
-
Toussaint, Godfried T. 2005. “The Euclidean
Algorithm Generates Traditional Musical Rhythms.” In
Renaissance Banff:
Mathematics, Music, Art, Culture, edited
by Reza Sarhangi and Robert V. Moody, 47–56. Winfield,
KS: Bridges Conference, Southwestern
College.
-
Toussaint, Godfried T. 2013. The Geometry of Musical Rhythm: What
Makes a “Good” Rhythm Good? Boca Raton,
FL: CRC Press.
-
Turing, Alan M. 1937. “On Computable
Numbers, with an Application to the
Entscheidungsproblem.” Proceedings of the London Mathematical
Society S2–42:
230–265.
-
Turing, Alan M. 1938. “On Computable
Numbers, with an Application to the
Entscheidungsproblem. A Correction.” Proceedings of the London Mathematical
Society S2–43:
544–546.
-
Tyson, Neil deGrasse, Michael Abram
Strauss, and Richard J. Gott. 2016. Welcome to the Universe: An
Astrophysical Tour. Princeton, NJ:
Princeton University Press.
-
West, Geoffrey. 2017. Scale: The Universal Laws of Life,
Growth, and Death in Organisms, Cities, and
Companies. London: Weidenfeld and
Nicholson.
-
Xiao, Han, Kashif Rasul, and Roland
Vollgraf. 2017. “Fashion-MNIST: A Novel Image Dataset
for Benchmarking Machine Learning Algorithms.” August
28.
https://arxiv.org/abs/1708.07747.