References

Published

January 1, 2026

Bloom, Burton H. 1970. “Space/Time Trade-Offs in Hash Coding with Allowable Errors.” Communications of the ACM 13 (7): 422–26. https://doi.org/10.1145/362686.362692.
Cook, Stephen A. 1971. “The Complexity of Theorem-Proving Procedures.” Proceedings of the Third Annual ACM Symposium on Theory of Computing, 151–58. https://doi.org/10.1145/800157.805047.
Cormode, Graham, and S. Muthukrishnan. 2005. “An Improved Data Stream Summary: The Count-Min Sketch and Its Applications.” Journal of Algorithms 55 (1): 58–75. https://doi.org/10.1016/j.jalgor.2003.12.001.
Dean, Jeffrey, and Sanjay Ghemawat. 2004. “MapReduce: Simplified Data Processing on Large Clusters.” Sixth Symposium on Operating System Design and Implementation, 137–50. https://research.google/pubs/mapreduce-simplified-data-processing-on-large-clusters/.
Diffie, Whitfield, and Martin E. Hellman. 1976. “New Directions in Cryptography.” IEEE Transactions on Information Theory 22 (6): 644–54. https://doi.org/10.1109/TIT.1976.1055638.
Dijkstra, E. W. 1959. “A Note on Two Problems in Connexion with Graphs.” Numerische Mathematik 1: 269–71. https://doi.org/10.1007/BF01386390.
Dwork, Cynthia, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006. “Calibrating Noise to Sensitivity in Private Data Analysis.” Theory of Cryptography, Lecture notes in computer science, vol. 3876: 265–84. https://doi.org/10.1007/11681878_14.
Edmonds, Jack, and Richard M. Karp. 1972. “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.” Journal of the ACM 19 (2): 248–64. https://doi.org/10.1145/321694.321699.
Flajolet, Philippe, Éric Fusy, Olivier Gandouet, and Frédéric Meunier. 2007. “HyperLogLog: The Analysis of a Near-Optimal Cardinality Estimation Algorithm.” Proceedings of the 2007 Conference on Analysis of Algorithms, 127–46. https://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf.
Fredman, Michael L., and Robert Endre Tarjan. 1987. “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms.” Journal of the ACM 34 (3): 596–615. https://doi.org/10.1145/28869.28874.
Grover, Lov K. 1996. “A Fast Quantum Mechanical Algorithm for Database Search.” Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 212–19. https://doi.org/10.1145/237814.237866.
Huffman, David A. 1952. “A Method for the Construction of Minimum-Redundancy Codes.” Proceedings of the IRE 40 (9): 1098–101. https://doi.org/10.1109/JRPROC.1952.273898.
Jumper, John, Richard Evans, Alexander Pritzel, et al. 2021. “Highly Accurate Protein Structure Prediction with AlphaFold.” Nature 596: 583–89. https://doi.org/10.1038/s41586-021-03819-2.
Karp, Richard M. 1972. “Reducibility Among Combinatorial Problems.” In Complexity of Computer Computations, edited by Raymond E. Miller and James W. Thatcher. Plenum Press.
Knuth, Donald E., Jr. Morris James H., and Vaughan R. Pratt. 1977. “Fast Pattern Matching in Strings.” SIAM Journal on Computing 6 (2): 323–50. https://doi.org/10.1137/0206024.
Kraska, Tim, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. “The Case for Learned Index Structures.” Proceedings of the 2018 International Conference on Management of Data, 489–504. https://doi.org/10.1145/3183713.3196909.
Lykouris, Thodoris, and Sergei Vassilvitskii. 2018. “Competitive Caching with Machine Learned Advice.” Proceedings of the 35th International Conference on Machine Learning, Proceedings of machine learning research, vol. 80: 3296–305. https://proceedings.mlr.press/v80/lykouris18a.html.
Malewicz, Grzegorz, Matthew H. Austern, Aart J. C. Bik, et al. 2010. “Pregel: A System for Large-Scale Graph Processing.” Proceedings of the 2010 International Conference on Management of Data, 135–46. https://doi.org/10.1145/1807167.1807184.
National Institute of Standards and Technology. 2024. Post-Quantum Cryptography Standards: FIPS 203, FIPS 204, and FIPS 205. https://csrc.nist.gov/projects/post-quantum-cryptography.
Rivest, Ronald L., Adi Shamir, and Leonard Adleman. 1978. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” Communications of the ACM 21 (2): 120–26. https://doi.org/10.1145/359340.359342.
Shor, Peter W. 1997. “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.” SIAM Journal on Computing 26 (5): 1484–509. https://doi.org/10.1137/S0097539795293172.
Silver, David, Aja Huang, Chris J. Maddison, et al. 2016. “Mastering the Game of Go with Deep Neural Networks and Tree Search.” Nature 529: 484–89. https://doi.org/10.1038/nature16961.
Spielman, Daniel A., and Shang-Hua Teng. 2004. “Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time.” Journal of the ACM 51 (3): 385–463. https://doi.org/10.1145/990308.990310.
Vaswani, Ashish, Noam Shazeer, Niki Parmar, et al. 2017. “Attention Is All You Need.” Advances in Neural Information Processing Systems 30, 5998–6008. https://proceedings.neurips.cc/paper/7181-attention-is-all-you-need.pdf.