- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c43 |      | Bruce M. Kapron, Valerie King, Ben Mountjoy: Dynamic graph connectivity in polylogarithmic worst case time. SODA 2013: 1131-1142 |
| 2012 | ||
| j19 | | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja: Predicting missing contacts in mobile social networks. Pervasive and Mobile Computing 8(5): 698-716 (2012) |
| c42 | | Seth Gilbert, Jared Saia, Valerie King, Maxwell Young: Resource-competitive analysis: a new perspective on attack-resistant distributed computing. FOMC 2012: 1 |
| c41 | | Zahed Rahmati, Sue Whitesides, Valerie King: Kinetic and Stationary Point-Set Embeddability for Plane Graphs. Graph Drawing 2012: 279-290 |
| c40 | | Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia: Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary. PODC 2012: 227-228 |
| i5 | | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja: They Know Where You Live! CoRR abs/1202.3504 (2012) |
| i4 | | Valerie King, Jared Saia, Maxwell Young: Resource-Competitive Communication. CoRR abs/1202.6456 (2012) |
| i3 | | Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia: Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary. CoRR abs/1203.0289 (2012) |
| 2011 | ||
| j18 | | Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young: Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks. Algorithmica 61(3): 518-554 (2011) |
| j17 | | Louis Lei Yu, Valerie King: The evolution of friendships in Chinese online social networks. IJSCCPS 1(2): 180-205 (2011) |
| j16 | | Valerie King, Jared Saia: Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. J. ACM 58(4): 18 (2011) |
| c39 | | Valerie King, Steven Lonargan, Jared Saia, Amitabh Trehan: Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information. ICDCN 2011: 203-214 |
| c38 | | |
| c37 | | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja: Empirical Comparison of Information Spreading Algorithms in the Presence of 1-Whiskers. SocialCom/PASSAT 2011: 489-492 |
| c36 | | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja: Predicting missing contacts in mobile social networks. WOWMOM 2011: 1-9 |
| 2010 | ||
| j15 | | |
| j14 | | Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani: Fast asynchronous Byzantine agreement and leader election with full information. ACM Transactions on Algorithms 6(4) (2010) |
| c35 | | Olumuyiwa Oluwasanmi, Jared Saia, Valerie King: An empirical study of a scalable Byzantine agreement algorithm. IPDPS Workshops 2010: 1-13 |
| c34 | | |
| c33 | | Valerie King, Jared Saia: Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary. PODC 2010: 420-429 |
| c32 | | Louis Yu, Valerie King: The Evolution of Friendships in Chinese Online Social Networks. SocialCom/PASSAT 2010: 81-87 |
| i2 | | Valerie King, Jared Saia: Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary. CoRR abs/1002.4561 (2010) |
| 2009 | ||
| c31 | | |
| c30 | | Valerie King, Jared Saia: Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary. PODC 2009: 304-305 |
| c29 | | Valerie King, Jared Saia: From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits. DISC 2009: 464-478 |
| 2008 | ||
| j13 | | Dan Holtby, Bruce M. Kapron, Valerie King: Lower bound for scalable Byzantine Agreement. Distributed Computing 21(4): 239-248 (2008) |
| c28 | | Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young: Sleeping on the job: energy-efficient and robust broadcast for radio networks. PODC 2008: 243-252 |
| c27 | | 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 |
| c26 | | Yueh-Hua Lee, Alex Thomo, Kui Wu, Valerie King: Scalable Ubiquitous Data Access in Clustered Sensor Networks. SSDBM 2008: 533-540 |
| c25 | | Valerie King, Louis Lei Yu, Yan Zhuang: Guanxi in the chinese web - a study of mutual linking. WWW 2008: 1161-1162 |
| r2 | | |
| r1 | | |
| 2007 | ||
| j12 | | Valerie King, Scott Lewis, Jared Saia, Maxwell Young: Choosing a Random Peer in Chord. Algorithmica 49(2): 147-169 (2007) |
| i1 | | Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young: Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks. CoRR abs/0710.2532 (2007) |
| 2006 | ||
| c24 | | Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Towards Secure and Scalable Computation in Peer-to-Peer Networks. FOCS 2006: 87-98 |
| c23 | | Dan Holtby, Bruce M. Kapron, Valerie King: Lower bound for scalable Byzantine Agreement. PODC 2006: 285-291 |
| c22 | | |
| 2005 | ||
| c21 | | |
| c20 | | Chong Liu, Kui Wu, Valerie King: Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks. NETWORKING 2005: 956-967 |
| 2004 | ||
| c19 | | 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 |
| c18 | | Sarah Carruthers, Valerie King: Connectivity of Wireless Sensor Networks with Constant Density. ADHOC-NOW 2004: 149-157 |
| c17 | | |
| 2003 | ||
| c16 | | Valerie King, Li Zhang, Yunhong Zhou: On the complexity of distance-based evolutionary tree reconstruction. SODA 2003: 444-453 |
| 2002 | ||
| j11 | | Valerie King, Garry Sagert: A Fully Dynamic Algorithm for Maintaining the Transitive Closure. J. Comput. Syst. Sci. 65(1): 150-167 (2002) |
| 2001 | ||
| j10 | | Monika Rauch Henzinger, Valerie King: Maintaining Minimum Spanning Forests in Dynamic Graphs. SIAM J. Comput. 31(2): 364-374 (2001) |
| c15 | | Valerie King, Mikkel Thorup: A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. COCOON 2001: 268-277 |
| c14 | | Valerie King, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Parity Word Automata. FoSSaCS 2001: 276-286 |
| 1999 | ||
| j9 | | 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) |
| j8 | | Monika Rauch Henzinger, Valerie King: Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46(4): 502-516 (1999) |
| c13 | | Valerie King: Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. FOCS 1999: 81-91 |
| c12 | | Valerie King, Garry Sagert: A Fully Dynamic Algorithm for Maintaining the Transitive Closure. STOC 1999: 492-498 |
| 1997 | ||
| j7 | | Valerie King: A Simpler Minimum Spanning Tree Verification Algorithm. Algorithmica 18(2): 263-270 (1997) |
| j6 | | 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) |
| c11 | | Monika Rauch Henzinger, Valerie King: Maintaining Minimum Spanning Trees in Dynamic Graphs. ICALP 1997: 594-604 |
| 1996 | ||
| j5 | | 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) |
| c10 | | Monika Rauch Henzinger, Valerie King, Tandy Warnow: Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996: 333-340 |
| 1995 | ||
| c9 | | Monika Rauch Henzinger, Valerie King: Fully Dynamic Biconnectivity and Transitive Closure. FOCS 1995: 664-672 |
| c8 | | Monika Rauch Henzinger, Valerie King: Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC 1995: 519-527 |
| c7 | | |
| 1994 | ||
| j4 | | Claire Kenyon, Valerie King: On Boolean Decision Trees with Faulty Nodes. Random Struct. Algorithms 5(3): 453-464 (1994) |
| 1993 | ||
| j3 | | 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) |
| c6 | | 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 |
| 1992 | ||
| c5 | | |
| 1991 | ||
| j2 | | Valerie King: An Omega(n5/4) lower bound on the randomized complexity of graph properties. Combinatorica 11(1): 23-32 (1991) |
| 1990 | ||
| j1 | | Valerie King: A lower bound for the recognition of digraph properties. Combinatorica 10(1): 53-59 (1990) |
| c4 | | Wayne Goddard, Valerie King, Leonard J. Schulman: Optimal Randomized Algorithms for Local Sorting and Set-Maxima. STOC 1990: 45-53 |
| 1989 | ||
| c3 | | Tzi-cker Chiueh, Randy H. Katz, Valerie King: Managing the VLSI Design Process. MIT-JSME Workshop 1989: 183-199 |
| c2 | | |
| 1988 | ||
| c1 | | |
Colors in the list of coauthors
Last update Tue May 21 19:58:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page