default search action
George Kenison
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]George Kenison:
The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters. ICALP 2024: 145:1-145:20 - [c8]S. Hitarth, George Kenison, Laura Kovács, Anton Varonka:
Linear Loop Synthesis for Quadratic Invariants. STACS 2024: 41:1-41:18 - [i11]Rida Ait El Manssour, George Kenison, Mahsa Shirmohammadi, James Worrell:
Determination Problems for Orbit Closures and Matrix Groups. CoRR abs/2407.04626 (2024) - [i10]Rida Ait El Manssour, George Kenison, Mahsa Shirmohammadi, Anton Varonka:
Simple Linear Loops: Algebraic Invariants and Applications. CoRR abs/2407.09154 (2024) - 2023
- [c7]George Kenison, Joris Nieuwveld, Joël Ouaknine, James Worrell:
Positivity Problems for Reversible Linear Recurrence Sequences. ICALP 2023: 130:1-130:17 - [c6]George Kenison, Laura Kovács, Anton Varonka:
From Polynomial Invariants to Linear Loops. ISSAC 2023: 398-406 - [c5]George Kenison, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. ISSAC 2023: 407-416 - [i9]George Kenison, Laura Kovács, Anton Varonka:
From Polynomial Invariants to Linear Loops. CoRR abs/2302.06323 (2023) - [i8]George Kenison, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. CoRR abs/2303.09204 (2023) - [i7]Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
(Un)Solvable Loop Analysis. CoRR abs/2306.01597 (2023) - [i6]S. Hitarth, George Kenison, Laura Kovács, Anton Varonka:
Linear Loop Synthesis for Quadratic Invariants. CoRR abs/2310.05120 (2023) - 2022
- [c4]George Kenison:
On the Skolem Problem for Reversible Sequences. MFCS 2022: 61:1-61:15 - [c3]Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
Solving Invariant Generation for Unsolvable Loops. SAS 2022: 19-43 - [i5]George Kenison:
On the Skolem Problem for Reversible Sequences. CoRR abs/2203.07061 (2022) - [i4]Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
Solving Invariant Generation for Unsolvable Loops. CoRR abs/2206.06943 (2022) - [i3]George Kenison:
Applications of transcendental number theory to decision problems for hypergeometric sequences. CoRR abs/2211.02447 (2022) - 2021
- [c2]George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell:
On Positivity and Minimality for Second-Order Holonomic Sequences. MFCS 2021: 67:1-67:15 - 2020
- [c1]George Kenison, Richard Lipton, Joël Ouaknine, James Worrell:
On the skolem problem and prime powers. ISSAC 2020: 289-296 - [i2]George Kenison, Richard Lipton, Joël Ouaknine, James Worrell:
On the Skolem Problem and Prime Powers. CoRR abs/2006.07432 (2020) - [i1]George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell:
On Positivity and Minimality for Second-Order Holonomic Sequences. CoRR abs/2007.12282 (2020)
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-08-16 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint