1. Noga Alon, “A comment on generalized covers,” note to Gadiel Seroussi, June 2001.
2. James Aspnes, Richard Beigel, Merrick Furst, and Steven Rudich,The expressive power of voting polynomials, Combinatorica14 (1994), 135–148.
3. Mira Bernstein,The Hat Problem and Hamming Codes, in theFocus newsletter of the MAA, November, 2001, 4–6.
4. Todd Ebert and Heribert Vollmer,On the Autoreducibility of Random Sequences, inProc. 25th International Symposium on Mathematical Foundations of Computer Science, Springer Lectures Notes in Computer Science, v. 1893,333–342,2000.
5. Hendrik Lenstra and Gadiel Seroussi,On Hats and other Covers, preprint, 2002, www. hpl. hp.com/infotheo ry/hats_extsum. pdf