The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorics, Probability & Computing
1992, volume: 1, number:

  1. László Babai, Mario Szegedy
    Local Expansion of Ssymmetrical Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:1-11 [Journal]
  2. Chris D. Godsil
    Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:13-25 [Journal]
  3. Roland Häggkvist
    On the structure of Non-Hamiltonian Graphs 1. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:27-34 [Journal]
  4. Tomasz Luczak, Boris Pittel
    Componenets of Random Forests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:35-52 [Journal]
  5. Hans Jürgen Prömel, Angelika Steger
    Almost all Berge Graphs are Perfect. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:53-79 [Journal]
  6. Joel Spencer, Peter Winkler
    Three Thresholds for a Liar. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:81-93 [Journal]
  7. John C. Wierman
    Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:95-105 [Journal]
  8. Noga Alon
    Choice Numbers of Graphs: a Probabilistic Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:107-114 [Journal]
  9. A. Robert Calderbank, Peter Frankl
    Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:115-122 [Journal]
  10. 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]
  11. Persi Diaconis, James Allen Fill, Jim Pitman
    Analysis of Top To Random Shuffles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:135-155 [Journal]
  12. Colin McDiarmid
    On a Correlation Inequality of Farr. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:157-160 [Journal]
  13. Ora Engelberg Percus, Jerome K. Percus
    An Expanded Set of Correlation Tests for Linear Congruential Random Number Generators. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:161-168 [Journal]
  14. Andrzej Rucinski, Nicholas C. Wormald
    Random Graph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:169-180 [Journal]
  15. Dirk Vertigan, Dominic J. A. Welsh
    The Compunational Complexity of the Tutte Plane: the Bipartite Case. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:181-187 [Journal]
  16. Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
    Point Selections and Weak e-Nets for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:189-200 [Journal]
  17. László Babai, Gábor Hetyei
    On the Diameter of Random Cayley Graphs of the Symmetric Group. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:201-208 [Journal]
  18. Victor Bryant
    A Characterisation of Strict Matching Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:209-217 [Journal]
  19. Y. Fan, K. Percus
    Duality for Random Sequential Adsorption on a Lattice. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:219-222 [Journal]
  20. Jerzy Jaworski, Tomasz Luczak
    Cycles in a Uniform Graph Process. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:223-239 [Journal]
  21. Guoping Jin
    Complete Subgraphs of r-partite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:241-250 [Journal]
  22. Tamás F. Móri
    Maximum Waiting Times are Asymptotically Independent. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:251-264 [Journal]
  23. Bruce A. Reed, Colin McDiarmid
    The Strongly Connected Components of 1-in, 1-out. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:265-274 [Journal]
  24. Geoff Whittle
    Duality in Polymatroids and Set Functions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:275-280 [Journal]
  25. David Aldous
    Greedy Search on the Binary Tree with random Edge-Weights. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:281-293 [Journal]
  26. Imre Bárány, János Pach
    On the Number of Convex Lattice Polygons. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:295-302 [Journal]
  27. Colin Cooper
    On the Trickness of Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:303-309 [Journal]
  28. János A. Csirik
    Optimal Strategy for the First Player in the Penney Ante Game. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:311-321 [Journal]
  29. Péter L. Erdös, Ulrich Faigle, Walter Kern
    A Group-Theoretic Setting for Some Intersecting Sperner Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:323-334 [Journal]
  30. Alex D. Scott
    Large Induced Subgraphs with All Degrees Odd. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:335-349 [Journal]
  31. Alistair Sinclair
    Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:351-370 [Journal]
  32. Carsten Thomassen
    Plane Cubic Graphs with Prescribed Face Areas. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:371-381 [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