default search action
Lukás Folwarczný
Person information
- unicode name: Lukáš Folwarczný
- affiliation: Charles University in Prague
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan:
One-Way Functions vs. TFNP: Simpler and Improved. ITCS 2024: 50:1-50:14 - 2023
- [j5]Lukás Folwarczný
:
On Protocols for Monotone Feasible Interpolation. ACM Trans. Comput. Theory 15(1-2): 1-17 (2023) - [c4]Romain Bourneuf, Lukás Folwarczný
PPP-Completeness and Extremal Combinatorics. ITCS 2023: 22:1-22:20 - [c3]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. WG 2023: 305-318 - [i8]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. CoRR abs/2302.11862 (2023) - [i7]Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan:
One-Way Functions vs. TFNP: Simpler and Improved. IACR Cryptol. ePrint Arch. 2023: 945 (2023) - 2022
- [i6]Lukás Folwarczný:
On Protocols for Monotone Feasible Interpolation. CoRR abs/2201.05662 (2022) - [i5]Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj Ignatieff Schwartzbach:
PPP-Completeness and Extremal Combinatorics. CoRR abs/2209.04827 (2022) - [i4]Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach:
PPP-Completeness and Extremal Combinatorics. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j4]Marcin Bienkowski
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - 2020
- [j3]Marcin Bienkowski
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020)
2010 – 2019
- 2017
- [j2]Lukás Folwarczný
General Caching Is Hard: Even with Small Pages. Algorithmica 79(2): 319-339 (2017) - [j1]Lukás Folwarczný
IV-matching is strongly NP-hard. Inf. Process. Lett. 125: 5-8 (2017) - 2016
- [c2]Marcin Bienkowski
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - 2015
- [c1]Lukás Folwarczný
General Caching Is Hard: Even with Small Pages. ISAAC 2015: 116-126 - [i3]Lukás Folwarczný, Jirí Sgall:
General Caching Is Hard: Even with Small Pages. CoRR abs/1506.07905 (2015) - [i2]Lukás Folwarczný, Dusan Knop:
IV-matching is strongly NP-hard. CoRR abs/1506.08388 (2015) - [i1]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: