Jamie Simpson (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

12 Aviezri S. Fraenkel, Jamie Simpson: An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics 146(2): 146-155 (2005)

9 Aviezri S. Fraenkel, Jamie Simpson: An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105

7 Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson: The Subword Complexity of a Two-Parameter Family of Sequences. Electr. J. Comb. 8(2): (2001)

5 Aviezri S. Fraenkel, Jamie Simpson: The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999)

3 Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Can a String Contain? J. Comb. Theory, Ser. A 82(1): 112-120 (1998)

2 Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson: On Weak Circular Squares in Binary Words. CPM 1997: 76-82

1 Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Must a Binary Sequence Contain? Electr. J. Comb. 2: (1995)

Selection of 7 from 14 records - Jamie Simpson has 11 coauthors

12		Aviezri S. Fraenkel, Jamie Simpson: An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics 146(2): 146-155 (2005)
9		Aviezri S. Fraenkel, Jamie Simpson: An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105
7		Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson: The Subword Complexity of a Two-Parameter Family of Sequences. Electr. J. Comb. 8(2): (2001)
5		Aviezri S. Fraenkel, Jamie Simpson: The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999)
3		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Can a String Contain? J. Comb. Theory, Ser. A 82(1): 112-120 (1998)
2		Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson: On Weak Circular Squares in Binary Words. CPM 1997: 76-82
1		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Must a Binary Sequence Contain? Electr. J. Comb. 2: (1995)