1. ∑11-Formulae on finite structures
2. The complexity of the pigeonhole principle. Proceedings 29th IEEE Annual Symposium on Foundations of Computer Science 1988, 346–355.
3. Parity and the pigeon-hole principle. In: Feasible mathematics ( and , eds.), Birkhäser, Basel-Boston 1990, pp. 1–24.
4. The independence of the modulo p counting principles. Proceedings 26th Annual AMC Symposium on Theory of Computing 1985, 402–411.
5. A switching lemma primer. Unpublished notes.