Scholar
Artur Riazanov
Google Scholar ID: 1N9zf0IAAAAJ
EPFL
Citations & Impact
Citations
93
H-index
6
i10-index
3
Publications
20
Co-authors
15
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Paper 'Monotone Circuit Complexity of Matching': Shows that the perfect matching function requires monotone circuits of size 2^{n^{Ω(1)}}, improving Razborov's (1985) lower bound
- Paper 'Breaking Verifiable Delay Functions in the Random Oracle Model' (CRYPTO 2025): Proves that certain VDFs cannot be constructed in the pure random oracle model
- Paper 'Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication' (RANDOM 2025): Demonstrates linear randomized communication complexity for finding falsified clauses in random unsatisfiable formulas
- Paper 'Equality is Far Weaker than Constant-Cost Communication' (RANDOM 2025): Shows that constant-cost randomized protocols cannot be efficiently derandomized using Equality oracles
- Paper 'Generalized Linial-Nisan Conjecture is False for DNFs' (CCC 2025): Provides a counterexample to the generalized Linial-Nisan conjecture for depth-2 circuits (DNFs)
