---

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

Postdoc position

Currently, I do not have an open postdoc position.

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 Winter or 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.

If you're interested, send me your professional CV with a statement of research interests, and contact details (email address) of 1-2 references.

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. An example of possible SW/Bc. project:
  • Attacks and robustness of quantile summaries. Recent work has compared a heuristic called t-digest and a relative-error streaming algorithm for estimating quantiles. While the former uses very little space, independent of the input size, but is not robust, the latter provides worst-case guarantees but its space usage grows with time. These two algorithms use very different techniques, and the question is whether we can get "best of both worlds". The project goal would be to evaluate algorithms that combine both approaches.
• Geometric streaming algorithms – SW, Bc., Mgr., Ph.D. An example of SW/Bc. project:
  • 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)

Applications of string or streaming algorithms in bioinformatics (SW, Bc., Mgr.)

• Intended for processing large genomic data

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.