
Search the dblp DataBase
Jason P. Bell:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jason P. Bell
When Structures Are Almost Surely Connected. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2000, v:7, n:, pp: [Journal]
 Jason P. Bell, Stanley Burris
Partition Identities I: Sandwich Theorems and Logical 01 Laws. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp: [Journal]
 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. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2000, v:7, n:, pp: [Journal]
 Jason P. Bell
Unavoidable and Almost Unavoidable Sets of Words. [Citation Graph (0, 0)][DBLP] IJAC, 2005, v:15, n:4, pp:717724 [Journal]
 Jason P. Bell, Teow Lim Goh
Exponential lower bounds for the number of words of uniform length avoiding a pattern. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:9, pp:12951306 [Journal]
Counting Rooted Trees: The Universal Law t(n)~C ?n n3/2. [Citation Graph (, )][DBLP]
padic valuations and kregular sequences. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
