12 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.CG2012
Approximating Majority Depth
Dan Chen, Pat Morin
We consider the problem of approximating the majority depth (Liu and Singh, 1993) of a point q with respect to an n-point set, S, by random sampling. At the heart of this problem i…
cs.CG2009★ 12 cited
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
Dan Chen, Luc Devroye, Vida Dujmovic +1
A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coor…