`Travelled to:`

2 × Italy

6 × USA

`Collaborated with:`

M.R.Henzinger J.Saia G.Sagert C.Kenyon-Mathieu ∅ O.Kupferman M.Y.Vardi W.Goddard L.J.Schulman

`Talks about:`

algorithm (3) graph (3) dynam (3) maintain (2) complex (2) random (2) time (2) polylogarithm (1) agreement (1) properti (1)

## Person: Valerie King

### DBLP: King:Valerie

### Contributed to:

### Wrote 8 papers:

- STOC-2013-KingS #polynomial
- Byzantine agreement in polynomial expected time: [extended abstract] (VK, JS), pp. 401–410.
- FoSSaCS-2001-KingKV #automaton #complexity #on the #word
- On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
- STOC-1999-KingS #algorithm #maintenance #transitive
- A Fully Dynamic Algorithm for Maintaining the Transitive Closure (VK, GS), pp. 492–498.
- ICALP-1997-HenzingerK #graph #maintenance
- Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.
- STOC-1995-HenzingerK #algorithm #graph #random
- Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
- STOC-1990-GoddardKS #algorithm #random #sorting
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.
- STOC-1989-Kenyon-MathieuK #partial order #verification
- Verifying Partial Orders (CKM, VK), pp. 367–374.
- STOC-1988-King #bound #complexity #graph
- Lower Bounds on the Complexity of Graph Properties (VK), pp. 468–476.