Andrea LaPaugh
Andrea Suzanne LaPaugh is an American computer scientist and professor emerita of computer science at Princeton University.[1] Her research has concerned the design and analysis of algorithms, particularly for graph algorithms, problems involving the computer-aided design of VLSI circuits, and document retrieval.[2][3][4]
Early life and education
[edit]LaPaugh is originally from Middletown, Connecticut,[2] where her father worked in an office and her mother was a librarian; she majored in physics at Cornell University.[3] This was at a time when Cornell had no undergraduate computer science program, but she became interested in computer science through courses on mathematical logic and formal languages, with instructors including Anil Nerode, Juris Hartmanis, and John Hopcroft. She began her doctoral studies at the Massachusetts Institute of Technology in 1974, working with Ron Rivest on graph algorithms, and finished her Ph.D. there in 1980[2] with the dissertation Algorithms for Integrated Circuit Layout: An Analytic Approach.[5]
Career and later life
[edit]LaPaugh worked for a year as a visiting assistant professor at Brown University before joining the Princeton University faculty as an assistant professor in 1981,[1][2][3][4] at first as the only female engineering faculty member[2] and, after earning tenure in 1987,[4] as the only tenured woman in engineering.[2] She was promoted to full professor in 1995,[1] and was the master of Forbes College at Princeton from 2000 to 2004.[2][4] She retired to become a professor emerita in 2019.[2]
Selected publications
[edit]- LaPaugh, Andrea S.; Rivest, Ronald L. (1980), "The subgraph homeomorphism problem", Journal of Computer and System Sciences, 20 (2): 133–149, CiteSeerX 10.1.1.309.8992, doi:10.1016/0022-0000(80)90057-4
- Coffman, Edward G. Jr.; Garey, M. R.; Johnson, David S.; LaPaugh, Andrea S. (1985), "Scheduling file transfers", SIAM Journal on Computing, 14 (3): 744–780, doi:10.1137/0214054
- LaPaugh, Andrea S. (1993), "Recontamination does not help to search a graph", Journal of the ACM, 40 (2): 224–245, doi:10.1145/151261.151263, S2CID 2132020
- Chao, Liang-Fang; LaPaugh, Andrea S.; Sha, Edwin Hsing-Mean (1993), "Rotation scheduling: A loop pipelining algorithm", in Dunlop, Alfred E. (ed.), Proceedings of the 30th Design Automation Conference, Dallas, Texas, USA, June 14-18, 1993, ACM Press, pp. 566–572, doi:10.1145/157485.165042, S2CID 9256330
References
[edit]- ^ a b c "Andrea LaPaugh", People, Princeton Department of Computer Science, retrieved 2021-06-06
- ^ a b c d e f g h "Andrea S. LaPaugh", Annual Emeriti Booklet Excerpt, Princeton Dean of Faculty, retrieved 2021-06-06
- ^ a b c Jackson, Bart (14 April 2010), "The Information We Seek, and the Way We Seek It", Princeton Info
- ^ a b c d "LaPaugh to become master of Forbes", Princeton Weekly Bulletin, 89 (19), 6 March 2000
- ^ Andrea LaPaugh at the Mathematics Genealogy Project
| International | |
|---|---|
| Academics | |
