| 2008 |
|---|
| 43 | EE | Valerie King,
Cynthia Phillips,
Jared Saia,
Maxwell Young:
Sleeping on the job: energy-efficient and robust broadcast for radio networks.
PODC 2008: 243-252 |
| 42 | EE | Bruce M. Kapron,
David Kempe,
Valerie King,
Jared Saia,
Vishal Sanwalani:
Fast asynchronous byzantine agreement and leader election with full information.
SODA 2008: 1038-1047 |
| 41 | EE | Yueh-Hua Lee,
Alex Thomo,
Kui Wu,
Valerie King:
Scalable Ubiquitous Data Access in Clustered Sensor Networks.
SSDBM 2008: 533-540 |
| 40 | EE | Valerie King,
Louis Lei Yu,
Yan Zhuang:
Guanxi in the chinese web - a study of mutual linking.
WWW 2008: 1161-1162 |
| 39 | EE | Valerie King:
Fully Dynamic Connectivity.
Encyclopedia of Algorithms 2008 |
| 38 | EE | Valerie King:
Fully Dynamic Transitive Closure.
Encyclopedia of Algorithms 2008 |
| 37 | EE | Dan Holtby,
Bruce M. Kapron,
Valerie King:
Lower bound for scalable Byzantine Agreement.
Distributed Computing 21(4): 239-248 (2008) |
| 2007 |
|---|
| 36 | EE | Valerie King,
Scott Lewis,
Jared Saia,
Maxwell Young:
Choosing a Random Peer in Chord.
Algorithmica 49(2): 147-169 (2007) |
| 35 | EE | Valerie King,
Cynthia Phillips,
Jared Saia,
Maxwell Young:
Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks
CoRR abs/0710.2532: (2007) |
| 2006 |
|---|
| 34 | EE | Valerie King,
Jared Saia,
Vishal Sanwalani,
Erik Vee:
Towards Secure and Scalable Computation in Peer-to-Peer Networks.
FOCS 2006: 87-98 |
| 33 | EE | Dan Holtby,
Bruce M. Kapron,
Valerie King:
Lower bound for scalable Byzantine Agreement.
PODC 2006: 285-291 |
| 32 | EE | Valerie King,
Jared Saia,
Vishal Sanwalani,
Erik Vee:
Scalable leader election.
SODA 2006: 990-999 |
| 2005 |
|---|
| 31 | EE | Chong Liu,
Kui Wu,
Valerie King:
Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks.
NETWORKING 2005: 956-967 |
| 2004 |
|---|
| 30 | EE | Sarah Carruthers,
Valerie King:
Connectivity of Wireless Sensor Networks with Constant Density.
ADHOC-NOW 2004: 149-157 |
| 29 | EE | Dennis Dreef,
Sanaz Ahari,
Kui Wu,
Valerie King:
Utilizing the Uncertainty of Intrusion Detection to Strengthen Security for Ad Hoc Networks.
ADHOC-NOW 2004: 82-95 |
| 28 | EE | Valerie King,
Jared Saia:
Choosing a random peer.
PODC 2004: 125-130 |
| 2003 |
|---|
| 27 | EE | Valerie King,
Li Zhang,
Yunhong Zhou:
On the complexity of distance-based evolutionary tree reconstruction.
SODA 2003: 444-453 |
| 2002 |
|---|
| 26 | EE | Valerie King,
Garry Sagert:
A Fully Dynamic Algorithm for Maintaining the Transitive Closure.
J. Comput. Syst. Sci. 65(1): 150-167 (2002) |
| 2001 |
|---|
| 25 | EE | Valerie King,
Mikkel Thorup:
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms.
COCOON 2001: 268-277 |
| 24 | EE | Valerie King,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Parity Word Automata.
FoSSaCS 2001: 276-286 |
| 23 | EE | Monika Rauch Henzinger,
Valerie King:
Maintaining Minimum Spanning Forests in Dynamic Graphs.
SIAM J. Comput. 31(2): 364-374 (2001) |
| 1999 |
|---|
| 22 | EE | Valerie King:
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs.
FOCS 1999: 81-91 |
| 21 | EE | Valerie King,
Garry Sagert:
A Fully Dynamic Algorithm for Maintaining the Transitive Closure.
STOC 1999: 492-498 |
| 20 | EE | Monika Rauch Henzinger,
Valerie King,
Tandy Warnow:
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
Algorithmica 24(1): 1-13 (1999) |
| 19 | EE | Monika Rauch Henzinger,
Valerie King:
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation.
J. ACM 46(4): 502-516 (1999) |
| 1997 |
|---|
| 18 | | Monika Rauch Henzinger,
Valerie King:
Maintaining Minimum Spanning Trees in Dynamic Graphs.
ICALP 1997: 594-604 |
| 17 | | Valerie King:
A Simpler Minimum Spanning Tree Verification Algorithm.
Algorithmica 18(2): 263-270 (1997) |
| 16 | EE | Valerie King,
Chung Keung Poon,
Vijaya Ramachandran,
Santanu Sinha:
An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification.
Inf. Process. Lett. 62(3): 153-159 (1997) |
| 1996 |
|---|
| 15 | | Monika Rauch Henzinger,
Valerie King,
Tandy Warnow:
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
SODA 1996: 333-340 |
| 14 | | Faith E. Fich,
Russell Impagliazzo,
Bruce M. Kapron,
Valerie King,
Miroslaw Kutylowski:
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution.
J. Comput. Syst. Sci. 53(1): 104-111 (1996) |
| 1995 |
|---|
| 13 | | Monika Rauch Henzinger,
Valerie King:
Fully Dynamic Biconnectivity and Transitive Closure.
FOCS 1995: 664-672 |
| 12 | EE | Monika Rauch Henzinger,
Valerie King:
Randomized dynamic graph algorithms with polylogarithmic time per operation.
STOC 1995: 519-527 |
| 11 | | Valerie King:
A Simpler Minimum Spanning Tree Verification Algorithm.
WADS 1995: 440-448 |
| 1994 |
|---|
| 10 | | Claire Kenyon,
Valerie King:
On Boolean Decision Trees with Faulty Nodes.
Random Struct. Algorithms 5(3): 453-464 (1994) |
| 1993 |
|---|
| 9 | | Faith E. Fich,
Russell Impagliazzo,
Bruce M. Kapron,
Valerie King,
Miroslaw Kutylowski:
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution.
STACS 1993: 386-397 |
| 8 | | Wayne Goddard,
Claire Kenyon,
Valerie King,
Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima.
SIAM J. Comput. 22(2): 272-283 (1993) |
| 1992 |
|---|
| 7 | | Claire Kenyon,
Valerie King:
On Boolean Decision Trees with Faulty Nodes.
ISTCS 1992: 24-31 |
| 1991 |
|---|
| 6 | | Valerie King:
An Omega(n5/4) lower bound on the randomized complexity of graph properties.
Combinatorica 11(1): 23-32 (1991) |
| 1990 |
|---|
| 5 | | Wayne Goddard,
Valerie King,
Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
STOC 1990: 45-53 |
| 4 | | Valerie King:
A lower bound for the recognition of digraph properties.
Combinatorica 10(1): 53-59 (1990) |
| 1989 |
|---|
| 3 | | Tzi-cker Chiueh,
Randy H. Katz,
Valerie King:
Managing the VLSI Design Process.
MIT-JSME Workshop 1989: 183-199 |
| 2 | | Claire Kenyon-Mathieu,
Valerie King:
Verifying Partial Orders
STOC 1989: 367-374 |
| 1988 |
|---|
| 1 | | Valerie King:
Lower Bounds on the Complexity of Graph Properties
STOC 1988: 468-476 |
