Dmitry Sokolov
Scholar

Dmitry Sokolov

Google Scholar ID: oagK8yUAAAAJ
École Polytechnique Fédérale de Lausanne
Google Scholar↗
Citations & Impact
All-time
Citations
344
 
H-index
10
 
i10-index
10
 
Publications
20
 
Co-authors
13
list available
Contact
No contact links provided.
Publications
6 items
Sampling Permutations with Cell Probes is Hard
2025
Cited
0
Pseudodeterministic Communication Complexity
2025
Cited
0
Monotone Circuit Complexity of Matching
2025
Cited
0
Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
2025
Cited
0
Sign-Rank of $k$-Hamming Distance is Constant
Electron. Colloquium Comput. Complex. · 2025
Cited
0
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
Electron. Colloquium Comput. Complex. · 2019
Cited
3
Resume (English only)
Co-authors
13 total
Co-author 1
Co-author 1
Mika Göös
Mika Göös
EPFL
Jakob Nordström
Jakob Nordström
University of Copenhagen and Lund University
Susanna F. de Rezende
Susanna F. de Rezende
Lund University
Co-author 5
Co-author 5
Pritish Kamath
Pritish Kamath
Google Research
Sam Buss
Sam Buss
Professor of Mathematics and Computer Science
Ankit Garg
Ankit Garg
Microsoft Research