| Online algorithms for multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarcznę, Ł Jeż, ... arXiv preprint arXiv:1507.02378, 2015 | 35 | 2015 |
| 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 | 6 | 2020 |
| General caching is hard: Even with small pages L Folwarcznę, J Sgall Algorithmica 79, 319-339, 2017 | 6 | 2017 |
| New results on multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarcznę, Ł Jeż, ... Theoretical Computer Science 861, 133-143, 2021 | 5 | 2021 |
| PPP-Completeness and Extremal Combinatorics R Bourneuf, L Folwarcznę, P Hubáček, A Rosen, NI Schwartzbach arXiv preprint arXiv:2209.04827, 2022 | 3 | 2022 |
| IV-matching is strongly NP-hard L Folwarcznę, D Knop Information Processing Letters 125, 5-8, 2017 | 3 | 2017 |
| Bounds on Functionality and Symmetric Difference–Two Intriguing Graph Parameters P Dvořák, L Folwarcznę, M Opler, P Pudlák, R Šámal, TA Vu International Workshop on Graph-Theoretic Concepts in Computer Science, 305-318, 2023 | 1 | 2023 |
| On protocols for monotone feasible interpolation L Folwarcznę ACM Transactions on Computation Theory 15 (1-2), 1-17, 2023 | 1 | 2023 |
| One-Way Functions vs. TFNP: Simpler and Improved L Folwarcznę, M Göös, P Hubáček, G Maystre, W Yuan Cryptology ePrint Archive, 2023 | | 2023 |
| Graph communication protocols L Folwarcznę Univerzita Karlova, Matematicko-fyzikální fakulta, 2018 | | 2018 |
| On the Hardness of General Caching L Folwarcznę Univerzita Karlova, Matematicko-fyzikální fakulta, 2015 | | 2015 |
