| 2007 |
|---|
| 12 | EE | Devdatt P. Dubhashi,
Olle Häggström,
Lorenzo Orecchia,
Alessandro Panconesi,
Chiara Petrioli,
Andrea Vitaletti:
Localized Techniques for Broadcasting in Wireless Sensor Networks.
Algorithmica 49(4): 412-446 (2007) |
| 11 | EE | Devdatt P. Dubhashi,
Olle Häggström,
Gabriele Mambrini,
Alessandro Panconesi,
Chiara Petrioli:
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks.
Wireless Networks 13(1): 107-125 (2007) |
| 2006 |
|---|
| 10 | EE | Maria Deijfen,
Olle Häggström:
The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model.
Combinatorics, Probability & Computing 15(3): 345-353 (2006) |
| 9 | EE | Jacob van den Berg,
Olle Häggström,
Jeff Kahn:
Some conditional correlation inequalities for percolation and related processes.
Random Struct. Algorithms 29(4): 417-435 (2006) |
| 2005 |
|---|
| 8 | EE | Devdatt P. Dubhashi,
C. Johansson,
Olle Häggström,
Alessandro Panconesi,
Mauro Sozio:
Irrigating ad hoc networks in constant time.
SPAA 2005: 106-115 |
| 2001 |
|---|
| 7 | | Olle Häggström:
A note on disagreement percolation.
Random Struct. Algorithms 18(3): 267-278 (2001) |
| 2000 |
|---|
| 6 | | Olle Häggström,
Jeffrey E. Steif:
Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields.
Combinatorics, Probability & Computing 9(5): (2000) |
| 5 | EE | Itai Benjamini,
Olle Häggström,
Elchanan Mossel:
On Random Graph Homomorphisms into Z.
J. Comb. Theory, Ser. B 78(1): 86-114 (2000) |
| 1999 |
|---|
| 4 | | Olle Häggström,
Robin Pemantle:
On near-critical and dynamical percolation in the tree case.
Random Struct. Algorithms 15(3-4): 311-318 (1999) |
| 1998 |
|---|
| 3 | | Olle Häggström:
On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs.
Combinatorics, Probability & Computing 7(4): 397-401 (1998) |
| 2 | | Olle Häggström:
Uniform and minimal essential spanning forests on trees.
Random Struct. Algorithms 12(1): 27-50 (1998) |
| 1996 |
|---|
| 1 | | Olle Häggström,
Ronald W. J. Meester:
Nearest neighbor and hard sphere models in continuum percolation.
Random Struct. Algorithms 9(3): 295-315 (1996) |
