Jamie Simpson - Citegraph

Author Info

Name	Affiliation	Papers
JAMIE SIMPSON	Department of Mathematics and Statistics, Curtin University, Perth, Western Australia, Australia	26
Collaborators	Citations	PageRank
27	164	21.41
Referers	Referees	References
208	113	104

Search Limit

100208

Publications (26 rows)

Collaborators (27 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Short witnesses for Parikh-friendly permutations	0	0.34	2020
Palindromes in starlike trees.	0	0.34	2018
Counting Lyndon factors.	0	0.34	2017
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106].	0	0.34	2014
A general two-term recurrence	0	0.34	2013
The total run length of a word	0	0.34	2013
More results on overlapping squares	6	0.99	2012
The Number Of Runs In A Ternary Word	3	0.41	2010
Incongruent restricted disjoint covering systems	0	0.34	2009
How many runs can a string contain?	33	1.92	2008
The Expected Number Of Runs In A Word	12	0.76	2008
Words with simple Burrows-Wheeler Transforms	7	0.63	2008
Intersecting periodic words	4	0.65	2007
The Frobenius Problem On Lattices	5	0.78	2005
An extension of the periodicity lemma to longer periods	0	0.34	2005
A Problem That Bears Repeating: 11002.	0	0.34	2004
Euclidean strings	1	0.47	2003
Non-Repetitive Tilings	10	1.72	2002
On-Line Validation and Analysis of Partially Occluded Images	3	0.45	2001
The Subword Complexity of a Two-Parameter Family of Sequences	4	0.51	2001
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)	2	0.57	2001
Aviezri Fraenkel's Work in Number Theory	5	0.50	2001
The exact number of squares in Fibonacci words	14	1.66	1999
How many squares can a string contain?	54	5.64	1998
Edge-disjoint maximal planar graphs	0	0.34	1998
On Weak Circular Squares in Binary Words	1	0.37	1997