Jakub Sosnovec

About me

I work as Software Engineer in Pure Storage. I work on our master data management system in Python and SQL on AWS, Snowflake and Postgres.

Before, I worked as an Embedded Vision Software Engineer at NXP Semiconductors, where I developed high-performance middleware for software driven vehicles in C++ and implemented PCIe drivers for Linux. Before that, I was a Computer Vision Software Engineer at Sanezoo, where I utilized the CUDA framework to accelerate machine learning for stereo image processing and robotics. And before that, I spent a year in Edinburgh, UK, working as a Software Engineer at Codeplay. My work there was focused on implementing AI on heterogeneous systems via the open standards OpenCL and SYCL. Finally, I started my career in software as an Intern C++ Programmer at Bohemia Interactive Simulations in Prague, working on a training simulation engine.

In my past academic life, I was a mathematician working in the areas of theoretical computer science and discrete mathematics. I published a few papers, gave a few talks and attended a few conferences. I also taught seminars for undergraduates.

I graduated with an MSc by Research in Computer Science at University of Warwick.  My supervisor was Dan Král'.  I got an undergraduate degree at Charles University in Prague.

My (usually obsolete) CV can be found here and LinkedIn here.

Contact

Email address: j.sosnovec -at- email.cz.

Research

Talks:


My research in Warwick mainly included graph colouring, extremal combinatorics, in particular dense graph limits, and combinatorial and computational geometry.

My Master thesis was concerned with the theory of dense graph limits. A graphon is an analytic object representing a convergent sequence of large graphs. I studied finitely forcible graphons, which are graphons uniquely determined by finitely many subgraph densities. I gave a new construction generalizing a previous result.

My Bachelor thesis was focused on the area of combinatorial geometry. In particular, I dealt with combinatorial properties of spheres and zero sets of real polynomials and studied assumptions needed to formulate Helly-type theorems on such sets.

Teaching

2016/2017 Term 1: CS260 Algorithms. Seminar groups 5 (Thursdays 15:00-16:00 in CS1.01) and 7 (Fridays 11:00-12:00 in S0.20)

2016/2017 Term 2: MA3J2 Combinatorics II. Seminar group 1 (Thursdays 17:00-18:00 in H0.58)

Some links that I find interesting