Olle Häggström

24 papers B 2C 1Journal 18Unranked 3
YearRankTypeTitle / Venue / Authors
2021 J jnl
AI, orthogonality and the Müller-Cannon instrumental vs general intelligence distinction.
CoRR
Olle Häggström
2021 — conf
Chess as a Testing Grounds for the Oracle Approach to AI Safety.
AISafety@IJCAI
James D. Miller, Roman Yampolskiy, Olle Häggström, Stuart Armstrong
2020 J jnl
Chess as a Testing Grounds for the Oracle Approach to AI Safety.
CoRR
James D. Miller, Roman Yampolskiy, Olle Häggström, Stuart Armstrong
2019 J jnl
Water transport on infinite graphs.
Random Struct. Algorithms
Olle Häggström, Timo Hirscher
2018 C conf
Thinking in Advance About the Last Algorithm We Ever Need to Invent (Keynote Speakers).
AofA
Olle Häggström
2014 B conf
Symbolic Reasoning with Bounded Cognitive Resources.
CogSci
Claes Strannegård, Abdul Rahim Nizamani, Fredrik Engström, Olle Häggström
2013 J jnl
Rigorous Computer Analysis of the Chow-Robbins Game.
Am. Math. Mon.
Olle Häggström, Johan Wästlund
2012 J jnl
Rigorous computer analysis of the Chow-Robbins game
CoRR
Olle Häggström, Johan Wästlund
2012 — conf
Transparent Neural Networks - Integrating Concept Formation and Reasoning.
AGI
Claes Strannegård, Olle Häggström, Johan Wessberg, Christian Balkenius
2008 J jnl
Instability of matchings in decentralized markets with various preference structures.
Int. J. Game Theory
Kimmo Eriksson, Olle Häggström
2007 J jnl
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks.
Wirel. Networks
Devdatt P. Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli
2007 J jnl
Localized Techniques for Broadcasting in Wireless Sensor Networks.
Algorithmica
Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti
2006 J jnl
A law of large numbers for weighted majority.
Adv. Appl. Math.
Olle Häggström, Gil Kalai, Elchanan Mossel
2006 J jnl
Some conditional correlation inequalities for percolation and related processes.
Random Struct. Algorithms
Jacob van den Berg, Olle Häggström, Jeff Kahn
2006 J jnl
The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model.
Comb. Probab. Comput.
Maria Deijfen, Olle Häggström
2005 B conf
Irrigating ad hoc networks in constant time.
SPAA
Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio
2001 J jnl
A note on disagreement percolation.
Random Struct. Algorithms
Olle Häggström
2000 J jnl
On Random Graph Homomorphisms into Z.
J. Comb. Theory B
Itai Benjamini, Olle Häggström, Elchanan Mossel
2000 J jnl
Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields.
Comb. Probab. Comput.
Olle Häggström, Jeffrey E. Steif
1999 J jnl
On near-critical and dynamical percolation in the tree case.
Random Struct. Algorithms
Olle Häggström, Robin Pemantle
1998 J jnl
On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs.
Comb. Probab. Comput.
Olle Häggström
1998 J jnl
Uniform and minimal essential spanning forests on trees.
Random Struct. Algorithms
Olle Häggström
1997 — conf
Dynamical percolation: Early results and open problems.
Microsurveys in Discrete Probability
Olle Häggström
1996 J jnl
Nearest neighbor and hard sphere models in continuum percolation.
Random Struct. Algorithms
Olle Häggström, Ronald W. J. Meester