Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="King, Valerie"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Byzantine agreement in polynomial expected time
Valerie King
,
Jared Saia
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 401-410
Kinetic data structures for all nearest neighbors and closest pair in the plane
Zahed Rahmati
,
Valerie King
,
Sue Whitesides
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 137-144
Kinetic and stationary point-set embeddability for plane graphs
Zahed Rahmati
,
Sue H. Whitesides
,
Valerie King
Lecture Notes in Computer Science
7704
, 2013, pp. 279-290
Sleeping on the job: Energy-efficient and robust broadcast for radio networks
Valerie King
,
Cynthia Phillips
,
Jared Saia
,
Maxwell Young
Algorithmica
61
(3), 2011, pp. 518-554
Breaking the
O(n^2)
bit barrier: Scalable Byzantine agreement with an adaptive adversary
Valerie King
,
Jared Saia
Journal of the ACM
58
(4), 2011, pp. 18: 1-24
Choosing a random peer in chord
Valerie King
,
Scott Lewis
,
Jared Saia
,
Maxwell Young
Algorithmica
49
(2), 2007, pp. 147-169
A fully dynamic algorithm for maintaining the transitive closure
Valerie King
,
Garry Sagert
Journal of Computer and System Sciences
65
(1), 2002, pp. 150-167
Maintaining minimum spanning forests in dynamic graphs
Monika R. Henzinger
,
Valerie King
SIAM Journal on Computing
31
(2), 2001, pp. 364-374
A space saving trick for directed dynamic transitive closure and shortest path algorithms
Valerie King
,
Mikkel Thorup
Lecture Notes in Computer Science
2108
, 2001, pp. 268-277
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Monika R. Henzinger
,
Valerie King
Journal of the ACM
46
(4), 1999, pp. 502-516
A fully dynamic algorithm for maintaining the transitive closure
Valerie King
,
Garry Sagert
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 492-498
Maintaining minimum spanning trees in dynamic graphs
Monika R. Henzinger
,
Valerie King
Lecture Notes in Computer Science
1256
, 1997, pp. 594-604
An optimal EREW PRAM algorithm for minimum spanning tree verification
Valerie King
,
Chung Keung Poon
,
Vijaya Ramachandran
,
Santanu Sinha
Information Processing Letters
62
(3), 1997, pp. 153-159
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Faith E. Fich
,
Russell Impagliazzo
,
Bruce Kapron
,
Valerie King
,
Mirosƚaw Kutyƚowski
Journal of Computer and System Sciences
53
(1), 1996, pp. 104-111
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
Monika Rauch Henzinger
,
Valerie King
,
Tandy Warnow
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 333-340
A simpler minimum spanning tree verification algorithm
Valerie King
Lecture Notes in Computer Science
955
, 1995, pp. 440-448
Fully dynamic biconnectivity and transitive closure
Monika Rauch Henzinger
,
Valerie King
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 664-672
Randomized dynamic graph algorithms with polylogarithmic time per operation
Monika Rauch Henzinger
,
Valerie King
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 519-527
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Faith E. Fich
,
Russell Impagliazzo
,
Bruce Kapron
,
Valerie King
,
Mirosƚaw Kutyƚowski
Lecture Notes in Computer Science
665
, 1993, pp. 386-397
Optimal randomized algorithms for local sorting and set-maxima
Wayne Goddard
,
Claire Kenyon
,
Valerie King
,
Leonard J. Schulman
SIAM Journal on Computing
22
(2), 1993, April, pp. 272-283
An
\Omega(n^{5/4})
lower bound on the randomized complexity of graph properties
Valerie King
Combinatorica
11
, 1991, pp. 23-32
Verifying partial orders
Claire Kenyon-Mathieu
,
Valerie King
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 367-374
Lower bounds on the complexity of graph properties
Valerie King
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 468-476
An
\Omega(n^{8/7})
lower bound on the randomized complexity of graph properties
Valerie King
Technical Report (UCB/CSD 87/364), 1987, July