The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Neil J. Calkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Dankelmann, Neil J. Calkin
    The Domatic Number of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  2. Neil J. Calkin, Criel Merino, S. Noble, Marc Noy
    Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  3. Neil J. Calkin
    Dependent Sets of Constant Weight Binary Vectors. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:3, pp:263-271 [Journal]
  4. Neil J. Calkin, Peter J. Cameron
    Almost Odd Random Sum-Free Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:27-32 [Journal]
  5. Neil J. Calkin, Alan M. Frieze, Brendan D. McKay
    On Subgraph Sizes in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:123-134 [Journal]
  6. Neil J. Calkin, Jennifer D. Key, Marialuisa J. de Resmini
    Minimum Weight and Dimension Formulas for Some Geometric Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:105-120 [Journal]
  7. Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf
    Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:171-190 [Journal]
  8. Neil J. Calkin
    Dependent sets of constant weight vectors in GF(q). [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:49-53 [Journal]
  9. Neil J. Calkin, Alan M. Frieze
    Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:1, pp:39-50 [Journal]
  10. Neil J. Calkin, Alan M. Frieze, Ludek Kucera
    On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:2, pp:215-222 [Journal]
  11. Neil J. Calkin, Paul Erdös, Craig A. Tovey
    New Ramsey Bounds from Cyclic Graphs of Prime Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:381-387 [Journal]
  12. Neil J. Calkin, Herbert S. Wilf
    The Number of Independent Sets in a Grid Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:54-60 [Journal]
  13. Neil J. Calkin
    On the structure of a random sum-free set of positive integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:247-257 [Journal]
  14. Neil J. Calkin
    A curious binomial identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:335-337 [Journal]

  15. Finite field elements of high order arising from modular curves. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002