An approximation of my appearance (2021).

Pavel Veselý

Assistant Professor
Computer Science Institute
Faculty of Mathematics and Physics (MFF)
Charles University
Office: S326 (recently moved from S323)
Address: Malostranské nám. 25,
   118 00 Praha 1, Czech Republic


  • Feb'23: in my first paper at bioRxiv, we develop a new framework for representing k-mer sets based on the shortest superstring problem (another "theory meets practice" paper). UPDATE: accepted to RECOMB-seq, to appear in iScience.
  • Feb'23: update of the paper on streaming facility location (FOCS'22): thanks to Arnold Filtser, our algorithmic framework gives a constant, that is O(1/ε), approximation in one pass, albeit with space increased to nε.
  • Jul'23: a new paper about parallel (MPC) algorithms for clustering, namely k-median and k-means in Rd, that works well for even for k exceeding the machine local space.
  • Aug'23: The final version of the ReqSketch paper (Relative Error Streaming Quantiles) just accepted in Journal of the ACM!
  • Sep'23: The hidden constant in the last line of my CV has increased ;-) (other parts of CV require more explicit updates, but not now)
Some old stuff