| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
CoRR
|
| 2025 | J | jnl |
CoRR
|
| 2025 | A* | conf |
COLT
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
Exp. Math.
|
| 2025 | A* | conf |
STOC
|
| 2025 | J | jnl |
CoRR
|
| 2024 | A* | conf |
FOCS
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
IEEE Trans. Inf. Theory
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing.
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | A* | conf |
SODA
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Found. Comput. Math.
|
| 2024 | A* | conf |
FOCS
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
SIAM J. Discret. Math.
|
| 2023 | A | conf |
CCC
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
Math. Oper. Res.
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
SIAM J. Discret. Math.
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A* | conf |
SODA
|
| 2022 | J | jnl |
CoRR
|
| 2021 | J | jnl |
Math. Program.
|
| 2021 | — | conf |
MSML
|
| 2021 | A* | conf |
COLT
|
| 2021 | A* | conf |
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs.
COLT
|
| 2021 | J | jnl |
CoRR
|
| 2021 | J | jnl |
IEEE Trans. Inf. Theory
|
| 2021 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | A | conf |
ITCS
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs.
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2019 | J | jnl |
CoRR
|
| 2019 | J | jnl |
CoRR
|
| 2019 | J | jnl |
CoRR
|
| 2019 | J | jnl |
CoRR
|