| 2007 |
|---|
| 14 | EE | William D. May,
John C. Wierman:
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds.
Combinatorics, Probability & Computing 16(2): 285-307 (2007) |
| 2006 |
|---|
| 13 | EE | Elvan Ceyhan,
Carey E. Priebe,
John C. Wierman:
Relative density of the random r.
Computational Statistics & Data Analysis 50(8): 1925-1964 (2006) |
| 2005 |
|---|
| 12 | EE | William D. May,
John C. Wierman:
Using Symmetry to Improve Percolation Threshold Bounds.
Combinatorics, Probability & Computing 14(4): 549-566 (2005) |
| 2004 |
|---|
| 11 | EE | John C. Wierman,
David J. Marchette:
Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction.
Computational Statistics & Data Analysis 45(1): 3-23 (2004) |
| 2003 |
|---|
| 10 | | John C. Wierman:
Upper And Lower Bounds For The Kagome Lattice Bond Percolation Critical Probability.
Combinatorics, Probability & Computing 12(1): (2003) |
| 9 | EE | John C. Wierman:
Pairs of graphs with site and bond percolation critical probabilities in opposite orders.
Discrete Applied Mathematics 129(2-3): 545-548 (2003) |
| 2002 |
|---|
| 8 | | John C. Wierman:
An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability.
Combinatorics, Probability & Computing 11(6): (2002) |
| 7 | EE | John C. Wierman:
Bond percolation critical probability bounds for three Archimedean lattices.
Random Struct. Algorithms 20(4): 507-518 (2002) |
| 1999 |
|---|
| 6 | | Sven Erick Alm,
John C. Wierman:
Inequalities For Means Of Restricted First-Passage Times In Percolation Theory.
Combinatorics, Probability & Computing 8(4): (1999) |
| 1995 |
|---|
| 5 | | John C. Wierman:
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model.
Combinatorics, Probability & Computing 4: 181-188 (1995) |
| 1992 |
|---|
| 4 | | John C. Wierman:
Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices.
Combinatorics, Probability & Computing 1: 95-105 (1992) |
| 1989 |
|---|
| 3 | | Tomasz Luczak,
John C. Wierman:
The chromatic number of random graphs at the double jump threshold.
Combinatorica 9(1): 39-49 (1989) |
| 2 | EE | Edward R. Scheinerman,
John C. Wierman:
Optimal and near-optimal broadcast in random graphs.
Discrete Applied Mathematics 25(3): 289-297 (1989) |
| 1988 |
|---|
| 1 | EE | Krzysztof Nowicki,
John C. Wierman:
Subgraph counts in random graphs using incomplete u-statistics methods.
Discrete Mathematics 72(1-3): 299-310 (1988) |
