DS
Dmitry Sokolov
cs.CCmath.COcs.DScs.LO
On Valency
published · living versionsW_4qe8pqu3·v1 · currentpublished
Preprints & journals
9 papers in the corpus · 2014–2025Sampling Permutations with Cell Probes is Hard2512.02724v1 · Yaroslav Alekseev, Mika Goos, Konstantin Myasnikov et al.2025 · 0 citationsarXiv
Monotone Circuit Complexity of Matching2507.16105v2 · Bruno Cavalar, Mika Goos, Artur Riazanov et al.2025 · 1 citationarXiv
Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication2507.12124v1 · Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov et al.2025 · 0 citationsarXiv
Sign-Rank of -Hamming Distance is Constant2506.12022v2 · Mika Goos, Nathaniel Harms, Valentin Imbach et al.2025 · 0 citationsarXiv
Supercritical Tradeoffs for Monotone Circuits2411.14268v1 · Mika Goos, Gilbert Maystre, Kilian Risse et al.2024 · 0 citationsarXiv
Sampling and Certifying Symmetric Functions2305.04363v1 · Yuval Filmus, Itai Leigh, Artur Riazanov et al.2023 · 0 citationsarXiv
Top-Down Lower Bounds for Depth-Four Circuits2304.02555v2 · Mika Goos, Artur Riazanov, Anastasia Sofronova et al.2023 · 4 citationsarXiv
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs1912.00534v2 · Susanna F. de Rezende, Jakob Nordstrom, Kilian Risse et al.2019 · 2 citationsTheoretiCS, Volume 4 (March 25, 2025) theoretics:13076
Tree-like resolution complexity of two planar problems1412.1124v1 · Dmitry Itsykson, Anna Malova, Vsevolod Oparin et al.2014 · 0 citationsarXiv
Career total: 41 works. 9 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.