Selected References to Drafts of the Book "Combinatorial Generation"

• Paulo Barreto, Rafael Misoczki, and Marcos Simplicio Jr., One-time signature scheme from syndrome decoding over generic error-correcting codes, The Journal of Systems and Software (2010), doi:10.1016/j.jss.2010.09.016.
• Daniel M. Gordon, Victor S. Miller, and Peter Ostapenko, Optimal Hash Functions for Approximate Matches on the n-Cube, IEEE Transactions on Information Theory, 56 (2010) 984-991.
• A.O. Ulusoy, F. Calakli, and G. Taubin, One-shot scanning using De Bruijn spaced grids, 2009 IEEE 12th International Conference on Computer Vision, (2009) 1786-1792.
• P. Ferragina, R. Grossi, A. Gupta, R. Shah, and J.S. Vitter, On Searching Compressed String Collections Cache-Obliviously, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2008, 181-190.
• T. Mononen, P. Myllymaki, Computing the NML for Bayesian Forests via Matrices and Generating Polynomials, Information Theory Workshop, 2008. ITW '08. IEEE , pp.276-280, 5-9 May 2008.
• John M. Boyer, Simple Constant Amortized Time Generation of Fixed Length Numeric Partitions, J. Algorithms, 54 (2005) 31--39.