Please read our student and staff community guidance on COVID-19
Skip to main content Skip to navigation

Pavel Veselý

Welcome! I am currently a postdoc (officially called Research Fellow) of professor Graham Cormode.
In years 2014-2018, I was a PhD student at Computer Science Institute of Charles University in Prague. My adviser was professor Jiří Sgall.
More about me can be found in CV.

I will serve on the Program Committee of WAOA 2020.

Contact

Room: 2.31, Computer Science building, University of Warwick
Email: pavel dot vesely at warwick dot ac dot uk

News

  • 16. 1. 2020: We updated the arXiv version of our optimal lower bound for quantile summaries (or, more simply, for finding the median in a data stream). We've added more intuition on how it works, and also included a new (relatively simple) lower bound for a related problem of biased quantiles.
  • 1. 7. 2019: We updated the arXiv version of the packet scheduling paper with a φ-competitive algorithm. The analysis is rewritten in an equivalent way that is hopefully more intuitive, and some other parts of the paper are also revised. Stay tuned, another revision will follow in O(1) months!
  • 14. 5. 2019: Two new papers about streaming algorithms appeared at arXiv: one with a tight lower bound for quantile summaries and the other about bin packing and vector scheduling.
  • 25. 9. 2018: I successfully defended my thesis, which ended up my studies (after 4 years of PhD, 9 years at Charles University, and 22 years in total!).
  • 3. 9. 2018: I have started as a postdoc of Graham Cormode at the University of Warwick.

Research Interests

I am interested in theoretical computer science and combinatorics, with particular focus on designing efficient algorithms and data structures, specifically:
  • streaming algorithms,
  • online algorithms (currently mainly for buffer management problems),
  • approximation algorithms,
  • packing and scheduling problems,

and more.

Some recent collaborators

Publications