Interests: Search and retrieval of information; data mining, particularly clustering; combinatorial algorithms.
Professor Andrea S. LaPaugh joined Princeton in 1981 as an assistant professor of electrical engineering and computer science after earning her doctorate and a master’s in electrical engineering from MIT. She has been a full professor of computer science since 1995. She served as master of Forbes Residential College from 2000 to 2004. Her research interests focus on information discovery for large-scale digital collections, computer-aided design of digital systems and algorithm foundations. Professor LaPaugh is a member of the ACM, and ACM special interest groups SIGACT, SIGARCH, SIGIR, and SIGWEB. She also is a member of the IEEE and IEEE Computer Society.
- “Recontamination Does Not Help to Search a Graph.” Journal of the ACM, Vol. 40, No. 2 (April 1993) pp. 224-245.
- “Rotation Scheduling: A Loop Pipelining Technique.” (With Liang-Fang Chao and Edwin Hsing-Mean Sha). IEEE Transactions on Computer-Aided Design. Vol. 16, No. 3 (March 1997) pp. 229-239.
- “Scheduling File Transfers.” (With E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson). SIAM Journal for Computing, Vol. 14, No. 3 (1985) pp. 744-780.
- “The Subgraph Homeomorphism Problem.” (With R. Rivest). Journal of Computer and System Sciences, Vol. 20, No. 2 (April 1980) pp. 133-149 .
- “A Polynomial Time Algorithm for Optimal Routing Around a Rectangle.” Proc. Of the Twenty-First Annual Symposium on Foundations of Computer Science, IEEE, October 1980, pp. 282-293.