Papers in Preparation

1. Lower bounds on the Deterministic and Quantum Communication Complexity of $HAM_n^a$. (with A. Ambainis, A. Srinivasan, A. Utis)
2. The Multiparty Communication Complexity of Exact-$T$ revisited. (with Richard Beigel and James Glenn).
3. The Complexity of Learning SUBSEQ(A). (with Steven Fenner).
4. The Complexity of Finding SUBSEQ(A). (with Steven Fenner and Brian Postow).