Interested in working with me? Please do no hesitate to contact me at .
A one-year postdoc position (with a possibility of extension) is available at Computer Science Institute of Charles University in Prague, hosted by Pavel Veselý. The starting date is negotiable (Fall 2024 or Winter 2025).
We're looking for a candidate with a strong background in algorithms who has completed / will soon complete their Ph.D. degree in theoretical computer science or mathematics within the last 5 years (with exceptions for individual circumstances such as parental leave). The successful candidate will pursue research in designing efficient algorithms and data structures, such as streaming algorithms (e.g., for quantile estimation or geometric problems); online scheduling algorithms; or data structures for genomic data.
Computer Science Institute of Charles University is a lively, excellent, and inspiring workplace located in the beautiful historical center of Prague. Prague's location in the heart of Europe makes it easy to travel to many attractive locations, be it for work or leisure. Come join us!
Practical information:
The application should contain:
Informal inquiries and applications should be sent to .
Deadline for the applications: June 26, 2024 (all applications received by the deadline will be considered; later applications will be processed until the position is filled).
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.I currently do not offer any summer internships. (Apologies for not always responding.)
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.
Some of the topics below are suitable for doctoral (Ph.D.) research as well.
Streaming algorithms (for processing massive datasets in one pass with small memory); some examples of possible topics:
Applications of string or streaming algorithms in bioinformatics (SW, Bc., Mgr.)
Online algorithms (in essence, they are about making decisions without any knowledge of the future; see also competitive analysis)