| 2008 |
|---|
| 14 | EE | 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 |
|---|
| 13 | EE | Jamie Simpson:
Intersecting periodic words.
Theor. Comput. Sci. 374(1-3): 58-65 (2007) |
| 2005 |
|---|
| 12 | EE | Aviezri S. Fraenkel,
Jamie Simpson:
An extension of the periodicity lemma to longer periods.
Discrete Applied Mathematics 146(2): 146-155 (2005) |
| 2003 |
|---|
| 11 | EE | John A. Ellis,
Frank Ruskey,
Joe Sawada,
Jamie Simpson:
Euclidean strings.
Theor. Comput. Sci. 1-3(301): 321-340 (2003) |
| 2002 |
|---|
| 10 | EE | James D. Currie,
Jamie Simpson:
Non-Repetitive Tilings.
Electr. J. Comb. 9(1): (2002) |
| 2001 |
|---|
| 9 | EE | Aviezri S. Fraenkel,
Jamie Simpson:
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).
CPM 2001: 98-105 |
| 8 | EE | Jamie Simpson:
Aviezri Fraenkel's Work in Number Theory.
Electr. J. Comb. 8(2): (2001) |
| 7 | EE | Aviezri S. Fraenkel,
Tamar Seeman,
Jamie Simpson:
The Subword Complexity of a Two-Parameter Family of Sequences.
Electr. J. Comb. 8(2): (2001) |
| 6 | | Costas S. Iliopoulos,
Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images.
Journal of Automata, Languages and Combinatorics 6(3): 291-303 (2001) |
| 1999 |
|---|
| 5 | EE | Aviezri S. Fraenkel,
Jamie Simpson:
The Exact Number of Squares in Fibonacci Words.
Theor. Comput. Sci. 218(1): 95-106 (1999) |
| 1998 |
|---|
| 4 | EE | Sharon G. Boswell,
Jamie Simpson:
Edge-disjoint maximal planar graphs.
Discrete Mathematics 179(1-3): 235-241 (1998) |
| 3 | EE | Aviezri S. Fraenkel,
Jamie Simpson:
How Many Squares Can a String Contain?
J. Comb. Theory, Ser. A 82(1): 112-120 (1998) |
| 1997 |
|---|
| 2 | | Aviezri S. Fraenkel,
Jamie Simpson,
Mike Paterson:
On Weak Circular Squares in Binary Words.
CPM 1997: 76-82 |
| 1995 |
|---|
| 1 | EE | Aviezri S. Fraenkel,
Jamie Simpson:
How Many Squares Must a Binary Sequence Contain?
Electr. J. Comb. 2: (1995) |
