![]() |
| 2007 | ||
|---|---|---|
| 7 | EE | Jason P. Bell: p-adic valuations and k-regular sequences. Discrete Mathematics 307(23): 3070-3075 (2007) |
| 6 | EE | Jason P. Bell, Teow Lim Goh: Exponential lower bounds for the number of words of uniform length avoiding a pattern. Inf. Comput. 205(9): 1295-1306 (2007) |
| 2006 | ||
| 5 | EE | Jason P. Bell, Stanley Burris, Karen A. Yeats: Counting Rooted Trees: The Universal Law t(n)~C ?-n n-3/2. Electr. J. Comb. 13(1): (2006) |
| 2005 | ||
| 4 | EE | Jason P. Bell: Unavoidable and Almost Unavoidable Sets of Words. IJAC 15(4): 717-724 (2005) |
| 2004 | ||
| 3 | EE | Jason P. Bell, Stanley Burris: Partition Identities I: Sandwich Theorems and Logical 0-1 Laws. Electr. J. Comb. 11(1): (2004) |
| 2000 | ||
| 2 | EE | Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond: Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. Electr. J. Comb. 7: (2000) |
| 1 | EE | Jason P. Bell: When Structures Are Almost Surely Connected. Electr. J. Comb. 7: (2000) |
| 1 | Edward A. Bender | [2] |
| 2 | Stanley Burris | [3] [5] |
| 3 | Peter J. Cameron | [2] |
| 4 | Teow Lim Goh | [6] |
| 5 | L. Bruce Richmond | [2] |
| 6 | Karen A. Yeats | [5] |