Jump to content

Valerie King

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 19:38, 2 November 2020 (Add: s2cid. | You can use this bot yourself. Report bugs here. | Suggested by Abductive | Category:Fellows of the Association for Computing Machinery | via #UCB_Category 249/728). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

For other uses, see Valerie King (disambiguation).

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]

King graduated from Princeton University in 1977. She earned a law degree (Juris Doctor) from the University of California, Berkeley 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][3]

She became a Fellow of the Association for Computing Machinery in 2014.[4]

References

  1. ^ a b Curriculum vitae, retrieved 2015-01-08.
  2. ^ 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
  3. ^ Valerie King at the Mathematics Genealogy Project
  4. ^ ACM Names Fellows for Innovations in Computing Archived 2015-01-09 at the Wayback Machine, ACM, January 8, 2015, retrieved 2015-01-08.
P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Valerie_King&oldid=986747167"