| Fast and lock-free concurrent priority queues for multi-thread systems H Sundell, P Tsigas Journal of Parallel and Distributed Computing 65 (5), 609-627, 2005 | 249 | 2005 |
| Efficient and reliable lock-free memory reclamation based on reference counting A Gidenstam, M Papatriantafilou, H Sundell, P Tsigas IEEE Transactions on Parallel and Distributed Systems 20 (8), 1173-1187, 2008 | 98 | 2008 |
| Lock-free deques and doubly linked lists H Sundell, P Tsigas Journal of Parallel and Distributed Computing 68 (7), 1008-1020, 2008 | 78 | 2008 |
| Scalable and lock-free concurrent dictionaries H Sundell, P Tsigas Proceedings of the 2004 ACM Symposium on Applied computing, 1438-1445, 2004 | 75 | 2004 |
| Wait-free reference counting and memory management H Sundell 19th IEEE International Parallel and Distributed Processing Symposium, 10 pp., 2005 | 66 | 2005 |
| Lock-free and practical doubly linked list-based deques using single-word compare-and-swap H Sundell, P Tsigas Principles of Distributed Systems: 8th International Conference, OPODIS 2004 …, 2005 | 53 | 2005 |
| Efficient and practical non-blocking data structures H Sundell Department of Computer Engineering, Chalmers University of Technology, 2004 | 53 | 2004 |
| NOBLE: A non-blocking inter-process communication library H Sundell, P Tsigas Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems …, 2002 | 46 | 2002 |
| Cache-aware lock-free queues for multiple producers/consumers and weak memory consistency A Gidenstam, H Sundell, P Tsigas Principles of Distributed Systems: 14th International Conference, OPODIS …, 2010 | 41 | 2010 |
| Wait-free multi-word compare-and-swap using greedy helping and grabbing H Sundell International Journal of Parallel Programming 39, 694-716, 2011 | 33 | 2011 |
| A lock-free algorithm for concurrent bags H Sundell, A Gidenstam, M Papatriantafilou, P Tsigas Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011 | 33 | 2011 |
| Lock‐Free Concurrent Data Structures D Cederman, A Gidenstam, P Ha, H Sundell, M Papatriantafilou, P Tsigas Programming multi‐core and many‐core computing systems, 59-79, 2017 | 29 | 2017 |
| gpuRF and gpuERT: efficient and scalable GPU algorithms for decision tree ensembles K Jansson, H Sundell, H Boström 2014 IEEE international parallel & distributed processing symposium …, 2014 | 28 | 2014 |
| Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information H Sundell, P Tsigas Proceedings Seventh International Conference on Real-Time Computing Systems …, 2000 | 20 | 2000 |
| Lock-free and practical deques using single-word compare-and-swap H Sundell, P Tsigas arXiv preprint cs/0408016, 2004 | 19 | 2004 |
| Venn predictors for well-calibrated probability estimation trees U Johansson, T Löfström, H Sundell, H Linusson, A Gidenstam, ... Conformal and Probabilistic Prediction and Applications, 3-14, 2018 | 14 | 2018 |
| Noble: non-blocking programming support via lock-free shared abstract data types H Sundell, P Tsigas ACM SIGARCH Computer Architecture News 36 (5), 80-87, 2009 | 14 | 2009 |
| Evaluating the performance of wait-free snapshots in real-time systems B Allvin, A Ermedahl, H Hansson, M Papatriantafilou, H Sundell, P Tsigas SNART’99 Real Time Systems Conference, 196-207, 1999 | 11 | 1999 |
| Practical and efficient lock-free garbage collection based on reference counting A Gidenstam, M Papatriantafilou, H Sundell, P Tsigas Chalmers tekniska högsk., 2005 | 10 | 2005 |
| A simple and fast Wait-Free Snapshot Algorithm for Real-Time Systems. H Sundell, P Tsigas, Y Zhang OPODIS, 91-106, 2000 | 9 | 2000 |
Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyVerified email at chalmers.se
