no code implementations • 6 Sep 2023 • Sepehr Assadi, Chen Wang
Here, $n$ is the number of arms and $\Delta$ is the reward gap between the best and the second-best arms.
no code implementations • 29 Sep 2021 • Sepehr Assadi, Chen Wang
We present a new approach for solving (minimum disagreement) correlation clustering that results in sublinear algorithms with highly efficient time and space complexity for this problem.
no code implementations • 9 Apr 2020 • Sepehr Assadi, Chen Wang
In particular, algorithms with optimal sample complexity (number of coin tosses) have been known for this problem for quite some time.
2 code implementations • 24 Jul 2018 • Sepehr Assadi, Yu Chen, Sanjeev Khanna
Any graph with maximum degree $\Delta$ admits a proper vertex coloring with $\Delta + 1$ colors that can be found via a simple sequential greedy algorithm in linear time and space.
Data Structures and Algorithms