Valerie King
Valerie King is an American and Canadian computer scientist who works as a professor at the University of Victoria.[1] 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.[2]
She became a Fellow of the Association for Computing Machinery in 2014.[3]
Education
[edit]King graduated from Princeton University in 1977. She earned a Juris Doctor degree from the University of California, Berkeley School of Law in 1983, and became a member of the State Bar of California, but returned to Berkeley and earned a Ph.D. in computer science in 1988 under the supervision of Richard Karp with a dissertation concerning the Aanderaa–Karp–Rosenberg conjecture.[1][4]
References
[edit]- ^ a b Curriculum vitae, retrieved 2015-01-08.
- ^ Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), "A randomized linear-time algorithm to find minimum spanning trees", Journal of the ACM, 42 (2): 321–328, doi:10.1145/201019.201022, S2CID 832583
- ^ ACM Names Fellows for Innovations in Computing Archived 2015-01-09 at the Wayback Machine, ACM, January 8, 2015, retrieved 2015-01-08.
- ^ Valerie King at the Mathematics Genealogy Project
External links
[edit]| Authority control databases: Academics |
|---|
- Living people
- American computer scientists
- Canadian computer scientists
- Canadian women computer scientists
- Theoretical computer scientists
- Princeton University alumni
- UC Berkeley School of Law alumni
- Academic staff of the University of Victoria
- 2014 fellows of the Association for Computing Machinery
- Computer scientist stubs