default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReino Niskanen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Vesa Halava, Reino Niskanen:
On simulating Turing machines with matrix semigroups with integrality tests. Theor. Comput. Sci. 1005: 114637 (2024)- 2023
- [j5]Vesa Halava
, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. Int. J. Found. Comput. Sci. 34(2&3): 163-182 (2023) - [c10]Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. RP 2023: 42-55 - [i5]Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR abs/2307.05283 (2023) - 2021
- [j4]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
Reachability problems in low-dimensional nondeterministic polynomial maps over integers. Inf. Comput. 281: 104785 (2021) - [c9]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. DLT 2021: 167-179 - 2020
- [j3]Reino Niskanen, Igor Potapov, Julien Reichert:
On decidability and complexity of low-dimensional robot games. J. Comput. Syst. Sci. 107: 124-141 (2020)
2010 – 2019
- 2019
- [c8]Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen:
Monadic Decomposability of Regular Relations. ICALP 2019: 103:1-103:14 - [i4]Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen:
Monadic Decomposability of Regular Relations. CoRR abs/1903.00728 (2019) - 2018
- [b1]Reino Niskanen:
Reachability games and related matrix and word problems. University of Liverpool, UK, 2018 - [c7]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
Reachability Problems in Nondeterministic Polynomial Maps on the Integers. DLT 2018: 465-477 - [c6]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
On the Identity Problem for the Special Linear Group and the Heisenberg Group. ICALP 2018: 132:1-132:15 - 2017
- [j2]Vesa Halava, Yuri V. Matiyasevich, Reino Niskanen:
Small Semi-Thue System Universal with Respect to the Termination Problem. Fundam. Informaticae 154(1-4): 177-184 (2017) - [j1]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted automata on infinite words in the context of Attacker-Defender games. Inf. Comput. 255: 27-44 (2017) - [c5]Reino Niskanen:
Reachability Problem for Polynomial Iteration Is PSPACE-complete. RP 2017: 132-143 - [i3]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
On the Identity Problem for the Special Linear Group and the Heisenberg Group. CoRR abs/1706.04166 (2017) - 2016
- [c4]Reino Niskanen, Igor Potapov, Julien Reichert:
Undecidability of Two-dimensional Robot Games. MFCS 2016: 73:1-73:13 - [c3]Reino Niskanen:
Robot Games with States in Dimension One. RP 2016: 163-176 - [i2]Reino Niskanen, Igor Potapov, Julien Reichert:
Undecidability of Two-dimensional Robot Games. CoRR abs/1604.08779 (2016) - 2015
- [c2]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. CiE 2015: 206-215 - [c1]Vesa Halava, Reino Niskanen, Igor Potapov:
On Robot Games of Degree Two. LATA 2015: 224-236 - 2014
- [i1]Vesa Halava, Reino Niskanen, Igor Potapov:
On Undecidability of Counter Reachability Games in Dimension One. CoRR abs/1411.4796 (2014)
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-06-11 21:43 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:
