Spremljaj
Pavel Veselý
Pavel Veselý
Computer Science Institute of Charles University, Prague, Czech Republic
Preverjeni e-poštni naslov na iuuk.mff.cuni.cz - Domača stran
Naslov
Navedeno
Navedeno
Leto
Online algorithms for multilevel aggregation
M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarczný, Ł Jeż, ...
Operations Research 68 (1), 214-232, 2020
36*2020
Relative Error Streaming Quantiles
G Cormode, Z Karnin, E Liberty, J Thaler, P Veselý
Journal of the ACM 70 (5), 1-48, 2023
282023
Online colored bin packing
M Böhm, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 35-46, 2014
232014
A tight lower bound for comparison-based quantile summaries
G Cormode, P Veselý
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020
202020
Better algorithms for online bin stretching
M Böhm, J Sgall, R van Stee, P Veselý
International Workshop on Approximation and Online Algorithms, 23-34, 2014
18*2014
Parameterized approximation schemes for steiner trees with small number of steiner vertices
P Dvorák, AE Feldmann, D Knop, T Masarík, T Toufar, P Veselý
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
162018
A two-phase algorithm for bin stretching with stretching factor 1.5
M Böhm, J Sgall, R Van Stee, P Veselý
Journal of Combinatorial Optimization 34, 810-828, 2017
16*2017
A -Competitive Algorithm for Scheduling Packets with Deadlines
P Veselý, M Chrobak, Ł Jeż, J Sgall
SIAM Journal on Computing 51 (5), 1626-1691, 2022
152022
Streaming facility location in high dimension via geometric hashing
A Czumaj, SHC Jiang, R Krauthgamer, P Veselý, M Yang
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
132022
Online packet scheduling with bounded delay and lookahead
M Böhm, M Chrobak, Ł Jeż, F Li, J Sgall, P Veselý
Theoretical Computer Science 776, 95-113, 2019
122019
Colored bin packing: Online algorithms and lower bounds
M Böhm, G Dósa, L Epstein, J Sgall, P Veselý
Algorithmica 80, 155-184, 2018
122018
Parameterized approximation schemes for steiner trees with small number of steiner vertices
P Dvorák, AE Feldmann, D Knop, T Masarík, T Toufar, P Vesely
SIAM Journal on Discrete Mathematics 35 (1), 546-574, 2021
112021
Theory meets practice at the median: A worst case comparison of relative error quantile algorithms
G Cormode, A Mishra, J Ross, P Veselý
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
92021
Online bin stretching with three bins
M Böhm, J Sgall, R van Stee, P Veselý
Journal of Scheduling 20, 601-621, 2017
92017
Improved analysis of online balanced clustering
M Bienkowski, M Böhm, M Koutecký, T Rothvoß, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 224-233, 2021
82021
Streaming algorithms for bin packing and vector scheduling
G Cormode, P Veselý
Theory of Computing Systems 65, 916-942, 2021
72021
Streaming algorithms for geometric Steiner forest
A Czumaj, SHC Jiang, R Krauthgamer, P Veselý
ACM Transactions on Algorithms, 2021
62021
Online chromatic number is pspace-complete
M Böhm, P Veselý
Theory of Computing Systems 62, 1366-1391, 2018
62018
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios
M Englert, N Matsakis, P Veselý
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
52022
Packet scheduling: Plans, monotonicity, and the golden ratio
P Veselý
ACM SIGACT News 52 (2), 72-84, 2021
52021
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20