The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorics, Probability & Computing
1997, volume: 6, number: 1

  1. Andrew D. Barbour, Anant P. Godbole, Jinghua Qian
    Imperfections in Random Tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:1-15 [Journal]
  2. Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond
    Submap Density and Asymmetry Results for Two Parameter Map Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:17-25 [Journal]
  3. Laurent Decreusefond, Gilles Zémor
    On the Error-Correcting Capabilities of Cycle Codes of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:27-38 [Journal]
  4. Tristan Denley
    On a Result of Lemke and Kleitman. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:39-43 [Journal]
  5. Kimmo Eriksson
    Autocorrelation and the Enumeration of Strings Avoiding a Fixed String. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:45-48 [Journal]
  6. Andrew S. Greenhalgh
    A Model for Random Random-Walks on Finite Groups. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:49-56 [Journal]
  7. Ulrich Martin Hirth
    Probabilistic Number Theory, the GEM/Poisson-Dirichlet Distribution and the Arc-sine Law. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:57-77 [Journal]
  8. Colin McDiarmid
    Centering Sequences with Bounded Differences. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:79-86 [Journal]
  9. Dudley Stark
    Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:87-105 [Journal]
  10. Pou-Lin Wu
    An Upper Bound on the Number of Edges of a 2-Connected Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:107-113 [Journal]
  11. Raphael Yuster
    Independent Transversals and Independent Coverings in Sparse Partite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:115-125 [Journal]
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002