| |
| 2007 | ||
|---|---|---|
| 5 | EE | Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan: Positive Influence and Negative Dependence. Combinatorics, Probability & Computing 16(1): 29-41 (2007) |
| 2000 | ||
| 4 | EE | Johan Jonasson: An upper bound on the cover time for powers of graphs. Discrete Mathematics 222(1-3): 181-190 (2000) |
| 3 | Johan Jonasson: Lollipop graphs are extremal for commute times. Random Struct. Algorithms 16(2): 131-142 (2000) | |
| 2 | Johan Jonasson, Elchanan Mossel, Yuval Peres: Percolation in a dependent random environment. Random Struct. Algorithms 16(4): 333-343 (2000) | |
| 1998 | ||
| 1 | Johan Jonasson: On the Cover Time for Random Walks on Random Graphs. Combinatorics, Probability & Computing 7(3): 265-279 (1998) | |
| 1 | Devdatt P. Dubhashi | [5] |
| 2 | Elchanan Mossel | [2] |
| 3 | Yuval Peres | [2] |
| 4 | Desh Ranjan | [5] |