---

Interested in working with me? Please do no hesitate to contact me at .

Postdoc position

While I have no explicit opening for postdocs now, I'd be happy to hear from prospective postdocs with a strong track record and similar research interests.

PhD Positions

I'm looking for highly-motivated PhD students who would like to pursue a career in designing efficient algorithms and data structures. Currently, there is one funded PhD position, with a possibility to start in Fall 2025. The candidates should have a strong background in theoretical computer science or discrete mathematics and complete their undergraduate (master) studies before staring their PhD.

Official advert for the whole institute (if you miss the deadline, let me know).

Summer Internships

I currently do not offer any summer internships. (Apologies for not always responding.)

Bachelor and master students

I'm looking for well-motivated and hard-working students who would like to learn new algorithmic techniques and try a small research topic (there will always be an envisioned outcome of the SW project and for the thesis, you can write a review of the state-of-the-art algorithms and/or provide some experimental insight into the algorithms under consideration). Below you can find particular suggestions for individual software project (SW; „ročníkový projekt“), bachelor (Bc.) or master (Mgr.) theses in areas of my interest. I'm also open to lead a project in a related area, such as in approximation algorithms.

If you're interested in working on a bachelor or master thesis with me, let me know soon as I only have a couple of places available every year. Preference would be given to students involved in a correspondence seminar ("korespondenční seminář") or who demonstrate strong programming or mathematical skills.

Streaming algorithms (for processing massive datasets in one pass with small memory); some examples of possible topics:

• quantile estimation – SW, Bc., Mgr., Ph.D.
• Finding frequent elements (heavy hitters) – SW, Bc. An example of possible SW/Bc. project: benchmarking several known approaches for heavy hitters
• Geometric streaming algorithms – SW, Bc., Mgr., Ph.D. An example of SW/Bc. project (currently investigated by one of my students):
  • Clustering high-dimensional spaces. The goal would be to experimentally evaluate a recent parallel algorithm for clustering
• packing or scheduling problems in streaming – SW, Bc., Mgr. (more theoretically inclined topics, although with a possibility to carry out some experiments for the SW project)

Algorithms for processing large genomic data (SW, Bc., Mgr., Ph.D.). An example of SW/Bc. project:

• Computing approximate using small memory and a few passes over the input, directly from genome assemblies.

Online algorithms (in essence, they are about making decisions without any knowledge of the future; see also competitive analysis)

• packet scheduling or other buffer management problems – Bc. (theoretical), Mgr.