Jamie Simpson

48 papers A 1B 3Misc 1Journal 43
YearRankTypeTitle / Venue / Authors
2025 B conf
On Palindromic Periodicities.
CPM
Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson
2024 J jnl
Counting subwords in circular words and their Parikh matrices.
Theor. Comput. Sci.
Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh
2024 J jnl
Some Remarks on Palindromic Periodicities.
CoRR
Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson
2022 J jnl
A Blueprint for the Estimation of Seagrass Carbon Stock Using Remote Sensing-Enabled Proxies.
Remote. Sens.
Jamie Simpson, Eleanor Bruce, Kevin P. Davies, Paul Barber
2020 J jnl
Permutations in which pairs of numbers are not simultaneously close in position and close in size.
Australas. J Comb.
Adam Mammoliti, Jamie Simpson
2020 J jnl
Short witnesses for Parikh-friendly permutations.
Australas. J Comb.
Jamie Simpson
2019 J jnl
A New Approach to the Fraenkel Conjecture for Low n Values.
Integers
Ofir Schnabel, Jamie Simpson
2019 J jnl
More properties of the Fibonacci word on an infinite alphabet.
Theor. Comput. Sci.
Amy Glen, Jamie Simpson, W. F. Smyth
2019 J jnl
Palindromes in starlike trees.
Australas. J Comb.
Amy Glen, Jamie Simpson, W. F. Smyth
2018 J jnl
Palindromes in starlike trees.
CoRR
Amy Glen, Jamie Simpson, W. F. Smyth
2017 J jnl
Counting Lyndon Factors.
Electron. J. Comb.
Amy Glen, Jamie Simpson, W. F. Smyth
2017 J jnl
Counting Lyndon factors.
CoRR
Amy Glen, Jamie Simpson, William F. Smyth
2017 J jnl
More properties of the Fibonacci word on an infinite alphabet.
CoRR
Amy Glen, Jamie Simpson, W. F. Smyth
2016 J jnl
An abelian periodicity lemma.
Theor. Comput. Sci.
Jamie Simpson
2016 J jnl
Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables.
J. Autom. Lang. Comb.
Ali Alatabbi, Abu Sayed Md. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, W. F. Smyth
2016 A conf
Exploration of the Use of Auditory Cues in Code Comprehension and Navigation for Individuals with Visual Impairments in a Visual Programming Environment.
ASSETS
Stephanie Ludi, Jamie Simpson, Wil Merchant
2015 J jnl
Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables.
CoRR
Ali Alatabbi, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, William F. Smyth
2015 J jnl
Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets.
Graphs Comb.
Greg Gamble, Jamie Simpson
2014 J jnl
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106].
Theor. Comput. Sci.
Aviezri S. Fraenkel, Jamie Simpson
2014 J jnl
Palindromes in circular words.
Theor. Comput. Sci.
Jamie Simpson
2013 J jnl
A general two-term recurrence.
Eur. J. Comb.
Jamie Simpson
2013 J jnl
Intersecting Rational Beatty Sequences.
Integers
Jamie Simpson
2013 J jnl
The total run length of a word
CoRR
Amy Glen, Jamie Simpson
2013 J jnl
The total run length of a word.
Theor. Comput. Sci.
Amy Glen, Jamie Simpson
2012 J jnl
Minimizing the weight of the union-closure of families of two-sets.
Australas. J Comb.
Uwe Leck, Ian T. Roberts, Jamie Simpson
2012 J jnl
More results on overlapping squares.
J. Discrete Algorithms
Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth
2010 J jnl
A note on the union-closed sets conjecture.
Australas. J Comb.
Ian T. Roberts, Jamie Simpson
2010 J jnl
Modified Padovan words and the maximum number of runs in a word.
Australas. J Comb.
Jamie Simpson
2010 Misc conf
The Number of Runs in a Ternary Word.
PSC
Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson
2009 J jnl
Incongruent restricted disjoint covering systems.
Discret. Math.
Gerry Myerson, Jacky Poon, Jamie Simpson
2008 J jnl
How many runs can a string contain?
Theor. Comput. Sci.
Simon J. Puglisi, Jamie Simpson, William F. Smyth
2008 J jnl
The expected number of runs in a word.
Australas. J Comb.
Simon J. Puglisi, Jamie Simpson
2008 J jnl
Words with Simple Burrows-Wheeler Transforms.
Electron. J. Comb.
Jamie Simpson, Simon J. Puglisi
2007 J jnl
Intersecting periodic words.
Theor. Comput. Sci.
Jamie Simpson
2005 J jnl
An extension of the periodicity lemma to longer periods.
Discret. Appl. Math.
Aviezri S. Fraenkel, Jamie Simpson
2005 J jnl
The Frobenius problem on lattices.
Australas. J Comb.
Peter A. B. Pleasants, Harry Ray, Jamie Simpson
2004 J jnl
A Problem That Bears Repeating: 11002.
Am. Math. Mon.
Y.-F. S. Pétermann, C. T. Stretch, Jamie Simpson
2003 J jnl
Euclidean strings.
Theor. Comput. Sci.
John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
2002 J jnl
Non-Repetitive Tilings.
Electron. J. Comb.
James D. Currie, Jamie Simpson
2001 B conf
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).
CPM
Aviezri S. Fraenkel, Jamie Simpson
2001 J jnl
Aviezri Fraenkel's Work in Number Theory.
Electron. J. Comb.
Jamie Simpson
2001 J jnl
On-Line Validation and Analysis of Partially Occluded Images.
J. Autom. Lang. Comb.
Costas S. Iliopoulos, Jamie Simpson
2001 J jnl
The Subword Complexity of a Two-Parameter Family of Sequences.
Electron. J. Comb.
Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson
1999 J jnl
The Exact Number of Squares in Fibonacci Words.
Theor. Comput. Sci.
Aviezri S. Fraenkel, Jamie Simpson
1998 J jnl
Edge-disjoint maximal planar graphs.
Discret. Math.
Sharon G. Boswell, Jamie Simpson
1998 J jnl
How Many Squares Can a String Contain?
J. Comb. Theory A
Aviezri S. Fraenkel, Jamie Simpson
1997 B conf
On Weak Circular Squares in Binary Words.
CPM
Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson
1995 J jnl
How Many Squares Must a Binary Sequence Contain?
Electron. J. Comb.
Aviezri S. Fraenkel, Jamie Simpson