Håkan Sundell

According to our database, Håkan Sundell authored at least 20 papers between 2000 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Evaluating Artificial Short Message Service Campaigns Through Rule Based Multi-instance Multi-label Classification.

Johannes Sahlin, Håkan Sundell, Håkan Alm, Jesper Holgersson

Proceedings of the AAAI 2021 Spring Symposium on Combining Machine Learning and Knowledge Engineering (AAAI-MAKE 2021), 2021

2018

Venn predictors for well-calibrated probability estimation trees.

Ulf Johansson, Tuwe Löfström, Håkan Sundell, Henrik Linusson, Anders Gidenstam, Henrik Boström

Proceedings of the 7th Symposium on Conformal and Probabilistic Prediction and Applications, 2018

2014

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List.

Nhan Nguyen, Philippas Tsigas, Håkan Sundell

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

gpuRF and gpuERT: Efficient and Scalable GPU Algorithms for Decision Tree Ensembles.

Karl Jansson, Håkan Sundell, Henrik Boström

Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

2013

Lock-free Concurrent Data Structures

Daniel Cederman, Anders Gidenstam, Phuong Hoai Ha, Håkan Sundell, Marina Papatriantafilou, Philippas Tsigas

CoRR, 2013

2011

Wait-Free Multi-Word Compare-and-Swap Using Greedy Helping and Grabbing.

Håkan Sundell

Int. J. Parallel Program., 2011

A lock-free algorithm for concurrent bags.

Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010

Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency.

Anders Gidenstam, Håkan Sundell, Philippas Tsigas

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting.

Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell, Philippas Tsigas

IEEE Trans. Parallel Distributed Syst., 2009

2008

NOBLE: non-blocking programming support via lock-free shared abstract data types.

Håkan Sundell, Philippas Tsigas

SIGARCH Comput. Archit. News, 2008

Lock-free deques and doubly linked lists.

Håkan Sundell, Philippas Tsigas

J. Parallel Distributed Comput., 2008

2007

Practical and Lock-Free Doubly Linked Lists.

Håkan Sundell, Philippas Tsigas

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

2005

Fast and lock-free concurrent priority queues for multi-thread systems.

Håkan Sundell, Philippas Tsigas

J. Parallel Distributed Comput., 2005

Wait-Free Reference Counting and Memory Management.

Håkan Sundell

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004

Efficient and Practical Non-Blocking Data Structures.

Håkan Sundell

PhD thesis, 2004

Lock-Free and Practical Deques using Single-Word Compare-And-Swap

Håkan Sundell, Philippas Tsigas

CoRR, 2004

Scalable and lock-free concurrent dictionaries.

Håkan Sundell, Philippas Tsigas

Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap.

Håkan Sundell, Philippas Tsigas

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2000

Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information.

Håkan Sundell, Philippas Tsigas

Proceedings of the 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 2000

A simple and fast Wait-Free Snapshot Algorithm for Real-Time Systems.

Håkan Sundell, Philippas Tsigas, Yi Zhang

Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000