Email: svyatoslav.i.gryaznov@gmail.com
Website: https://nightuser.fun (work in progress, will be updated soon)
Link to CV: https://nightuser.fun/cv.pdf (backup: https://drive.google.com/file/d/1t0Unt-sPKuNm5U0AsrX5XHtt2HA3bswX/view?usp=sharing)
Level: PhD, Internship
Keywords: TCS,PhD,combinatorics,proof theory,circuit complexity
Short bio / research interests / publications: I am a PhD student at PDMI RAS primarily interested in TCS and combinatorics. My latest research was devoted to proof systems–in particular, Res-Lin proof system over finite fields and related computational models extending branching programs–and circuit complexity–one of the last paper (joint work) explores Valiant’s program posing a combinatorial hypergraph-related problem. The latter work also involves a few problems related to extremal graph theory, which seem to be interesting on their own. Overall, my research interests include algebraic proof systems, Boolean function complexity (in particular, progress towards strong AC0-Xor lower bounds), extremal combinatorics. See CV or https://dblp.org/pid/243/3837.html for a list of publications related to TCS.