Jamie Simpson

发表

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

Greg Gamble, Jamie Simpson, J. Simpson, 2015, Graphs Comb..

Palindromes in circular words

Jamie Simpson, 2014, Theor. Comput. Sci..

The State and the Aircraft Industry

Daniel Todd, Jamie Simpson, 2019 .

The Frobenius problem on lattices

Jamie Simpson, Peter A. B. Pleasants, Harry Ray, 2005, Australas. J Comb..

How Many Squares Must a Binary Sequence Contain?

Aviezri S. Fraenkel, Jamie Simpson, A. Fraenkel, 1997, Electron. J. Comb..

The World Aircraft Industry

Daniel Todd, Jamie Simpson, D. Todd, 1986 .

A note on the union-closed sets conjecture

Jamie Simpson, Ian T. Roberts, 2010, Australas. J Comb..

Overview of the Industry

Daniel Todd, Jamie Simpson, D. Todd, 2019, The World Aircraft Industry.

Intersecting Rational Beatty Sequences

Jamie Simpson, 2013, Integers.

More results on overlapping squares

Frantisek Franek, William F. Smyth, Jamie Simpson, 2012, J. Discrete Algorithms.

Edge-disjoint maximal planar graphs

Jamie Simpson, Sharon G. Boswell, S. G. Boswell, 1998, Discret. Math..

The total run length of a word

Jamie Simpson, Amy Glen, 2013, Theor. Comput. Sci..

Words with Simple Burrows-Wheeler Transforms

Simon J. Puglisi, Jamie Simpson, S. Puglisi, 2008, Electron. J. Comb..

Counting Lyndon Factors

William F. Smyth, Jamie Simpson, Amy Glen, 2017, Electron. J. Comb..

An abelian periodicity lemma

Jamie Simpson, Jamie Simpson, 2016, Theor. Comput. Sci..

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

Aviezri S. Fraenkel, Jamie Simpson, 2001, CPM.

The Exact Number of Squares in Fibonacci Words

Jamie Simpson, Aviezri S. Fraenkel, A. Fraenkel, 1999, Theor. Comput. Sci..

Incongruent restricted disjoint covering systems

Jamie Simpson, Gerry Myerson, Jacky Poon, 2009, Discret. Math..

The Number of Runs in a Ternary Word

Ayumi Shinohara, Hideo Bannai, Jamie Simpson, 2010, Stringology.

On-Line Validation and Analysis of Partially Occluded Images

Costas S. Iliopoulos, Jamie Simpson, 2001, J. Autom. Lang. Comb..

The expected number of runs in a word

Simon J. Puglisi, Jamie Simpson, 2008, Australas. J Comb..

A Problem That Bears Repeating: 11002

Jamie Simpson, C. T. Stretch, Y.-F. S. Pétermann, 2004, Am. Math. Mon..

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

Jamie Simpson, 2010, Australas. J Comb..

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, 2016, ASSETS.

Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables pdf

Mohammad Sohel Rahman, William F. Smyth, Jamie Simpson, 2016, J. Autom. Lang. Comb..

How many runs can a string contain?

William F. Smyth, Simon J. Puglisi, Jamie Simpson, 2008, Theor. Comput. Sci..

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

Uwe Leck, Jamie Simpson, Ian T. Roberts, 2012, Australas. J Comb..

Non-Repetitive Tilings

James D. Currie, Jamie Simpson, 2002, Electron. J. Comb..

A general two-term recurrence

Jamie Simpson, 2013, Eur. J. Comb..

Aviezri Fraenkel's Work in Number Theory

Jamie Simpson, J. Simpson, 2001, Electron. J. Comb..

Euclidean strings

Frank Ruskey, Joe Sawada, Jamie Simpson, 2003, Theor. Comput. Sci..

More properties of the Fibonacci word on an infinite alphabet pdf

William F. Smyth, Jamie Simpson, Amy Glen, 2019, Theor. Comput. Sci..

Palindromes in starlike trees pdf

William F. Smyth, Jamie Simpson, Amy Glen, 2018, ArXiv.

Technology and Industrial Organisation

Daniel Todd, Jamie Simpson, 2019 .

On Weak Circular Squares in Binary Words

Mike Paterson, Aviezri S. Fraenkel, Jamie Simpson, 1997, CPM.

A New Approach to the Fraenkel Conjecture for Low n Values

Jamie Simpson, Ofir Schnabel, J. Simpson, 2019, Integers.

The Subword Complexity of a Two-Parameter Family of Sequences

Aviezri S. Fraenkel, Jamie Simpson, Tamar Seeman, 2001, Electron. J. Comb..

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

Aviezri S. Fraenkel, Jamie Simpson, A. Fraenkel, 2014, Theoretical Computer Science.

Aerospace and development: A survey

Daniel Todd, Jamie Simpson, Ronald Humble, 1985 .

How Many Squares Can a String Contain?

Aviezri S. Fraenkel, Jamie Simpson, A. Fraenkel, 1998, J. Comb. Theory, Ser. A.

An extension of the periodicity lemma to longer periods

Aviezri S. Fraenkel, Jamie Simpson, A. Fraenkel, 2005, Discret. Appl. Math..

Aerospace and Development

Daniel Todd, Jamie Simpson, 2019 .

Intersecting periodic words

Jamie Simpson, 2007, Theor. Comput. Sci..

Counting Subwords in Circular Words and Their Parikh Matrices

Jamie Simpson, Wen Chean Teh, Ghajendran Poovanandran, 2021, 2110.14858.

Greedily partitioning the natural numbers into sets free of arithmetic progressions

Jamie Simpson, James Propp, Joseph Gerver, 1988 .

On Disjoint Covering Systems with Precisely One Repeated Modulus

Jamie Simpson, Melkamu Zeleke, J. Simpson, 1999 .

DISJOINT BEATTY SEQUENCES

Jamie Simpson, J. Simpson, 2004 .

A strong convergence theorem for contraction semigroups in Banach

Jamie Simpson, Sidney A. Morris, K. L. McAvaney, 2008 .