Hi!
Hi, I’m Jannis, welcome to my site. I’m a software engineer and computer scientist. A recurring theme for me are SAT and SMT solvers, but while working on my projects, I’m always learning and trying new things from a wide range of areas, be it group theory, hardware design, or anything else that might be useful or just sounds interesting to me.
On my projects page and blog you can see some of the things I’ve been working on.
If you’re interested in anything on this site and have comments or want to know more, feel free to contact me. You can reach me on Mastodon or by email.
Recent Blog Posts
Uniformly Random High-Degree Regular Graphs are Asymptotically Almost Surely Link-Irregular
A proof that uniformly random high-degree regular graphs are asymptotically almost surely link-irregular, providing another counterexample to a recent conjecture.
Proving 50-Year-Old Sorting Networks Optimal: Part 2
Partial sorting networks and recursive minimal size computation.
Proving 50-Year-Old Sorting Networks Optimal: Part 1
Introducing the problem of minimal size sorting networks and summarizing the previous state of the art.
Projects
Proving the optimal size of 11 and 12 input sorting networks
Research project to find the optimal size of sorting networks with 11 and 12 inputs.
Flussab
Rust utilities for writing fast parsers, and parsers for some formats including DIMACS CNF.
Varisat
A CDCL based SAT solver written in Rust.