Valerie King

activity

20072022

most citedBreaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary

46 citations · 67 across the 18 of their papers we have counts for

collaborators

Showing cs.CGShow all

4 papers · 1 filter

cs.CG2014

Kinetic $k$ -Semi-Yao Graph and its Applications

Zahed Rahmati, Mohammad Ali Abam, Valerie King +1

This paper introduces a new proximity graph, called the $k$ -Semi-Yao graph ( $k$ -SYG), on a set $P$ of points in $R^{d}$ , which is a supergraph of the $k$ -nearest neighbor gr…

cs.CG2014

Kinetic Reverse $k$ -Nearest Neighbor Problem

Zahed Rahmati, Valerie King, Sue Whitesides

This paper provides the first solution to the kinetic reverse $k$ -nearest neighbor (\rknn) problem in $R^{d}$ , which is defined as follows: Given a set $P$ of $n$ moving poi…

cs.CG2013

A Simple, Faster Method for Kinetic Proximity Problems

Zahed Rahmati, Mohammad Ali Abam, Valerie King +2

For a set of $n$ points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neigh…

cs.CG2013★ 1 cited

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d

Zahed Rahmati, Mohammad Ali Abam, Valerie King +1

This paper presents a simple kinetic data structure for maintaining all the nearest neighbors of a set of $n$ moving points in $R^{d}$ , where the trajectory of each point is…

Kinetic k-Semi-Yao Graph and its Applications

Kinetic Reverse k-Nearest Neighbor Problem

A Simple, Faster Method for Kinetic Proximity Problems

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d

Kinetic $k$ -Semi-Yao Graph and its Applications

Kinetic Reverse $k$ -Nearest Neighbor Problem