default search action
Olle Häggström
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c6]James D. Miller, Roman Yampolskiy, Olle Häggström, Stuart Armstrong:
Chess as a Testing Grounds for the Oracle Approach to AI Safety. AISafety@IJCAI 2021 - [i3]Olle Häggström:
AI, orthogonality and the Müller-Cannon instrumental vs general intelligence distinction. CoRR abs/2109.07911 (2021) - 2020
- [i2]James D. Miller, Roman Yampolskiy, Olle Häggström, Stuart Armstrong:
Chess as a Testing Grounds for the Oracle Approach to AI Safety. CoRR abs/2010.02911 (2020)
2010 – 2019
- 2019
- [j15]Olle Häggström, Timo Hirscher:
Water transport on infinite graphs. Random Struct. Algorithms 54(3): 515-527 (2019) - 2018
- [c5]Olle Häggström:
Thinking in Advance About the Last Algorithm We Ever Need to Invent (Keynote Speakers). AofA 2018: 5:1-5:12 - 2014
- [c4]Claes Strannegård, Abdul Rahim Nizamani, Fredrik Engström, Olle Häggström:
Symbolic Reasoning with Bounded Cognitive Resources. CogSci 2014 - 2013
- [j14]Olle Häggström, Johan Wästlund:
Rigorous Computer Analysis of the Chow-Robbins Game. Am. Math. Mon. 120(10): 893-900 (2013) - 2012
- [c3]Claes Strannegård, Olle Häggström, Johan Wessberg, Christian Balkenius
:
Transparent Neural Networks - Integrating Concept Formation and Reasoning. AGI 2012: 302-311 - [i1]Olle Häggström, Johan Wästlund:
Rigorous computer analysis of the Chow-Robbins game. CoRR abs/1201.0626 (2012)
2000 – 2009
- 2008
- [j13]Kimmo Eriksson
Instability of matchings in decentralized markets with various preference structures. Int. J. Game Theory 36(3-4): 409-420 (2008) - 2007
- [j12]Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia
Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49(4): 412-446 (2007) - [j11]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. Wirel. Networks 13(1): 107-125 (2007) - 2006
- [j10]Olle Häggström, Gil Kalai, Elchanan Mossel
A law of large numbers for weighted majority. Adv. Appl. Math. 37(1): 112-123 (2006) - [j9]Maria Deijfen, Olle Häggström:
The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model. Comb. Probab. Comput. 15(3): 345-353 (2006) - [j8]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
- [c2]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
- [j7]Olle Häggström:
A note on disagreement percolation. Random Struct. Algorithms 18(3): 267-278 (2001) - 2000
- [j6]Olle Häggström, Jeffrey E. Steif:
Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields. Comb. Probab. Comput. 9(5): 425-439 (2000) - [j5]Itai Benjamini, Olle Häggström, Elchanan Mossel
On Random Graph Homomorphisms into Z. J. Comb. Theory B 78(1): 86-114 (2000)
1990 – 1999
- 1999
- [j4]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
- [j3]Olle Häggström:
On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs. Comb. Probab. Comput. 7(4): 397-401 (1998) - [j2]Olle Häggström:
Uniform and minimal essential spanning forests on trees. Random Struct. Algorithms 12(1): 27-50 (1998) - 1997
- [c1]Olle Häggström:
Dynamical percolation: Early results and open problems. Microsurveys in Discrete Probability 1997: 59-74 - 1996
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: