|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 50 occurrences of 39 keywords
|
|
|
|
|
Results
Found 62 publication records. Showing 62 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia |
Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja |
They Know Where You Live! |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Valerie King, Jared Saia, Maxwell Young |
Resource-Competitive Communication |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young |
Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Steven Lonargan, Jared Saia, Amitabh Trehan |
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information. |
ICDCN |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja |
Empirical Comparison of Information Spreading Algorithms in the Presence of 1-Whiskers. |
SocialCom/PASSAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia, Maxwell Young |
Conflict on a communication channel. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazem Jahanbakhsh, Valerie King, Gholamali C. Shoja |
Predicting missing contacts in mobile social networks. |
WOWMOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
Scalable byzantine computation. |
SIGACT News |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Yu, Valerie King |
The Evolution of Friendships in Chinese Online Social Networks. |
SocialCom/PASSAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Wu, Jared Saia, Valerie King |
Attack-resistant frequency counting. |
IPDPS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olumuyiwa Oluwasanmi, Jared Saia, Valerie King |
An empirical study of a scalable Byzantine agreement algorithm. |
IPDPS Workshops |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
samplers, peer-to-peer, distributed computing, consensus, secret-sharing, byzantine agreement, monte carlo algorithms |
| 1 | Valerie King, Louis Yu, Yan Zhuang |
Guanxi in the Chinese Web. |
CSE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
asychrony, communication complexity, gossiping, leader election, byzantine agreement, message complexity, synchrony |
| 1 | Dan Holtby, Bruce M. Kapron, Valerie King |
Lower bound for scalable Byzantine Agreement. |
Distributed Computing |
2008 |
DBLP DOI BibTeX RDF |
Scalable distributed protocol, Malicious adversary, Lower bounds, Byzantine Agreement |
| 1 | Valerie King |
Fully Dynamic Connectivity. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King |
Fully Dynamic Transitive Closure. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani |
Fast asynchronous byzantine agreement and leader election with full information. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Louis Lei Yu, Yan Zhuang |
Guanxi in the chinese web - a study of mutual linking. |
WWW |
2008 |
DBLP DOI BibTeX RDF |
stochastic graph modeling, social networks, web graph, web measurement |
| 1 | Yueh-Hua Lee, Alex Thomo, Kui Wu, Valerie King |
Scalable Ubiquitous Data Access in Clustered Sensor Networks. |
SSDBM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young |
Sleeping on the job: energy-efficient and robust broadcast for radio networks. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Scott Lewis, Jared Saia, Maxwell Young |
Choosing a Random Peer in Chord. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
Attack-resistance, Peer-to-peer, Distributed algorithms, Randomized algorithms, Distributed Hash table, Data collection, Chord |
| 1 | Valerie King, Cynthia A. Phillips, Jared Saia, Maxwell Young |
Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee |
Scalable leader election. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Holtby, Bruce M. Kapron, Valerie King |
Lower bound for scalable Byzantine Agreement. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
malicious adversary, non-adaptive adversary, scalable, distributed computing, lower bounds, randomized, Byzantine Agreement, probabilistic |
| 1 | Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee |
Towards Secure and Scalable Computation in Peer-to-Peer Networks. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chong Liu, Kui Wu, Valerie King |
Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks. |
NETWORKING |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Dreef, Sanaz Ahari, Kui Wu, Valerie King |
Utilizing the Uncertainty of Intrusion Detection to Strengthen Security for Ad Hoc Networks. |
ADHOC-NOW |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Carruthers, Valerie King |
Connectivity of Wireless Sensor Networks with Constant Density. |
ADHOC-NOW |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Jared Saia |
Choosing a random peer. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
peer-to-peer, distributed hash table, random sampling |
| 1 | Valerie King, Li Zhang 0001, Yunhong Zhou |
On the complexity of distance-based evolutionary tree reconstruction. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Garry Sagert |
A Fully Dynamic Algorithm for Maintaining the Transitive Closure. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Rauch Henzinger, Valerie King |
Maintaining Minimum Spanning Forests in Dynamic Graphs. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Mikkel Thorup |
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Orna Kupferman, Moshe Y. Vardi |
On the Complexity of Parity Word Automata. |
FoSSaCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Rauch Henzinger, Valerie King, Tandy Warnow |
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Evolutionary biology, Theory of databases, Algorithms, Data structures |
| 1 | Monika Rauch Henzinger, Valerie King |
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
connectivity, dynamic graph algorithms |
| 1 | Valerie King |
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Garry Sagert |
A Fully Dynamic Algorithm for Maintaining the Transitive Closure. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha |
An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King |
A Simpler Minimum Spanning Tree Verification Algorithm. |
Algorithmica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Rauch Henzinger, Valerie King |
Maintaining Minimum Spanning Trees in Dynamic Graphs. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Rauch Henzinger, Valerie King, Tandy Warnow |
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
evolutionary biology, theory of databases, algorithms, data structures |
| 1 | Valerie King |
A Simpler Minimum Spanning Tree Verification Algorithm. |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Rauch Henzinger, Valerie King |
Fully Dynamic Biconnectivity and Transitive Closure. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory |
| 1 | Monika Rauch Henzinger, Valerie King |
Randomized dynamic graph algorithms with polylogarithmic time per operation. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Valerie King |
On Boolean Decision Trees with Faulty Nodes. |
Random Struct. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman |
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Valerie King |
On Boolean Decision Trees with Faulty Nodes. |
ISTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King |
An Omega(n5/4) lower bound on the randomized complexity of graph properties. |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King |
A lower bound for the recognition of digraph properties. |
Combinatorica |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Valerie King, Leonard J. Schulman |
Optimal Randomized Algorithms for Local Sorting and Set-Maxima |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Tzi-cker Chiueh, Randy H. Katz, Valerie King |
Managing the VLSI Design Process. |
MIT-JSME Workshop |
1989 |
DBLP DOI BibTeX RDF |
Design Databases, Groupware, Process Management, Activity Model, Task Specification |
| 1 | Claire Kenyon-Mathieu, Valerie King |
Verifying Partial Orders |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Valerie King |
Lower Bounds on the Complexity of Graph Properties |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #62 of 62 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")