Seva Oparin
Research Scientist and Jack-Of-All-Trades in CS. I can both read the math and design software. Mainly interested in clouds and backend development. Though I don't mind to make a web-interface.
Cloud Computing
I used to work on FB Tupperware System. After some expereince with AWS EC2, I got interested in developing skills with larger scale software.
f(x)
Math Expertise
I have a PhD in Theoretical Computer Science, some expereince with mathematical optimization problems, and also passed Andrew Ng's course on ML.
Self-motivated and
goal oriented
I can move on my own, find people I need in the company. I put achieving the goals over engineering. Also I can mentor others.
Industrial Experience
Facebook, Inc. - Research Scientist - 2016-2020
I worked on end-to-end network data analysis. From building pipeline to manage data-intensive flows to writing mathematical formulas to detect anomalies.
JetBrains - Software Developer - 2010-2011
I contributed to YouTrack, bugtracker developed within the walls of IntelliJ Labs a.k.a JetBrains. I worked both to backend and frontend parts.
Pet Projects
Telegram QR Code Bot
The bot to generate QR codes for telegram for instant contacts. Just start it to generate your own code.
Telegram TagTagBot
Reference Bot that helps people to subscribe on tags and then get notified once the tag is mentioned.
Udemy Course on Geometry
I developed two-hours animated course "2D Geometry for Game Development in Python" to help early beginners learn basics of geometry and programming in Python.
QuotterBack Service
Service that automates quote extraction from Google Doc to Google Spreadhseet.
Publications
[2021] Computational and Proof Complexity of Partial String Avoidability
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin;
ACM Trans. Comput. Theory 13(1): 6:1-6:25 (2021)
[2017] Algorithmic and Hardness Results for the Hub Labeling Problem
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin;
SODA 2017: 1442-1461
[2016] Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles
Dmitriy Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitriy Sokolov;
Fundamenta Informaticae 145 (2016) 1-14
[2016] Computational and Proof Complexity of Partial String Avoidability
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin;
MFCS 2016: 51:1-51:13
[2016] Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle
Vsevolod Oparin;
SAT 2016: 77-84
[2014] Tree-like resolution complexity of two planar problems
Dmitry Itsykson, Anna Malova, Vsevolod Oparin, Dmitry Sokolov;
CoRR abs/1412.1124 (2014)
[2013] Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP
Dmitry Itsykson, Vsevolod Oparin;
CSR 2013: 162-173
Looking for an interesting project
Want to work with me?
Complete this form and I will get back.