https://curiouscoding.nl/authors/johannes-breitling/Recent content in Johannes Breitling on CuriousCodingHugoenSun, 20 Jul 2025 00:00:00 +0200https://curiouscoding.nl/slides/quickheap-text/Sun, 20 Jul 2025 00:00:00 +0200https://curiouscoding.nl/slides/quickheap-text/<script src="https://curiouscoding.nl/livereload.js?mindelay=10&amp;v=2&amp;port=1313&amp;path=livereload" data-no-instant defer></script> <h2 id="me"> Ragnar {Groot Koerkamp} <a class="heading-link" href="#me"> <i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"></i> <span class="sr-only">Link to heading</span> </a> </h2> <ul> <li>Did IMO &amp; ICPC; currently head-of-jury for NWERC.</li> <li>Some time at Google.</li> <li>Quit and solved all of <a href="https://projecteuler.net/" class="external-link" target="_blank" rel="noopener">projecteuler.net</a> (700+) during Covid.</li> <li>PhD on <em>high throughput bioinformatics</em> @ ETH Zurich.</li> <li>Now postdoc @ KIT Karlsruhe. <ul> <li>Lots of sequenced DNA that needs processing.</li> <li>Many <em>static</em> datasets, e.g. a 3GB human genome.</li> <li>Revisiting basic algorithms and optimizing them to the limit.</li> <li>Good in theory \(\neq\) fast in practice.</li> </ul> </li> <li>Last year&rsquo;s talk on 40x faster binary search: <a href="https://curiouscoding.nl/slides/p99" class="external-link" target="_blank" rel="noopener">https://curiouscoding.nl/slides/p99</a></li> </ul> <p>\[ \newcommand{\push}{\mathsf{push}} \newcommand{\pop}{\mathsf{pop}} \]</p>