research
∙
07/14/2021
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time
We consider the problem of sampling and approximately counting an arbitr...
share
research
∙
02/15/2021
Local Access to Random Walks
For a graph G on n vertices, naively sampling the position of a random w...
research
∙
10/06/2020
Testing Tail Weight of a Distribution Via Hazard Rate
Understanding the shape of a distribution of data is of interest to peop...
research
∙
03/02/2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Over the past decade, there has been increasing interest in distributed/...
research
∙
02/19/2020
Parallel Algorithms for Small Subgraph Counting
Subgraph counting is a fundamental problem in analyzing massive graphs, ...
research
∙
11/29/2017
