Pavel Veselý

Orcid: 0000-0003-1169-7934

Affiliations:
  • Charles University, Prague, Czech Republic


According to our database1, Pavel Veselý authored at least 33 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Structural Properties of Search Trees with 2-way Comparisons.
CoRR, 2023

Fully Scalable MPC Algorithms for Clustering in High Dimension.
CoRR, 2023

Approximation Guarantees for Shortest Superstrings: Simpler and Better.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Relative Error Streaming Quantiles.
SIGMOD Rec., 2022

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines.
SIAM J. Comput., 2022

Streaming Facility Location in High Dimension via New Geometric Hashing.
CoRR, 2022

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Streaming Algorithms for Geometric Steiner Forest.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Streaming Facility Location in High Dimension via Geometric Hashing.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
New results on multi-level aggregation.
Theor. Comput. Sci., 2021

Packet Scheduling: Plans, Monotonicity, and the Golden Ratio.
SIGACT News, 2021

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
SIAM J. Discret. Math., 2021

Streaming Algorithms for Bin Packing and Vector Scheduling.
Theory Comput. Syst., 2021

Theory meets Practice: worst case behavior of quantile algorithms.
CoRR, 2021

On packet scheduling with adversarial jamming and speedup.
Ann. Oper. Res., 2021

Improved Analysis of Online Balanced Clustering.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Theory meets Practice at the Median: A Worst Case Comparison of Relative Error Quantile Algorithms.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Online Algorithms for Multilevel Aggregation.
Oper. Res., 2020

A Tight Lower Bound for Comparison-Based Quantile Summaries.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019
Online packet scheduling with bounded delay and lookahead.
Theor. Comput. Sci., 2019

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Logarithmic price of buffer downscaling on line metrics.
Theor. Comput. Sci., 2018

Online Chromatic Number is PSPACE-Complete.
Theory Comput. Syst., 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica, 2018

2017
Online bin stretching with three bins.
J. Sched., 2017

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim., 2017

A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim., 2017

2016
The Best Two-Phase Algorithm for Bin Stretching.
CoRR, 2016

Online Algorithms for Multi-Level Aggregation.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014
Online Colored Bin Packing.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Better Algorithms for Online Bin Stretching.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013
WALTZ: A Strong Tzaar-Playing Program.
Proceedings of the Computer Games - Workshop on Computer Games, 2013


  Loading...