Nathan Fox

Orcid: 0000-0002-9958-7547

According to our database1, Nathan Fox authored at least 19 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Complexity and enumeration in models of genome rearrangement.
Theor. Comput. Sci., 2024

Viewscape: An R package for the spatial analysis of landscape perception and configurations in viewsheds of landscapes.
SoftwareX, 2024

Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023
Mining crowdsourced text to capture hikers' perceptions associated with landscape features and outdoor physical activities.
Ecol. Informatics, December, 2023

<i>vGameReviews</i>: An R package for harnessing video game reviews for scientific research.
SoftwareX, July, 2023

PPGISr: An R package for Public Participatory GIS.
SoftwareX, May, 2023

An Interdisciplinary Outlook on Large Language Models for Scientific Research.
CoRR, 2023

2022
On the computational complexities of various Geography variants.
Discret. Appl. Math., 2022

2020
"photosearcher" package in R: An accessible and reproducible method for harvesting large datasets from Flickr.
SoftwareX, 2020

2018
Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation.
J. Symb. Comput., 2018

2017
A Slow Relative of Hofstadter's Q-Sequence.
J. Integer Seq., 2017

On Hofstadter Heart Sequences.
Complex., 2017

2016
Quasipolynomial Solutions to the Hofstadter Q-Recurrence.
Integers, 2016

2015
An Aperiodic Subtraction Game of Nim-Dimension Two.
J. Integer Seq., 2015

2014
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1.
Integers, 2014

On the asymptotic abelian complexity of morphic words.
Adv. Appl. Math., 2014

2013
Abelian-primitive partial words.
Theor. Comput. Sci., 2013

A Graph Polynomial Approach to Primitivity.
Proceedings of the Language and Automata Theory and Applications, 2013

On the Asymptotic Abelian Complexity of Morphic Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013


  Loading...