default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Gidenstam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c14]Dirar Sweidan
, Ulf Johansson, Anders Gidenstam, Beatrice Alenljung:
Predicting Customer Churn in Retailing. ICMLA 2022: 635-640
2010 – 2019
- 2018
- [c13]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 - [i5]Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas:
White-box methodologies, programming abstractions and libraries. CoRR abs/1801.08761 (2018) - [i4]Phuong Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Philippas Tsigas, Anders Gidenstam, Paul Renaud-Goud, Ivan Walulya, Aras Atalar:
Models for energy consumption of data structures and algorithms. CoRR abs/1801.09992 (2018) - [i3]Phuong Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas, Ivan Walulya:
Power models, energy models and libraries for energy-efficient concurrent data structures and algorithms. CoRR abs/1801.10556 (2018) - [i2]Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar, Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas, Ivan Walulya:
D2.4 Report on the final prototype of programming abstractions for energy-efficient inter-process communication. CoRR abs/1802.03013 (2018) - 2015
- [c12]Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
Of Concurrent Data Structures and Iterations. Algorithms, Probability, Networks, and Games 2015: 358-369 - [c11]Aras Atalar, Anders Gidenstam, Paul Renaud-Goud, Philippas Tsigas:
Modeling Energy Consumption of Lock-Free Queue Implementations. IPDPS 2015: 229-238 - [c10]Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
A Consistency Framework for Iteration Operations in Concurrent Data Structures. IPDPS 2015: 239-248 - 2013
- [j5]Anders Gidenstam, Boris Koldehofe, Marina Papatriantafilou, Philippas Tsigas:
Scalable group communication supporting configurable levels of consistency. Concurr. Comput. Pract. Exp. 25(5): 649-671 (2013) - [i1]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
- [c9]Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
A lock-free algorithm for concurrent bags. SPAA 2011: 335-344 - 2010
- [j4]Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
NBmalloc: Allocating Memory in a Lock-Free Manner. Algorithmica 58(2): 304-338 (2010) - [c8]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
- [j3]Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell, Philippas Tsigas:
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting. IEEE Trans. Parallel Distributed Syst. 20(8): 1173-1187 (2009) - 2008
- [j2]Andreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas:
Multiword atomic read/write registers on multiprocessor systems. ACM J. Exp. Algorithmics 13 (2008) - [j1]Anders Gidenstam, Marina Papatriantafilou:
LFTHREADS: a lock-free thread library. SIGARCH Comput. Archit. News 36(5): 88-92 (2008) - 2007
- [c7]Anders Gidenstam, Marina Papatriantafilou:
LFthreads: A Lock-Free Thread Library. OPODIS 2007: 217-231 - 2006
- [b1]Anders Gidenstam:
Algorithms for synchronization and consistency in concurrent system services. Chalmers University of Technology, Gothenburg, Sweden, 2006 - 2005
- [c6]Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
Allocating Memory in a Lock-Free Manner. ESA 2005: 329-342 - [c5]Anders Gidenstam, Boris Koldehofe, Marina Papatriantafilou, Philippas Tsigas:
Lightweight Causal Cluster Consistency. IICS 2005: 17-28 - [c4]Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell, Philippas Tsigas:
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting. ISPAN 2005: 202-207 - [c3]Anders Gidenstam, Boris Koldehofe, Marina Papatriantafilou, Philippas Tsigas:
Dynamic and Fault-tolerant Cluster Management. Peer-to-Peer Computing 2005: 237-244 - 2004
- [c2]Andreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas:
Multi-word Atomic Read/Write Registers on Multiprocessor Systems. ESA 2004: 736-748 - [c1]Anders Gidenstam, Marina Papatriantafilou:
Adaptive Plausible Clocks. ICDCS 2004: 86-93
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-10-07 21:15 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:
