PP-2002-04: Lee, Troy (2002) Arithmetical Definability over Finite Structures. [Report]
MoL-2001-13: Lee, Troy (2001) Is Multiplication Harder than Addition? Arithmetical Definability over Finite Structures. [Report]
DS-2006-01: Lee, Troy (2006) Kolmogorov complexity and formula size lower bounds. Doctoral thesis, University of Amsterdam.