Artur Riazanov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
13
Venues
8
Active years
2018–2026
Best venue rank
A*
Where they publish
Papers
13 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Spiky Rank and Its Applications to Rigidity and Circuits. | Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman |
| 2026 | ICALP | Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity. | Susanna F. de Rezende, David Engstrm, Yassine Ghannane, Duri Andrea Janett, Artur Riazanov |
| 2026 | STOC | Sampling Permutations with Cell Probes Is Hard. | Yaroslav Alekseev, Mika Gs, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov |
| 2026 | STOC | Monotone Circuit Complexity of Matching. | Bruno Cavalar, Mika Gs, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov |
| 2026 | STOC | Pseudodeterministic Communication Complexity. | Mika Gs, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan |
| 2025 | CRYPTO | Breaking Verifiable Delay Functions in the Random Oracle Model. | Ziyi Guan, Artur Riazanov, Weiqiang Yuan |
| 2024 | STOC | Hardness Condensation by Restriction. | Mika Gs, Ilan Newman, Artur Riazanov, Dmitry Sokolov |
| 2023 | FOCS | Top-Down Lower Bounds for Depth-Four Circuits. | Mika Gs, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov |
| 2022 | LATIN | MCSP is Hard for Read-Once Nondeterministic Branching Programs. | Ludmila Glinskih, Artur Riazanov |
| 2022 | MFCS | Automating OBDD proofs is NP-hard. | Dmitry Itsykson, Artur Riazanov |
| 2022 | SAT | Tight Bounds for Tseitin Formulas. | Dmitry Itsykson, Artur Riazanov, Petr Smirnov |
| 2019 | MFCS | Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. | Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova |
| 2018 | CSR | On the Decision Trees with Symmetries. | Artur Riazanov |