default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukás Vokrínek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Marek Filakovský
, Lukás Vokrínek:
Computing Homotopy Classes for Diagrams. Discret. Comput. Geom. 70(3): 866-920 (2023)- 2021
- [i8]Marek Filakovský, Lukás Vokrínek:
Computing homotopy classes for diagrams. CoRR abs/2104.10152 (2021) - 2020
- [j6]Marek Filakovský, Lukás Vokrínek:
Are Two Given Maps Homotopic? An Algorithmic Viewpoint. Found. Comput. Math. 20(2): 311-330 (2020)
2010 – 2019
- 2017
- [j5]Lukás Vokrínek:
Decidability of the Extension Problem for Maps into Odd-Dimensional Spheres. Discret. Comput. Geom. 57(1): 1-11 (2017) - [j4]Martin Cadek, Marek Krcál, Lukás Vokrínek:
Algorithmic Solvability of the Lifting-Extension Problem. Discret. Comput. Geom. 57(4): 915-965 (2017) - 2014
- [j3]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extendability of Continuous Maps Is Undecidable. Discret. Comput. Geom. 51(1): 24-66 (2014) - [j2]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing All Maps into a Sphere. J. ACM 61(3): 17:1-17:44 (2014) - [j1]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. SIAM J. Comput. 43(5): 1728-1780 (2014) - [i7]Lukás Vokrínek:
Decidability of the extension problem for maps into odd-dimensional spheres. CoRR abs/1401.3758 (2014) - 2013
- [c2]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extending continuous maps: polynomiality and undecidability. STOC 2013: 595-604 - [i6]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extendability of continuous maps is undecidable. CoRR abs/1302.2370 (2013) - [i5]Martin Cadek, Marek Krcál, Lukás Vokrínek:
Algorithmic solvability of the lifting-extension problem. CoRR abs/1307.6444 (2013) - [i4]Marek Filakovský, Lukás Vokrínek:
Are two given maps homotopic? An algorithmic viewpoint. CoRR abs/1312.2337 (2013) - [i3]Lukás Vokrínek:
Computing the abelian heap of unpointed stable homotopy classes of maps. CoRR abs/1312.2474 (2013) - 2012
- [c1]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing all maps into a sphere. SODA 2012: 1-10 - [i2]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. CoRR abs/1211.3093 (2012) - 2011
- [i1]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing all maps into a sphere. CoRR abs/1105.6257 (2011)
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 2025-01-21 00:13 CET 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:
