Summary
Harold N. Gabow is an American computer scientist known for his research on graph algorithms and data structures. He is a professor emeritus at the University of Colorado Boulder, and the former founding editor-in-chief of ACM Transactions on Algorithms.
Education and career edit
Gabow graduated summa cum laude from Harvard University in 1968, with a bachelor's degree in mathematics.[1] He completed his Ph.D. in computer science in 1973 at Stanford University; his dissertation, Implementations of algorithms for maximum matching on nonbipartite graphs, was supervised by Harold S. Stone.[1][2]
After working as an instructor at the University of Pennsylvania for a year, he joined the University of Colorado Boulder faculty in 1973 as an assistant professor of computer science. He was given tenure as an associate professor in 1979, and promoted to full professor in 1986; he retired as professor emeritus in 2008.[1]
Gabow became the founding editor-in-chief of ACM Transactions on Algorithms (TALG), which published its first issue in 2005, after the mass resignation of the editorial board of its predecessor, Elsevier's Journal of Algorithms.[3] He stepped down as editor on his retirement in 2008.[1]
Recognition edit
Gabow was named as an ACM Fellow in 2002, "for contributions to efficient algorithms to flows, connectivity and matching".[4] He has also won several distinguished service awards from the Association for Computing Machinery.[1]
Personal life edit
Gabow is married to physician and healthcare executive Patricia A. Gabow.[5]
References edit
- ^ a b c d e Curriculum vitae, June 2018, retrieved 2021-07-05
- ^ Harold N. Gabow at the Mathematics Genealogy Project
- ^ Knuth, Donald, "Viva TALG!", Recent News, retrieved 2021-07-05
- ^ "Harold N. Gabow", Award winners, Association for Computing Machinery, retrieved 2021-07-05
- ^ "Dr. Patricia Acquaviva Is Married", The New York Times, June 22, 1971
External links edit
- Home page