Jamie Simpson

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Counting subwords in circular words and their Parikh matrices.

Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh

Theor. Comput. Sci., February, 2024

Some Remarks on Palindromic Periodicities.

Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson

CoRR, 2024

2022

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

Jamie Simpson, Eleanor Bruce, Kevin P. Davies, Paul Barber

Remote. Sens., 2022

2020

Short witnesses for Parikh-friendly permutations.

Jamie Simpson

Australas. J Comb., 2020

Permutations in which pairs of numbers are not simultaneously close in position and close in size.

Adam Mammoliti, Jamie Simpson

Australas. J Comb., 2020

2019

More properties of the Fibonacci word on an infinite alphabet.

Amy Glen, Jamie Simpson, W. F. Smyth

Theor. Comput. Sci., 2019

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

Ofir Schnabel, Jamie Simpson

Integers, 2019

Palindromes in starlike trees.

Amy Glen, Jamie Simpson, W. F. Smyth

Australas. J Comb., 2019

2017

Counting Lyndon Factors.

Amy Glen, Jamie Simpson, W. F. Smyth

Electron. J. Comb., 2017

2016

An abelian periodicity lemma.

Jamie Simpson

Theor. Comput. Sci., 2016

Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables.

Ali Alatabbi, Abu Sayed Md. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, W. F. Smyth

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.

Stephanie Ludi, Jamie Simpson, Wil Merchant

Proceedings of the 18th International ACM SIGACCESS Conference on Computers and Accessibility, 2016

2015

Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets.

Greg Gamble, Jamie Simpson

Graphs Comb., 2015

Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables.

Ali Alatabbi, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, William F. Smyth

CoRR, 2015

2014

Palindromes in circular words.

Jamie Simpson

Theor. Comput. Sci., 2014

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

Aviezri S. Fraenkel, Jamie Simpson

Theor. Comput. Sci., 2014

2013

The total run length of a word.

Amy Glen, Jamie Simpson

Theor. Comput. Sci., 2013

Intersecting Rational Beatty Sequences.

Jamie Simpson

Integers, 2013

A general two-term recurrence.

Jamie Simpson

Eur. J. Comb., 2013

2012

More results on overlapping squares.

Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth

J. Discrete Algorithms, 2012

Minimizing the weight of the union-closure of families of two-sets.

Uwe Leck, Ian T. Roberts, Jamie Simpson

Australas. J Comb., 2012

2010

Modified Padovan words and the maximum number of runs in a word.

Jamie Simpson

Australas. J Comb., 2010

A note on the union-closed sets conjecture.

Ian T. Roberts, Jamie Simpson

Australas. J Comb., 2010

The Number of Runs in a Ternary Word.

Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009

Incongruent restricted disjoint covering systems.

Gerry Myerson, Jacky Poon, Jamie Simpson

Discret. Math., 2009

2008

How many runs can a string contain?

Simon J. Puglisi, Jamie Simpson, William F. Smyth

Theor. Comput. Sci., 2008

Words with Simple Burrows-Wheeler Transforms.

Jamie Simpson, Simon J. Puglisi

Electron. J. Comb., 2008

The expected number of runs in a word.

Simon J. Puglisi, Jamie Simpson

Australas. J Comb., 2008

2007

Intersecting periodic words.

Jamie Simpson

Theor. Comput. Sci., 2007

2005

An extension of the periodicity lemma to longer periods.

Aviezri S. Fraenkel, Jamie Simpson

Discret. Appl. Math., 2005

The Frobenius problem on lattices.

Peter A. B. Pleasants, Harry Ray, Jamie Simpson

Australas. J Comb., 2005

2004

A Problem That Bears Repeating: 11002.

Y.-F. S. Pétermann, C. T. Stretch, Jamie Simpson

Am. Math. Mon., 2004

2003

Euclidean strings.

John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson

Theor. Comput. Sci., 2003

2002

Non-Repetitive Tilings.

James D. Currie, Jamie Simpson

Electron. J. Comb., 2002

2001

On-Line Validation and Analysis of Partially Occluded Images.

Costas S. Iliopoulos, Jamie Simpson

J. Autom. Lang. Comb., 2001

Aviezri Fraenkel's Work in Number Theory.

Jamie Simpson

Electron. J. Comb., 2001

The Subword Complexity of a Two-Parameter Family of Sequences.

Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson

Electron. J. Comb., 2001

An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).

Aviezri S. Fraenkel, Jamie Simpson

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

1999

The Exact Number of Squares in Fibonacci Words.

Aviezri S. Fraenkel, Jamie Simpson

Theor. Comput. Sci., 1999

1998

How Many Squares Can a String Contain?

Aviezri S. Fraenkel, Jamie Simpson

J. Comb. Theory A, 1998

Edge-disjoint maximal planar graphs.

Sharon G. Boswell, Jamie Simpson

Discret. Math., 1998

1997

On Weak Circular Squares in Binary Words.

Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1995

How Many Squares Must a Binary Sequence Contain?

Aviezri S. Fraenkel, Jamie Simpson

Electron. J. Comb., 1995