Lukás Folwarczný

According to our database, Lukás Folwarczný authored at least 9 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

One-Way Functions vs. TFNP: Simpler and Improved.

Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

On Protocols for Monotone Feasible Interpolation.

Lukás Folwarczný

ACM Trans. Comput. Theory, June, 2023

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.

Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

PPP-Completeness and Extremal Combinatorics.

Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2021

New results on multi-level aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý

Theor. Comput. Sci., 2021

2020

Online Algorithms for Multilevel Aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý

Oper. Res., 2020

2017

IV-matching is strongly NP-hard.

Lukás Folwarczný, Dusan Knop

Inf. Process. Lett., 2017

2016

Online Algorithms for Multi-Level Aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

General Caching Is Hard: Even with Small Pages.

Lukás Folwarczný, Jirí Sgall

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015