Jamie Simpson

Orcid: 0000-0003-4508-3738

According to our database1, Jamie Simpson authored at least 43 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Counting subwords in circular words and their Parikh matrices.
Theor. Comput. Sci., February, 2024

Some Remarks on Palindromic Periodicities.
CoRR, 2024

2022
A Blueprint for the Estimation of Seagrass Carbon Stock Using Remote Sensing-Enabled Proxies.
Remote. Sens., 2022

2020
Short witnesses for Parikh-friendly permutations.
Australas. J Comb., 2020

Permutations in which pairs of numbers are not simultaneously close in position and close in size.
Australas. J Comb., 2020

2019
More properties of the Fibonacci word on an infinite alphabet.
Theor. Comput. Sci., 2019

A New Approach to the Fraenkel Conjecture for Low n Values.
Integers, 2019

Palindromes in starlike trees.
Australas. J Comb., 2019

2017
Counting Lyndon Factors.
Electron. J. Comb., 2017

2016
An abelian periodicity lemma.
Theor. Comput. Sci., 2016

Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables.
J. Autom. Lang. Comb., 2016

Exploration of the Use of Auditory Cues in Code Comprehension and Navigation for Individuals with Visual Impairments in a Visual Programming Environment.
Proceedings of the 18th International ACM SIGACCESS Conference on Computers and Accessibility, 2016

2015
Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets.
Graphs Comb., 2015

Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables.
CoRR, 2015

2014
Palindromes in circular words.
Theor. Comput. Sci., 2014

Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106].
Theor. Comput. Sci., 2014

2013
The total run length of a word.
Theor. Comput. Sci., 2013

Intersecting Rational Beatty Sequences.
Integers, 2013

A general two-term recurrence.
Eur. J. Comb., 2013

2012
More results on overlapping squares.
J. Discrete Algorithms, 2012

Minimizing the weight of the union-closure of families of two-sets.
Australas. J Comb., 2012

2010
Modified Padovan words and the maximum number of runs in a word.
Australas. J Comb., 2010

A note on the union-closed sets conjecture.
Australas. J Comb., 2010

The Number of Runs in a Ternary Word.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009
Incongruent restricted disjoint covering systems.
Discret. Math., 2009

2008
How many runs can a string contain?
Theor. Comput. Sci., 2008

Words with Simple Burrows-Wheeler Transforms.
Electron. J. Comb., 2008

The expected number of runs in a word.
Australas. J Comb., 2008

2007
Intersecting periodic words.
Theor. Comput. Sci., 2007

2005
An extension of the periodicity lemma to longer periods.
Discret. Appl. Math., 2005

The Frobenius problem on lattices.
Australas. J Comb., 2005

2004
A Problem That Bears Repeating: 11002.
Am. Math. Mon., 2004

2003
Euclidean strings.
Theor. Comput. Sci., 2003

2002
Non-Repetitive Tilings.
Electron. J. Comb., 2002

2001
On-Line Validation and Analysis of Partially Occluded Images.
J. Autom. Lang. Comb., 2001

Aviezri Fraenkel's Work in Number Theory.
Electron. J. Comb., 2001

The Subword Complexity of a Two-Parameter Family of Sequences.
Electron. J. Comb., 2001

An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

1999
The Exact Number of Squares in Fibonacci Words.
Theor. Comput. Sci., 1999

1998
How Many Squares Can a String Contain?
J. Comb. Theory A, 1998

Edge-disjoint maximal planar graphs.
Discret. Math., 1998

1997
On Weak Circular Squares in Binary Words.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1995
How Many Squares Must a Binary Sequence Contain?
Electron. J. Comb., 1995


  Loading...