Search Results - Simpson, Jamie

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    Palindromes in circular words

    Palindromes in circular words by Simpson, Jamie

    Published 2014
    Get full text
  2. 2
    Modified Padovan words and the maximum number of runs in a word

    Modified Padovan words and the maximum number of runs in a word by Simpson, Jamie

    Published 2010
    Get full text
  3. 3
    The total run length of a word

    The total run length of a word by Glen, A., Simpson, Jamie

    Published 2013
    Get full text
  4. 4
    A note on the union-closed sets conjecture

    A note on the union-closed sets conjecture by Roberts, I., Simpson, Jamie

    Published 2010
    Get full text
  5. 5
    Corrigendum to “The exact number of squares in Fibonacci words” [Theoret. Comput. Sci. 218 (1) (1999) 95–106]

    Corrigendum to “The exact number of squares in Fibonacci words” [Theoret. Comput. Sci. 218 (1) (1999) 95–106] by Fraenkel, A., Simpson, Jamie

    Published 2014
    Get full text
  6. 6
    Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets

    Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets by Gamble, Gregory, Simpson, Jamie

    Published 2013
    Get full text
  7. 7
    How many runs can a string contain?

    How many runs can a string contain? by Puglisi, S., Simpson, Jamie, Smyth, William

    Published 2008
    Get full text
  8. 8
    Incongruent restricted disjoint covering systems

    Incongruent restricted disjoint covering systems by Myerson, G., Poon, J., Simpson, Jamie

    Published 2009
    Get full text
  9. 9
    The Number of Runs in a Ternary Word

    The Number of Runs in a Ternary Word by Bannai, H., Griand, M., Kusano, K., Matsubara, W., Shinohara, A., Simpson, Jamie

    Published 2010
    Get full text

Search Tools: