1. R.C. Merkle et M.E. Hellman, “Hiding Information and Receipts in Trap Door Knapsacks”, Internal Symposium on Information Theory, Cornell University, Ithaca, New York, October 1977.
2. G.B. Mathews, On the partition of numbers, Proceedings of the London Mathematical Society, 28:486-490, 1897.
3. A. Shamir, A Polynomial-Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem, IEEE Transactions on Information Theory, Vol. IT-30, pp. 699-704, 1984.
4. Skiena, S.S. (September 1999). “Who is Interested in Algorithms and Why? Lessons from the Stony Brook Algorithm Repository”. AGM SIGACT News 30 (3): 65-74.
5. Gallo, G.; Hammer, P.L.; Simeone, B. (1980). “Quadratic knapsack problems”. Mathematical Programming Studies 12: 132-149.