Håkan Sundell - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2021

Evaluating Artificial Short Message Service Campaigns Through Rule Based Multi-instance Multi-label ClassificationJohannes Sahlin, Håkan Sundell, Håkan Alm, Jesper Holgersson. aaaiss 2021: [doi]

2018

Venn predictors for well-calibrated probability estimation treesUlf Johansson, Tuve Löfström, Håkan Sundell, Henrik Linusson, Anders Gidenstam, Henrik Boström. copa 2018: 3-14 [doi]

2014

gpuRF and gpuERT: Efficient and Scalable GPU Algorithms for Decision Tree EnsemblesKarl Jansson, Håkan Sundell, Henrik Boström. ipps 2014: 1612-1621 [doi]

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-ListNhan Nguyen, Philippas Tsigas, Håkan Sundell. opodis 2014: 372-387 [doi]

2011

Wait-Free Multi-Word Compare-and-Swap Using Greedy Helping and GrabbingHåkan Sundell. ijpp, 39(6):694-716, 2011. [doi]

A lock-free algorithm for concurrent bagsHåkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas. spaa 2011: 335-344 [doi]

2010

Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory ConsistencyAnders Gidenstam, Håkan Sundell, Philippas Tsigas. opodis 2010: 302-317 [doi]

2008

Lock-free deques and doubly linked listsHåkan Sundell, Philippas Tsigas. jpdc, 68(7):1008-1020, 2008. [doi]

NOBLE: non-blocking programming support via lock-free shared abstract data typesHåkan Sundell, Philippas Tsigas. sigarch, 36(5):80-87, 2008. [doi]

2007

Practical and Lock-Free Doubly Linked ListsHåkan Sundell, Philippas Tsigas. pdpta 2007: 264-270

2005

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference CountingAnders Gidenstam, Marina Papatriantafilou, Håkan Sundell, Philippas Tsigas. ispan 2005: 202-207 [doi]

Wait-Free Reference Counting and Memory ManagementHåkan Sundell. ipps 2005: [doi]

Fast and lock-free concurrent priority queues for multi-thread systemsHåkan Sundell, Philippas Tsigas. jpdc, 65(5):609-627, 2005. [doi]

2004

Efficient and Practical Non-Blocking Data StructuresHåkan Sundell. PhD thesis, Chalmers University of Technology, Gothenburg, Sweden, 2004. [doi]

Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-SwapHåkan Sundell, Philippas Tsigas. opodis 2005: 240-255 [doi]

Scalable and lock-free concurrent dictionariesHåkan Sundell, Philippas Tsigas. SAC 2004: 1438-1445 [doi]

2003

Fast and Lock-Free Concurrent Priority Queues for Multi-Thread SystemsHåkan Sundell, Philippas Tsigas. ipps 2003: 84 [doi]

2000

Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing informationHåkan Sundell, Philippas Tsigas. rtcsa 2000: 433-440 [doi]

A simple and fast Wait-Free Snapshot Algorithm for Real-Time SystemsHåkan Sundell, Philippas Tsigas, Yi Zhang. opodis 2000: 91-106

Sign in or sign up to see more results.

runs on WebDSL