The Library
Browse by Warwick Author
Up a level |
Jump to: Journal Article | Conference Item
Number of items: 13.
Journal Article
Cormode, Graham, Karnin, Zohar, Liberty, Edo, Thaler, Justin and Veselý, Pavel (2023) Relative error streaming quantiles. Journal of the ACM, 70 (5). pp. 1-48. doi:10.1145/3617891 ISSN 0004-5411.
Cormode, Graham and Veselý, Pavel (2021) Streaming algorithms for bin packing and vector scheduling. Theory of Computing Systems, 65 . pp. 916-942. doi:10.1007/s00224-020-10011-y ISSN 1432-4350.
Dvořák, Pavel, Feldmann, Andreas Emil, Knop, Dušan, Masařík, Tomáš, Toufar, Tomáš and Veselý, Pavel (2021) Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. SIAM Journal on Discrete Mathematics, 35 (1). pp. 546-574. doi:10.1137/18M1209489 ISSN 0895-4801.
Bienkowski, Marcin, Böhm, Martin, Byrka, Jaroslaw, Chrobak, Marek, Dürr, Christoph, Folwarczný, Lukáš, Jeż, Łukasz, Sgall, Jiří, Thang, Nguyen Kim and Veselý, Pavel (2021) New results on multi-level aggregation. Theoretical Computer Science, 861 . pp. 133-143. doi:10.1016/j.tcs.2021.02.016 ISSN 0304-3975.
Bienkowski, Marcin, Böhm, Martin, Byrka, Jaroslaw, Chrobak, Marek, Dürr, Christoph, Folwarczný, Lukáš, Jeż, Łukasz, Sgall, Jiří, Kim Thang, Nguyen and Veselý, Pavel (2020) Online algorithms for multi-level aggregation. Operations Research, 68 (1). pp. 214-232. doi:10.1287/opre.2019.1847 ISSN 0030-364X.
Böhm, Martin, Chrobak, Marek, Jeż, Łukasz, Li, Fei, Sgall, Jiří and Veselý, Pavel (2019) Online packet scheduling with bounded delay and lookahead. Theoretical Computer Science, 776 . pp. 95-113. doi:10.1016/j.tcs.2019.01.013 ISSN 0304-3975.
Conference Item
Englert, Matthias, Matsakis, Nicolaos and Veselý, Pavel (2023) Approximation guarantees for shortest superstrings : simpler and better. In: 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 3–6 Dec 2023. Published in: Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023) , 286 29:1-29:17. doi:10.4230/LIPIcs.ISAAC.2023.29 (In Press)
Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert and Veselý, Pavel (2022) Streaming algorithms for geometric Steiner forest. In: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Paris, France, 04-08 Jul 2022. Published in: Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) pp. 1-20. ISBN 9783959772358. doi:10.4230/LIPIcs.ICALP.2022.47 ISSN 1868-8969.
Cormode, Graham, Karnin, Zohar, Liberty, Edo, Thaler, Justin and Veselý, Pavel (2021) Relative error streaming quantiles. In: The 2021 ACM SIGMOD/PODS Conference, Virtual conference, 20-25 Jun 2021. Published in: PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems pp. 96-108. ISBN 9781450383813. doi:10.1145/3452021.3458323
Antoniadis, Antonios, Englert, Matthias, Matsakis, Nicolaos and Veselý, Pavel (2021) Breaking the barrier of 2 for the competitiveness of longest queue drop. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Virtual, 12-16 Jul 2021. Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 198 17:1-17:20. ISBN 9783959771955. doi:10.4230/LIPIcs.ICALP.2021.17 ISSN 1868-8969.
Cormode, Graham and Veselý, Pavel (2020) A tight lower bound for comparison-based quantile summaries. In: 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS’20), Portland, OR, USA, 14–19 Jun 2020. Published in: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS’20) pp. 81-93. doi:10.1145/3375395.3387650
Cormode, Graham and Veselý, Pavel (2019) Streaming algorithms for bin packing and vector scheduling. In: Workshop on Approximation and Online Algorithms, Munich, Germany, 9-13 Sep 2019. Published in: Approximation and Online Algorithms. WAOA 2019, 11926 pp. 72-88. ISBN 9783030394783. doi:10.1007/978-3-030-39479-0_6
Veselý, Pavel, Chrobak, Marek, Łukasz, Jeż and Sgall, Jiří (2019) A φ-competitive algorithm for scheduling packets with deadlines. In: ACM-SIAM Symposium on Discrete Algorithms (SODA19), San Diego, California, USA, 6-9 Jan 2019. Published in: Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA19) ISBN 9781611975482. doi:10.1137/1.9781611975482.9
This list was generated on Thu Mar 28 09:48:16 2024 GMT.