default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJamie Simpson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Ghajendran Poovanandran
, Jamie Simpson, Wen Chean Teh:
Counting subwords in circular words and their Parikh matrices. Theor. Comput. Sci. 985: 114344 (2024)- [i6]Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson:
Some Remarks on Palindromic Periodicities. CoRR abs/2407.10564 (2024) - 2022
- [j36]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): 3572 (2022) - 2020
- [j35]Adam Mammoliti, Jamie Simpson:
Permutations in which pairs of numbers are not simultaneously close in position and close in size. Australas. J Comb. 78: 11-34 (2020) - [j34]Jamie Simpson:
Short witnesses for Parikh-friendly permutations. Australas. J Comb. 78: 329-334 (2020)
2010 – 2019
- 2019
- [j33]Amy Glen, Jamie Simpson, W. F. Smyth:
Palindromes in starlike trees. Australas. J Comb. 73: 242-246 (2019) - [j32]Ofir Schnabel, Jamie Simpson:
A New Approach to the Fraenkel Conjecture for Low n Values. Integers 19: A43 (2019) - [j31]Amy Glen, Jamie Simpson, W. F. Smyth:
More properties of the Fibonacci word on an infinite alphabet. Theor. Comput. Sci. 795: 301-311 (2019) - 2018
- [i5]Amy Glen, Jamie Simpson, W. F. Smyth:
Palindromes in starlike trees. CoRR abs/1805.10646 (2018) - 2017
- [j30]Amy Glen, Jamie Simpson, W. F. Smyth:
Counting Lyndon Factors. Electron. J. Comb. 24(3): 3 (2017) - [i4]Amy Glen, Jamie Simpson, William F. Smyth:
Counting Lyndon factors. CoRR abs/1701.00928 (2017) - [i3]Amy Glen, Jamie Simpson, W. F. Smyth:
More properties of the Fibonacci word on an infinite alphabet. CoRR abs/1710.02782 (2017) - 2016
- [j29]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): 131-147 (2016) - [j28]Jamie Simpson:
An abelian periodicity lemma. Theor. Comput. Sci. 656: 249-255 (2016) - [c4]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: 279-280 - 2015
- [j27]Greg Gamble, Jamie Simpson:
Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets. Graphs Comb. 31(1): 127-130 (2015) - [i2]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 abs/1506.06793 (2015) - 2014
- [j26]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: 122 (2014) - [j25]Jamie Simpson:
Palindromes in circular words. Theor. Comput. Sci. 550: 66-78 (2014) - 2013
- [j24]Jamie Simpson:
A general two-term recurrence. Eur. J. Comb. 34(4): 703-705 (2013) - [j23]Jamie Simpson:
Intersecting Rational Beatty Sequences. Integers 13: A50 (2013) - [j22]Amy Glen, Jamie Simpson:
The total run length of a word. Theor. Comput. Sci. 501: 41-48 (2013) - [i1]Amy Glen, Jamie Simpson:
The total run length of a word. CoRR abs/1301.6568 (2013) - 2012
- [j21]Uwe Leck, Ian T. Roberts, Jamie Simpson:
Minimizing the weight of the union-closure of families of two-sets. Australas. J Comb. 52: 67-74 (2012) - [j20]Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth:
More results on overlapping squares. J. Discrete Algorithms 17: 2-8 (2012) - 2010
- [j19]Jamie Simpson:
Modified Padovan words and the maximum number of runs in a word. Australas. J Comb. 46: 129-146 (2010) - [j18]Ian T. Roberts, Jamie Simpson:
A note on the union-closed sets conjecture. Australas. J Comb. 47: 265-268 (2010) - [c3]Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson:
The Number of Runs in a Ternary Word. Stringology 2010: 178-181
2000 – 2009
- 2009
- [j17]Gerry Myerson, Jacky Poon, Jamie Simpson:
Incongruent restricted disjoint covering systems. Discret. Math. 309(13): 4428-4434 (2009) - 2008
- [j16]Simon J. Puglisi, Jamie Simpson:
The expected number of runs in a word. Australas. J Comb. 42: 45-54 (2008) - [j15]Jamie Simpson, Simon J. Puglisi:
Words with Simple Burrows-Wheeler Transforms. Electron. J. Comb. 15(1) (2008) - [j14]Simon J. Puglisi, Jamie Simpson, William F. Smyth:
How many runs can a string contain? Theor. Comput. Sci. 401(1-3): 165-171 (2008) - 2007
- [j13]Jamie Simpson:
Intersecting periodic words. Theor. Comput. Sci. 374(1-3): 58-65 (2007) - 2005
- [j12]Peter A. B. Pleasants, Harry Ray, Jamie Simpson:
The Frobenius problem on lattices. Australas. J Comb. 32: 27-46 (2005) - [j11]Aviezri S. Fraenkel, Jamie Simpson:
An extension of the periodicity lemma to longer periods. Discret. Appl. Math. 146(2): 146-155 (2005) - 2004
- [j10]Y.-F. S. Pétermann, C. T. Stretch, Jamie Simpson:
A Problem That Bears Repeating: 11002. Am. Math. Mon. 111(10): 920-921 (2004) - 2003
- [j9]John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson:
Euclidean strings. Theor. Comput. Sci. 301(1-3): 321-340 (2003) - 2002
- [j8]James D. Currie, Jamie Simpson:
Non-Repetitive Tilings. Electron. J. Comb. 9(1) (2002) - 2001
- [j7]Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson:
The Subword Complexity of a Two-Parameter Family of Sequences. Electron. J. Comb. 8(2) (2001) - [j6]Jamie Simpson:
Aviezri Fraenkel's Work in Number Theory. Electron. J. Comb. 8(2) (2001) - [j5]Costas S. Iliopoulos, Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images. J. Autom. Lang. Comb. 6(3): 291-303 (2001) - [c2]Aviezri S. Fraenkel, Jamie Simpson:
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105
1990 – 1999
- 1999
- [j4]Aviezri S. Fraenkel, Jamie Simpson:
The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999) - 1998
- [j3]Sharon G. Boswell, Jamie Simpson:
Edge-disjoint maximal planar graphs. Discret. Math. 179(1-3): 235-241 (1998) - [j2]Aviezri S. Fraenkel, Jamie Simpson:
How Many Squares Can a String Contain? J. Comb. Theory A 82(1): 112-120 (1998) - 1997
- [c1]Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson:
On Weak Circular Squares in Binary Words. CPM 1997: 76-82 - 1995
- [j1]Aviezri S. Fraenkel, Jamie Simpson:
How Many Squares Must a Binary Sequence Contain? Electron. J. Comb. 2 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
