Jamie Simpson

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j17		Jamie Simpson: A general two-term recurrence. Eur. J. Comb. 34(4): 703-705 (2013)
i1		Amy Glen, Jamie Simpson: The total run length of a word. CoRR abs/1301.6568 (2013)
	2012
j16		Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth: More results on overlapping squares. J. Discrete Algorithms 17: 2-8 (2012)
	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
	2009
j15		Gerry Myerson, Jacky Poon, Jamie Simpson: Incongruent restricted disjoint covering systems. Discrete Mathematics 309(13): 4428-4434 (2009)
	2008
j14		Jamie Simpson, Simon J. Puglisi: Words with Simple Burrows-Wheeler Transforms. Electr. J. Comb. 15(1) (2008)
j13		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
j12		Jamie Simpson: Intersecting periodic words. Theor. Comput. Sci. 374(1-3): 58-65 (2007)
	2005
j11		Aviezri S. Fraenkel, Jamie Simpson: An extension of the periodicity lemma to longer periods. Discrete Applied Mathematics 146(2): 146-155 (2005)
	2004
j10		Y.-F. S. Pétermann, C. T. Stretch, Jamie Simpson: A Problem That Bears Repeating: 11002. The American Mathematical Monthly 111(10): 920-921 (2004)
	2003
j9		John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson: Euclidean strings. Theor. Comput. Sci. 1-3(301): 321-340 (2003)
	2002
j8		James D. Currie, Jamie Simpson: Non-Repetitive Tilings. Electr. J. Comb. 9(1) (2002)
	2001
j7		Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson: The Subword Complexity of a Two-Parameter Family of Sequences. Electr. J. Comb. 8(2) (2001)
j6		Jamie Simpson: Aviezri Fraenkel's Work in Number Theory. Electr. J. Comb. 8(2) (2001)
j5		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)
c2		Aviezri S. Fraenkel, Jamie Simpson: An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105
	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. Discrete Mathematics 179(1-3): 235-241 (1998)
j2		Aviezri S. Fraenkel, Jamie Simpson: How Many Squares Can a String Contain? J. Comb. Theory, Ser. 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? Electr. J. Comb. 2 (1995)

Coauthor Index

1	Hideo Bannai	[c3]
2	Sharon G. Boswell	[j3]
3	James D. Currie	[j8]
4	John A. Ellis	[j9]
5	Aviezri S. Fraenkel	[j11] [j7] [c2] [j4] [j2] [c1] [j1]
6	Frantisek Franek	[j16]
7	Robert C. G. Fuller	[j16]
8	Mathieu Giraud	[c3]
9	Amy Glen	[i1]
10	Costas S. Iliopoulos	[j5]
11	Kazuhiko Kusano	[c3]
12	Wataru Matsubara	[c3]
13	Gerry Myerson	[j15]
14	Mike Paterson	[c1]
15	Jacky Poon	[j15]
16	Simon J. Puglisi	[j14] [j13]
17	Y.-F. S. Pétermann	[j10]
18	Frank Ruskey	[j9]
19	Joe Sawada	[j9]
20	Tamar Seeman	[j7]
21	Ayumi Shinohara	[c3]
22	William F. Smyth (W. F. Smyth, Bill Smyth)	[j16] [j13]
23	C. T. Stretch	[j10]

Colors in the list of coauthors

Last update Wed May 22 09:34:52 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page