Nearest neighbor and hard sphere models in continuum percolation. - Olle Häggström; Ronald W. J. Meester (Random Struct. Algorithms, 1996)

Dynamical percolation: Early results and open problems. - Olle Häggström (Microsurveys in Discrete Probability, 1997)

On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs. - Olle Häggström (Comb. Probab. Comput., 1998)

Uniform and minimal essential spanning forests on trees. - Olle Häggström (Random Struct. Algorithms, 1998)

On near-critical and dynamical percolation in the tree case. - Olle Häggström; Robin Pemantle (Random Struct. Algorithms, 1999)

Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields. - Olle Häggström; Jeffrey E. Steif (Comb. Probab. Comput., 2000)

On Random Graph Homomorphisms into Z. - Itai Benjamini; Olle Häggström; Elchanan Mossel (J. Comb. Theory B, 2000)

A note on disagreement percolation. - Olle Häggström (Random Struct. Algorithms, 2001)

Irrigating ad hoc networks in constant time. - Devdatt P. Dubhashi; C. Johansson; Olle Häggström; Alessandro Panconesi; Mauro Sozio (SPAA, 2005)

A law of large numbers for weighted majority. - Olle Häggström; Gil Kalai; Elchanan Mossel (Adv. Appl. Math., 2006)

The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model. - Maria Deijfen; Olle Häggström (Comb. Probab. Comput., 2006)

Some conditional correlation inequalities for percolation and related processes. - Jacob van den Berg; Olle Häggström; Jeff Kahn 001 (Random Struct. Algorithms, 2006)

Localized Techniques for Broadcasting in Wireless Sensor Networks. - Devdatt P. Dubhashi; Olle Häggström; Lorenzo Orecchia; Alessandro Panconesi; Chiara Petrioli; Andrea Vitaletti (Algorithmica, 2007)

Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. - Devdatt P. Dubhashi; Olle Häggström; Gabriele Mambrini; Alessandro Panconesi; Chiara Petrioli (Wirel. Networks, 2007)

Instability of matchings in decentralized markets with various preference structures. - Kimmo Eriksson; Olle Häggström (Int. J. Game Theory, 2008)

Transparent Neural Networks - Integrating Concept Formation and Reasoning. - Claes Strannegård; Olle Häggström; Johan Wessberg; Christian Balkenius (AGI, 2012)

Rigorous Computer Analysis of the Chow-Robbins Game. - Olle Häggström; Johan Wästlund (Am. Math. Mon., 2013)

Symbolic Reasoning with Bounded Cognitive Resources. - Claes Strannegård; Abdul Rahim Nizamani; Fredrik Engström; Olle Häggström (CogSci, 2014)

Thinking in Advance About the Last Algorithm We Ever Need to Invent (Keynote Speakers). - Olle Häggström (AofA, 2018)

Water transport on infinite graphs. - Olle Häggström; Timo Hirscher (Random Struct. Algorithms, 2019)

Chess as a Testing Grounds for the Oracle Approach to AI Safety. - James D. Miller; Roman Yampolskiy; Olle Häggström; Stuart Armstrong (AISafety@IJCAI, 2021)

AI, orthogonality and the Müller-Cannon instrumental vs general intelligence distinction. - Olle Häggström (CoRR, 2021)