Transactional Data Structures
Transactional Data Structures is a class of concurrent data structures designed to support atomic, consistent, isolated, and durable (ACID) operations within parallel computing environments by integrating transactional memory principles to ensure correct and coordinated access under concurrency.
72
Publications
4.7K
Citations
198
Authors
86
Institutions
Publications per year
2017–2026
11
Parents
72
Software transactional memory for dynamic-sized data structures
Maurice Herlihy, Victor Luchangco, Mark Moir et al. · 2003 · 999 citations
Cristian Diaconu, Craig Freedman, Erik Ismert et al. · 2013 · 469 citations
Concurrent programming without locks
Keir Fraser, Tim Harris · ACM Transactions on Computer Systems · 2007 · 260 citations
1–5 of 72
198
5
h-index
5
h-index
4
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
3 publications · 125 citations
3
h-index
3
h-index
1–5 of 198
86
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
6 h-index
8 publications
589 citations

University of Rochester
Rochester, United States
4 h-index
7 publications
1.1K citations
Microsoft (United States)
Redmond, United States
4 h-index
13 publications
4K citations
Brown University
Providence, United States
4 h-index
6 publications
1.2K citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
8 publications
348 citations
Technische Universität Dresden
Dresden, Germany
3 h-index
6 publications
259 citations
Intel (United States)
Santa Clara, United States
3 h-index
9 publications
915 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
16 publications
850 citations
1–8 of 86
PVLDB · 3 publications · 126 citations
3
h-index
AJAS · 1 publications · 48 citations
1
h-index
1 publications · 15 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
TKDE · 1 publications · 25 citations
1
h-index
1–5