default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Franek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Simon Rohou
, Peter Franek, Clément Aubry, Luc Jaulin:
Proving the existence of loops in robot trajectories. Int. J. Robotics Res. 37(12) (2018)- [j6]Peter Franek, Marek Krcál, Hubert Wagner:
Solving equations and optimization problems with uncertainty. J. Appl. Comput. Topol. 1(3-4): 297-330 (2018) - [j5]Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing simplicial representatives of homotopy group elements. J. Appl. Comput. Topol. 2(3-4): 177-231 (2018) - [c5]Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing Simplicial Representatives of Homotopy Group Elements. SODA 2018: 1135-1151 - 2017
- [i9]Marek Filakovský, Peter Franek, Uli Wagner, Stephan Zhechev:
Computing simplicial representatives of homotopy group element. CoRR abs/1706.00380 (2017) - [i8]Simon Rohou, Peter Franek, Clément Aubry, Luc Jaulin:
Proving the existence of loops in robot trajectories. CoRR abs/1712.01341 (2017) - 2016
- [j4]Peter Franek, Marek Krcál:
On Computability and Triviality of Well Groups. Discret. Comput. Geom. 56(1): 126-164 (2016) - [j3]Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers. J. Autom. Reason. 57(2): 157-185 (2016) - [i7]Peter Franek, Marek Krcál, Hubert Wagner:
Solving equations and optimization problems with uncertainty. CoRR abs/1607.06344 (2016) - 2015
- [j2]Peter Franek, Marek Krcál:
Robust Satisfiability of Systems of Equations. J. ACM 62(4): 26:1-26:19 (2015) - [j1]Peter Franek, Stefan Ratschan:
Effective topological degree computation based on interval arithmetic. Math. Comput. 84(293): 1265-1290 (2015) - [c4]Peter Franek, Marek Krcál:
On Computability and Triviality of Well Groups. SoCG 2015: 842-856 - [i6]Peter Franek, Marek Krcál:
On Computability and Triviality of Well Groups. CoRR abs/1501.03641 (2015) - [i5]Peter Franek, Marek Krcál:
Cohomotopy groups capture robust properties of zero sets. CoRR abs/1507.04310 (2015) - 2014
- [c3]Peter Franek, Marek Krcál:
Robust Satisfiability of Systems of Equations. SODA 2014: 193-203 - [i4]Peter Franek, Marek Krcál:
Robust Satisfiability of Systems of Equations. CoRR abs/1402.0858 (2014) - 2013
- [c2]Ales Antonin Kubena, Peter Franek:
Symmetries of Quasi-Values. SAGT 2013: 159-170 - [i3]Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Quasi-decidability of a Fragment of the First-order Theory of Real Numbers. CoRR abs/1309.6280 (2013) - 2012
- [i2]Ales Antonin Kubena, Peter Franek:
Shapley's Game Value Axiomatic with restricted symmetry. CoRR abs/1207.4738 (2012) - [i1]Peter Franek, Stefan Ratschan:
Effective Topological Degree Computation Based on Interval Arithmetic. CoRR abs/1207.6331 (2012) - 2011
- [c1]Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. MFCS 2011: 315-326
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:24 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:
