The SCEAS System
Navigation Menu

Search the dblp DataBase


Jason P. Bell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jason P. Bell
    When Structures Are Almost Surely Connected. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  2. Jason P. Bell, Stanley Burris
    Partition Identities I: Sandwich Theorems and Logical 0-1 Laws. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  3. 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]
  4. Jason P. Bell
    Unavoidable and Almost Unavoidable Sets of Words. [Citation Graph (0, 0)][DBLP]
    IJAC, 2005, v:15, n:4, pp:717-724 [Journal]
  5. 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:1295-1306 [Journal]

  6. Counting Rooted Trees: The Universal Law t(n)~C ?-n n-3/2. [Citation Graph (, )][DBLP]

  7. p-adic valuations and k-regular sequences. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002