![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jerri Nummenpalo
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j4]Torsten Mütze
, Jerri Nummenpalo:
A Constant-Time Algorithm for Middle Levels Gray Codes. Algorithmica 82(5): 1239-1258 (2020) - [j3]Jean Cardinal, Jerri Nummenpalo
, Emo Welzl:
Solving and Sampling with Many Solutions. Algorithmica 82(5): 1474-1489 (2020)
2010 – 2019
- 2019
- [j2]Luis Barba, Malte Milatz
, Jerri Nummenpalo, Xiaoming Sun
, Antonis Thomas, Jialin Zhang
, Zhijie Zhang:
The Complexity of Optimization on Grids. Algorithmica 81(9): 3494-3518 (2019) - [i6]Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf:
Switches in Eulerian graphs. CoRR abs/1905.06895 (2019) - 2018
- [j1]Torsten Mütze, Jerri Nummenpalo:
Efficient Computation of Middle Levels Gray Codes. ACM Trans. Algorithms 14(2): 15:1-15:29 (2018) - [c5]Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
:
Sparse Kneser graphs are Hamiltonian. STOC 2018: 912-919 - 2017
- [c4]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC 2017: 11:1-11:12 - [c3]Torsten Mütze, Jerri Nummenpalo:
A constant-time algorithm for middle levels Gray codes. SODA 2017: 2238-2253 - [i5]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. CoRR abs/1708.01122 (2017) - [i4]Petr Gregor, Torsten Mütze, Jerri Nummenpalo:
A short proof of the middle levels theorem. CoRR abs/1710.08249 (2017) - [i3]Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak:
Sparse Kneser graphs are Hamiltonian. CoRR abs/1711.01636 (2017) - 2016
- [c2]Luis Barba, Malte Milatz, Jerri Nummenpalo, Antonis Thomas:
Deterministic Algorithms for Unique Sink Orientations of Grids. COCOON 2016: 357-369 - [i2]Torsten Mütze, Jerri Nummenpalo:
A constant-time algorithm for middle levels Gray codes. CoRR abs/1606.06172 (2016) - 2015
- [c1]Torsten Mütze, Jerri Nummenpalo:
Efficient Computation of Middle Levels Gray Codes. ESA 2015: 915-927 - [i1]Torsten Mütze, Jerri Nummenpalo:
Efficient computation of middle levels Gray codes. CoRR abs/1506.07898 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint