Sophie LaPlante
Contact Information
Office:
Phone:
Fax:
Technical Reports
- TR-2001-15
- Stronger separations for random-self-reducibility, rounds, and advice. S. Laplante; L. Babai. 1 January, 2001. Communicated by Laszlo Babai.
- TR-97-13
- Kolmogorov Techniques in Computational Complexity Theory. Laplante, Sophie. 13 November, 1997.
- TR-96-26
- Indistinguishability. Rogers, J.; Laplante, S.. 4 December, 1996.
- TR-96-25
- Extractors for Kolmogorov Complexity. Laplante, S.; Fortnow, L.. 4 December, 1996.
- TR-94-19
- A note on adaptiveness and advice in coherence. Laplante, Sophie; Fortnow, Lance. 21 November, 1994.
- TR-94-03
- A Kolmogorov Complexity proof of Hastad's switching lemma: An exposition. Laplante, Sophie. 11 March, 1994.
