The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Valerie King: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Monika Rauch Henzinger, Valerie King
    Fully Dynamic Biconnectivity and Transitive Closure. [Citation Graph (1, 0)][DBLP]
    FOCS, 1995, pp:664-672 [Conf]
  2. Sarah Carruthers, Valerie King
    Connectivity of Wireless Sensor Networks with Constant Density. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2004, pp:149-157 [Conf]
  3. Dennis Dreef, Sanaz Ahari, Kui Wu, Valerie King
    Utilizing the Uncertainty of Intrusion Detection to Strengthen Security for Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2004, pp:82-95 [Conf]
  4. Valerie King, Mikkel Thorup
    A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:268-277 [Conf]
  5. Valerie King
    Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:81-91 [Conf]
  6. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
    Towards Secure and Scalable Computation in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:87-98 [Conf]
  7. Valerie King, Orna Kupferman, Moshe Y. Vardi
    On the Complexity of Parity Word Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:276-286 [Conf]
  8. Monika Rauch Henzinger, Valerie King
    Maintaining Minimum Spanning Trees in Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:594-604 [Conf]
  9. Claire Kenyon, Valerie King
    On Boolean Decision Trees with Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:24-31 [Conf]
  10. Tzi-cker Chiueh, Randy H. Katz, Valerie King
    Managing the VLSI Design Process. [Citation Graph (0, 0)][DBLP]
    MIT-JSME Workshop, 1989, pp:183-199 [Conf]
  11. Chong Liu, Kui Wu, Valerie King
    Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2005, pp:956-967 [Conf]
  12. Dan Holtby, Bruce M. Kapron, Valerie King
    Lower bound for scalable Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:285-291 [Conf]
  13. Valerie King, Jared Saia
    Choosing a random peer. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:125-130 [Conf]
  14. Monika Rauch Henzinger, Valerie King, Tandy Warnow
    Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:333-340 [Conf]
  15. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
    Scalable leader election. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:990-999 [Conf]
  16. Valerie King, Li Zhang, Yunhong Zhou
    On the complexity of distance-based evolutionary tree reconstruction. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:444-453 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:386-397 [Conf]
  18. Wayne Goddard, Valerie King, Leonard J. Schulman
    Optimal Randomized Algorithms for Local Sorting and Set-Maxima [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:45-53 [Conf]
  19. Monika Rauch Henzinger, Valerie King
    Randomized dynamic graph algorithms with polylogarithmic time per operation. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:519-527 [Conf]
  20. Claire Kenyon-Mathieu, Valerie King
    Verifying Partial Orders [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:367-374 [Conf]
  21. Valerie King
    Lower Bounds on the Complexity of Graph Properties [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:468-476 [Conf]
  22. Valerie King, Garry Sagert
    A Fully Dynamic Algorithm for Maintaining the Transitive Closure. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:492-498 [Conf]
  23. Valerie King
    A Simpler Minimum Spanning Tree Verification Algorithm. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:440-448 [Conf]
  24. Monika Rauch Henzinger, Valerie King, Tandy Warnow
    Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:1, pp:1-13 [Journal]
  25. Valerie King
    A Simpler Minimum Spanning Tree Verification Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:2, pp:263-270 [Journal]
  26. Valerie King
    A lower bound for the recognition of digraph properties. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:53-59 [Journal]
  27. Valerie King
    An Omega(n5/4) lower bound on the randomized complexity of graph properties. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:23-32 [Journal]
  28. Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha
    An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:3, pp:153-159 [Journal]
  29. Monika Rauch Henzinger, Valerie King
    Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:4, pp:502-516 [Journal]
  30. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:104-111 [Journal]
  31. Valerie King, Garry Sagert
    A Fully Dynamic Algorithm for Maintaining the Transitive Closure. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:1, pp:150-167 [Journal]
  32. Claire Kenyon, Valerie King
    On Boolean Decision Trees with Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:453-464 [Journal]
  33. Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman
    Optimal Randomized Algorithms for Local Sorting and Set-Maxima. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:272-283 [Journal]
  34. Monika Rauch Henzinger, Valerie King
    Maintaining Minimum Spanning Forests in Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:364-374 [Journal]
  35. Valerie King, Cynthia Phillips, Jared Saia, Maxwell Young
    Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  36. Sleeping on the job: energy-efficient and robust broadcast for radio networks. [Citation Graph (, )][DBLP]


  37. Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary. [Citation Graph (, )][DBLP]


  38. Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary. [Citation Graph (, )][DBLP]


  39. Fast asynchronous byzantine agreement and leader election with full information. [Citation Graph (, )][DBLP]


  40. Scalable Ubiquitous Data Access in Clustered Sensor Networks. [Citation Graph (, )][DBLP]


  41. From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits. [Citation Graph (, )][DBLP]


  42. Guanxi in the chinese web - a study of mutual linking. [Citation Graph (, )][DBLP]


  43. Guanxi in the Chinese Web. [Citation Graph (, )][DBLP]


  44. Choosing a Random Peer in Chord. [Citation Graph (, )][DBLP]


  45. Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary [Citation Graph (, )][DBLP]


  46. Lower bound for scalable Byzantine Agreement. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002