John Gates Some Dual Problems of Geometric Probability in the Plane. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:11-23 [Journal]
Joseph P. S. Kung Sign-Coherent Identities for Characteristic Polynomials of Matroids. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:33-51 [Journal]
Boris Pittel On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:53-92 [Journal]
D. H. Smith Optimally Reliable Graphs for Both Vertex and Edge Failures. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:93-100 [Journal]
Sven Erick Alm Upper Bounds for the Connective Constant of Self-Avoiding Walks. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:115-136 [Journal]
Gregory F. Lawler A Discrete Analogue of a Theorem of Makarov. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:181-199 [Journal]
Jennie C. Hansen Factorization in Fq(x) and Brownian Motion. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:285-299 [Journal]
Salvatore Ingrassia Geometric Approaches to the Estimaton of the Spectral Gap of Reversible Marcov Chains. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:301-323 [Journal]
Bill Jackson A Zero-Free Interval for Chromatic Polynomials of Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:325-336 [Journal]
James F. Lynch Threshold Functions for Markov Chains: a Graph Theoretic Approach. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:351-362 [Journal]
Colin McDiarmid A Random Recolouring Method for Graphs and Hypergrams. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:363-365 [Journal]