Pavel Veselýمشاهده پروفایل
استادیار
Pavel Veselý is an Assistant Professor at the Computer Science Institute of the Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. His research focuses on the design and analysis of efficient algorithms and data structures, particularly in streaming, online, and approximation algorithms, with applications in bioinformatics and data privacy. His research interests include: Streaming algorithms for quantile estimation, geometric problems, and adversarial robustness Online algorithms, especially in scheduling and buffer management Approximation algorithms, including shortest superstrings and their use in genomic data (k-mer sets) Randomized algorithms and algorithmic data privacy His recent work has advanced the state of the art in streaming quantile estimation (KLL sketch), indexed k-mer representations using masked superstrings, and streaming facility location in high dimensions. His publications appear in top venues such as FOCS, STOC, PODS, and SODA. Notable scientific awards include: Best Paper Award at PODS 2021 2022 ACM SIGMOD Research Highlight Award Supervision of award-winning student theses, including Dean’s Award and Czech-Slovak competition wins He actively advises students, including PhD and master’s level researchers, and leads a research group focused on data sketches and streaming algorithms. He has taught courses such as Algorithmic Data Privacy, Randomized Algorithms, and Streaming Algorithms, and previously served as a postdoc at the University of Warwick under Graham Cormode.










