Andrea LaPaugh

Last updated

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]

Contents

Early life and education

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

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

Related Research Articles

Robert Tarjan

Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's off-line lowest common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, and the Chief Scientist at Intertrust Technologies Corporation.

Sartaj Sahni

Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.

Jon Kleinberg

Jon Michael Kleinberg is an American computer scientist and the Tisch University Professor of Computer Science and Information Science at Cornell University known for his work in algorithms and networks. He is a recipient of the Nevanlinna Prize by the International Mathematical Union.

Éva Tardos Hungarian mathematician

Éva Tardos is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University.

Vijay Vazirani

Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.

Ravindran Kannan

Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.

Zvi Galil Israeli mathematician and computer scientist

Zvi Galil is an Israeli-American computer scientist and mathematician. Galil served as the President of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing. His research interests include the design and analysis of algorithms, computational complexity and cryptography. He has been credited with coining the terms stringology and sparsification. He has published over 200 scientific papers and is listed as an ISI highly cited researcher.

Kurt Mehlhorn German computer scientist (born 1949)

Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.

Jennifer Tour Chayes American computer scientist and mathematician

Jennifer Tour Chayes is the University of California, Berkeley Associate Provost for the Division of Computing, Data Science, and Society and Dean of the School of Information. She was formerly a Technical Fellow and Managing Director of Microsoft Research New England in Cambridge, Massachusetts, which she founded in 2008, and Microsoft Research New York City, which she founded in 2012.

Cynthia Dwork American computer scientist

Cynthia Dwork is an American computer scientist at Harvard University, where she is Gordon McKay Professor of Computer Science, Radcliffe Alumnae Professor at the Radcliffe Institute for Advanced Study, and Affiliated Professor, Harvard Law School and Harvard's Department of Statistics.

Joseph S. B. Mitchell

Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.

Nathan (Nati) Linial is an Israeli mathematician and computer scientist, a professor in the Rachel and Selim Benin School of Computer Science and Engineering at the Hebrew University of Jerusalem, and an ISI highly cited researcher.

Donald Bruce Johnson was an American computer scientist, a researcher in the design and analysis of algorithms, and the founding chair of the computer science department at Dartmouth College.

Monika Henzinger German computer scientist

Monika Henzinger is a German computer scientist, and is a former director of research at Google. She is currently a professor at the University of Vienna. Her expertise is mainly on algorithms with a focus on data structures, algorithmic game theory, information retrieval, search algorithms and Web data mining. She is married to Thomas Henzinger and has three children.

Susan Beth Horwitz was an American computer scientist noted for her research on programming languages and software engineering, and in particular on program slicing and dataflow-analysis. She had several best paper and an impact paper award mentioned below under awards.

Valerie King is an American and Canadian computer scientist who works as a professor at the University of Victoria. Her research concerns the design and analysis of algorithms; her work has included results on maximum flow and dynamic graph algorithms, and played a role in the expected linear time MST algorithm of Karger et al.

Giuseppe F. Italiano

Giuseppe Francesco (Pino) Italiano is an Italian computer scientist. He is a professor of computer science at LUISS University in Rome. He is known for his work in graph algorithms, data structures and algorithm engineering.

Ewa Maria Kubicka is a Polish mathematician interested in graph theory and actuarial science. She is known for introducing the concept of the chromatic sum of a graph, the minimum possible sum when the vertices are labeled by natural numbers with no two adjacent vertices having equal labels.

Mona Singh is a Professor of Computer Science in the Lewis-Sigler Institute for Integrative Genomics at Princeton University.

Benjamin E. Rossman is an American mathematician and theoretical computer scientist, specializing in computational complexity theory. He is currently an associate professor of computer science at Duke University.

References

  1. 1 2 3 "Andrea LaPaugh", People, Princeton Department of Computer Science, retrieved 2021-06-06
  2. 1 2 3 4 5 6 7 8 "Andrea S. LaPaugh", Annual Emeriti Booklet Excerpt, Princeton Dean of Faculty, retrieved 2021-06-06
  3. 1 2 3 Jackson, Bart (14 April 2010), "The Information We Seek, and the Way We Seek It", Princeton Info
  4. 1 2 3 4 "LaPaugh to become master of Forbes", Princeton Weekly Bulletin, 89 (19), 6 March 2000
  5. ↑ Andrea LaPaugh at the Mathematics Genealogy Project
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.