The following is an incomplete list of things or people I found some inspiration in, sometimes accompanied by a brief description and in no particular order. I encourage you to reflect on, and find, what inspires you, as inspiration helps color the world in a particularly pleasant and envigorating way.


"The Complexity of Theorem-Proving Procedures"

by Stephen A. Cook (1971) [link to pdf]

"A Mathematical Theory of Communication"

by Claude E. Shannon (1948) [link to pdf]

"On the Computational Complexity of Algorithms"

by Juris Hartmanis and Richard E. Stearns (1963) [link to pdf]

"A Protocol for Packet Network Intercommunication"

by Vinton G. Cerf and Robert E. Kahn (1974) [link to pdf]

"IP = PSPACE"

by Adi Shamir (1992) [link to pdf]

"Proof Verification and the Hardness of Approximation Problems"

by Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy (1998) [link to pdf]

"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer"

by Peter W. Shor (1997) [link to pdf]

"Undirected Connectivity in Log-Space"

by Omer Reingold (2008) [link to pdf]

"On the Complexity of Some Two-Person Perfect-Information Games"

by Thomas J. Schaefer (1978) [link to pdf]

"PRIMES is in P"

by Manindra Agrawal, Neeraj Kayal, Nitin Saxena (2004) [link to pdf]

"Classical Verification of Quantum Computations"

by Urmila Mahadev (2018) [link to pdf]

"KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs"

by Cristian Cadar, Daniel Dunbar, Dawson Engler (2008) [link to pdf]

"Boosting Fuzzer Efficiency: An Information Theoretic Perspective"

by Marcel Bohme, Valentin J. M. Manes, Sang Kil Cha (2020) [link to pdf]


Valid HTML 4.01 Transitional