307 citations · 907 across the 65 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022★ 1 cited
Random graph matching at Otter's threshold via counting chandeliers
Cheng Mao, Yihong Wu, Jiaming Xu +1
We propose an efficient algorithm for graph matching based on similarity scores constructed from counting a certain family of weighted trees rooted at each vertex. For two Erdős-Ré…
cs.DS2019★ 1 cited
Consistent recovery threshold of hidden nearest neighbor graphs
Jian Ding, Yihong Wu, Jiaming Xu +1
Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden -nearest…
cs.DS2013★ 2 cited
Tight Lower Bound for Linear Sketches of Moments
Alexandr Andoni, Huy L. Nguyen, Yury Polyanskiy +1
The problem of estimating frequency moments of a data stream has attracted a lot of attention since the onset of streaming algorithms [AMS99]. While the space complexity for approx…