Jamie Simpson

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 15

Top Topics

Prime Implicants

Johnson Lindenstrauss

Symmetric Difference

Top Venues

Theor. Comput. Sci.

Australas. J Comb.

Publications

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