Seguir
Lukáš Folwarczný
Lukáš Folwarczný
Computer Science Institute of Charles University
E-mail confirmado em iuuk.mff.cuni.cz - Página inicial
Título
Citado por
Citado por
Ano
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
332015
General caching is hard: Even with small pages
L Folwarczný, J Sgall
Algorithmica 79, 319-339, 2017
62017
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
52020
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
42021
PPP-Completeness and Extremal Combinatorics
R Bourneuf, L Folwarczný, P Hubáček, A Rosen, NI Schwartzbach
arXiv preprint arXiv:2209.04827, 2022
32022
IV-matching is strongly NP-hard
L Folwarczný, D Knop
Information Processing Letters 125, 5-8, 2017
32017
On protocols for monotone feasible interpolation
L Folwarczný
ACM Transactions on Computation Theory 15 (1-2), 1-17, 2023
12023
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
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
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–11