3 citations · 3 across the 2 of their papers we have counts for
3 papers
Top- ranking with a monotone adversary
Yuepeng Yang, Antares Chen, Lorenzo Orecchia +1
In this paper, we address the top- ranking problem with a monotone adversary. We consider the scenario where a comparison graph is randomly generated and the adversary is allowe…
Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs
Antares Chen, Neng Huang, Kunal Marwaha
We construct and analyze a message-passing algorithm for random constraint satisfaction problems (CSPs) at large clause density, generalizing work of El Alaoui, Montanari, and Sell…
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians
Konstantinos Ameranis, Antares Chen, Adela DePavia +2
The development of simple and fast hypergraph spectral methods has been hindered by the lack of numerical algorithms for simulating heat diffusions and computing fundamental object…