default search action
Håkan Sundell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c15]Johannes Sahlin, Håkan Sundell, Håkan Alm, Jesper Holgersson:
Evaluating Artificial Short Message Service Campaigns Through Rule Based Multi-instance Multi-label Classification. AAAI Spring Symposium: Combining Machine Learning with Knowledge Engineering 2021
2010 – 2019
- 2018
- [c14]Ulf Johansson, Tuwe Löfström, Håkan Sundell, Henrik Linusson, Anders Gidenstam, Henrik Boström:
Venn predictors for well-calibrated probability estimation trees. COPA 2018: 3-14 - 2014
- [c13]Karl Jansson, Håkan Sundell, Henrik Boström:
gpuRF and gpuERT: Efficient and Scalable GPU Algorithms for Decision Tree Ensembles. IPDPS Workshops 2014: 1612-1621 - [c12]Nhan Nguyen, Philippas Tsigas, Håkan Sundell:
ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List. OPODIS 2014: 372-387 - 2013
- [i2]Daniel Cederman, Anders Gidenstam, Phuong Hoai Ha, Håkan Sundell, Marina Papatriantafilou, Philippas Tsigas:
Lock-free Concurrent Data Structures. CoRR abs/1302.2757 (2013) - 2011
- [j5]Håkan Sundell:
Wait-Free Multi-Word Compare-and-Swap Using Greedy Helping and Grabbing. Int. J. Parallel Program. 39(6): 694-716 (2011) - [c11]Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou
, Philippas Tsigas
A lock-free algorithm for concurrent bags. SPAA 2011: 335-344 - 2010
- [c10]Anders Gidenstam, Håkan Sundell, Philippas Tsigas
Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency. OPODIS 2010: 302-317
2000 – 2009
- 2009
- [j4]Anders Gidenstam, Marina Papatriantafilou
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting. IEEE Trans. Parallel Distributed Syst. 20(8): 1173-1187 (2009) - [c9]Håkan Sundell:
Wait-Free Multi-Word Compare-And-Swap using Greedy Helping and Grabbing. PDPTA 2009: 494-500 - 2008
- [j3]Håkan Sundell, Philippas Tsigas
Lock-free deques and doubly linked lists. J. Parallel Distributed Comput. 68(7): 1008-1020 (2008) - [j2]Håkan Sundell, Philippas Tsigas:
NOBLE: non-blocking programming support via lock-free shared abstract data types. SIGARCH Comput. Archit. News 36(5): 80-87 (2008) - 2007
- [c8]Håkan Sundell, Philippas Tsigas:
Practical and Lock-Free Doubly Linked Lists. PDPTA 2007: 264-270 - 2005
- [j1]Håkan Sundell, Philippas Tsigas
Fast and lock-free concurrent priority queues for multi-thread systems. J. Parallel Distributed Comput. 65(5): 609-627 (2005) - [c7]Håkan Sundell:
Wait-Free Reference Counting and Memory Management. IPDPS 2005 - [c6]Anders Gidenstam, Marina Papatriantafilou
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting. ISPAN 2005: 202-207 - 2004
- [b1]Håkan Sundell:
Efficient and Practical Non-Blocking Data Structures. Chalmers University of Technology, Gothenburg, Sweden, 2004 - [c5]Håkan Sundell, Philippas Tsigas:
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap. OPODIS 2004: 240-255 - [c4]Håkan Sundell, Philippas Tsigas:
Scalable and lock-free concurrent dictionaries. SAC 2004: 1438-1445 - [i1]Håkan Sundell, Philippas Tsigas:
Lock-Free and Practical Deques using Single-Word Compare-And-Swap. CoRR cs.DC/0408016 (2004) - 2003
- [c3]Håkan Sundell, Philippas Tsigas
Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems. IPDPS 2003: 84 - 2000
- [c2]Håkan Sundell, Philippas Tsigas, Yi Zhang:
A simple and fast Wait-Free Snapshot Algorithm for Real-Time Systems. OPODIS 2000: 91-106 - [c1]Håkan Sundell, Philippas Tsigas
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information. RTCSA 2000: 433-440
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-04-24 23:04 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: