The following pages link to Valerie King (Q290235):
Displaying 50 items.
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- (Q810042) (redirect page) (← links)
- A lower bound for the recognition of digraph properties (Q810043) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology (Q1293865) (← links)
- A simpler minimum spanning tree verification algorithm (Q1355729) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- Limits on the power of parallel random access machines with weak forms of write conflict resolution (Q1816745) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- Lower bound for scalable Byzantine agreement (Q2377258) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Choosing a random peer in Chord (Q2461543) (← links)
- (Q2769435) (← links)
- Maintaining Minimum Spanning Forests in Dynamic Graphs (Q2784458) (← links)
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication (Q2796243) (← links)
- Fast asynchronous Byzantine agreement and leader election with full information (Q2930350) (← links)
- Sleeping on the job (Q2934350) (← links)
- Conflict on a communication channel (Q2943406) (← links)
- Kinetic Reverse k-Nearest Neighbor Problem (Q2946067) (← links)
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation (Q3158547) (← links)
- Byzantine Agreement in Expected Polynomial Time (Q3177770) (← links)
- Simultaneous Secrecy and Reliability Amplification for a General Channel Model (Q3179359) (← links)
- (Q3579423) (← links)
- Scalable leader election (Q3581515) (← links)
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits (Q3646244) (← links)
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima (Q4032937) (← links)
- (Q4234100) (← links)
- (Q4252752) (← links)
- (Q4281540) (← links)
- On boolean decision trees with faulty nodes (Q4306374) (← links)
- (Q4471327) (← links)
- (Q4553236) (← links)
- Maintaining minimum spanning trees in dynamic graphs (Q4571989) (← links)
- (Q4875203) (← links)
- Kinetic and Stationary Point-Set Embeddability for Plane Graphs (Q4912210) (← links)
- A simpler minimum spanning tree verification algorithm (Q5057455) (← links)
- (Q5090930) (← links)
- Kinetic data structures for all nearest neighbors and closest pair in the plane (Q5174471) (← links)
- Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (Q5176217) (← links)
- Lower bound for scalable Byzantine Agreement (Q5177290) (← links)
- A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds (Q5197684) (← links)
- Faster Agreement via a Spectral Method for Detecting Malicious Behavior (Q5384019) (← links)
- Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (Q5395663) (← links)
- Byzantine agreement in polynomial expected time (Q5495810) (← links)
- Choosing a random peer (Q5501491) (← links)
- Dynamic graph connectivity in polylogarithmic worst case time (Q5741790) (← links)
