Valerie King

Valerie King
Name	Valerie King
Fields	Computer science
Workplaces	University of Waterloo, AT&T Bell Laboratories, Massachusetts Institute of Technology
Alma mater	Massachusetts Institute of Technology, Carnegie Mellon University
Doctoral advisor	Robert E. Tarjan, Daniel S. Hirschberg
Known for	randomized algorithms, graph algorithms, dynamic algorithms

Valerie King is a computer scientist noted for foundational work in randomized algorithms, graph theory algorithms, and dynamic data structure design. Her research, spanning theoretical analysis and practical algorithm design, has influenced work at institutions such as AT&T Bell Laboratories, the Massachusetts Institute of Technology and the University of Waterloo. King has supervised doctoral students, collaborated with researchers in theoretical computer science and contributed to algorithms used in network analysis, computational biology, and large-scale data processing.

Early life and education

King completed undergraduate and graduate studies at institutions with strong computer science traditions. She earned a degree from Carnegie Mellon University before pursuing doctoral work at the Massachusetts Institute of Technology under advisors including Robert E. Tarjan and Daniel S. Hirschberg. Her dissertation addressed topics in algorithmic efficiency and laid groundwork connecting probabilistic methods from the probabilistic method community with combinatorial structures from graph theory.

Academic career and positions

King began her professional career at AT&T Bell Laboratories, where she worked alongside researchers from areas such as data structures, network design, and complexity theory. She later held faculty positions at the University of Victoria and the University of Waterloo, participating in departments that collaborate with centers like the Perimeter Institute for Theoretical Physics and the Institute for Quantum Computing. Throughout her career she has been a visiting researcher and lecturer at venues such as the Massachusetts Institute of Technology, the University of California, Berkeley, and research labs associated with Bell Labs and industrial partners.

King has served on program committees for major conferences including ACM Symposium on Theory of Computing, IEEE Symposium on Foundations of Computer Science, and SIAM Symposium on Discrete Algorithms. She has been active in supervising doctoral and postdoctoral scholars who later joined faculties at institutions like Cornell University, University of Toronto, and McGill University.

Research contributions and publications

King’s publications explore intersections of randomized algorithms, graph algorithms, and dynamic data structures. She produced influential results on randomized techniques for connectivity testing in graphs, leveraging tools from Markov chain analysis and the probabilistic method. Her papers on dynamic connectivity introduced amortized and worst-case time bounds that shaped subsequent work in decremental and incremental algorithms.

King coauthored results on approximate shortest paths and on sparsification methods related to the cut sparsifier concept, informing research in large-scale network analysis used by teams at Google and Microsoft Research. She contributed to complexity-theoretic understandings of online and streaming models, publishing in outlets such as the Journal of the ACM, SIAM Journal on Computing, and proceedings of STOC and FOCS. Her work often combines rigorous worst-case analysis with randomized sampling strategies inspired by researchers like Michael O. Rabin and Jon Kleinberg.

Collaborations include joint papers with scholars from Carnegie Mellon University, Princeton University, and Stanford University. Her surveys and invited talks synthesizing dynamic algorithm techniques have been presented at venues such as the International Congress of Mathematicians satellite workshops and winter schools hosted by Fields Institute.

Awards and honors

King’s contributions have been recognized by fellowships, invited lectureships, and awards from professional societies. She has held research fellowships tied to institutes like the National Science Foundation and received best paper recognitions at conferences including SODA. She has been invited to give plenary and keynote addresses at forums such as the Canadian Mathematical Society meetings and workshops supported by the Association for Computing Machinery.

King has been named to editorial boards of journals including the SIAM Journal on Computing and the ACM Transactions on Algorithms. Her mentorship and service earned departmental and university teaching and research awards at institutions such as the University of Waterloo.

Selected algorithms and applications

- Randomized connectivity and minimum spanning structure algorithms: King developed and refined randomized sampling approaches that speed connectivity testing and minimum spanning forest construction in sparse and dense (Erdős–Rényi-style) graph models. These methods influenced parallel implementations used in research groups at IBM Research and Google Research.

- Dynamic connectivity algorithms: She introduced techniques for maintaining connectivity information under edge insertions and deletions with improved amortized bounds, impacting applications in dynamic network routing studied by teams at Cisco Systems and in dynamic social network analysis pursued at Facebook research labs.

- Approximate shortest-path and sparsification: King contributed to algorithms that build sparse graph representations preserving cut and distance properties, which have been applied in large-scale optimization problems at Microsoft Research and in computational biology pipelines at institutions like Broad Institute.

- Streaming and online algorithm frameworks: Her work on space-efficient randomized algorithms for graph properties informed streaming models used by groups at MIT CSAIL and in data stream processing systems such as those developed by Apache Software Foundation projects.

Selected publications include articles in Journal of the ACM, SIAM Journal on Computing, and conference proceedings of STOC, FOCS, and SODA where she formalized bounds and presented algorithmic frameworks that remain widely cited.

Category:Computer scientists Category:Women computer scientists