Artur`s homepage | Artur Riazanov
I am a PhD student at EPFL lucky to be working with Mika Göös. Before that I was at St. Petersburg department of Steklov Institute and at St. Petersburg Academic University working with Dmitry Itsykson. Before going from St. Petersburg to EPFL I had a pleasure to have a long visit at Technion hosted by Yuval Filmus. My research interests include Email: tunyash at gmail dot com Links:
2026 Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity Spiky Rank and Its Applications to Rigidity and Circuits Monotone Circuit Complexity of Matching Pseudodeterministic Communication Complexity Sampling Permutations with Cell Probes is Hard Lower Bounds Beyond DNF of Parities 2025 Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication Equality is Far Weaker than Constant-Cost Communication Generalized Linial-Nisan Conjecture is False for DNFs Breaking Verifiable Delay Functions in the Random Oracle Model…
saved by
related reading
- Nike Sunmath.mit.edu
- Homesites.google.com
- my projectsdan-iel-lee.vercel.app
- Alexander Zlokapa | Physics@MITmit.edu
- Alex Weinalex-wein.com
- Paperscseweb.ucsd.edu
- Bryon Aragam // University of Chicagobryonaragam.com
- Research • Leonid Petrov. Integrable Probabilitylpetrov.cc
- A Universe of Sortspixel-druid.com
- Total Search @ STOC 2025sites.google.com
- Fernando Granha Jeronimo | Theoretical Computer Science | UIUCgranha.github.io
- Gil Kalai, World-Wide-Web Home Pagema.huji.ac.il