Teaching the art of computer programming (TAOCP)
- 6 May 2011
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- An explicit universal cycle for the ( n -1)-permutations of an n -setACM Transactions on Algorithms, 2010
- The coolest way to generate combinationsDiscrete Mathematics, 2009