| A general technique for non-blocking trees T Brown, F Ellen, E Ruppert Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of …, 2014 | 145 | 2014 |
| Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way TA Brown Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 116 | 2015 |
| Non-blocking k-ary search trees T Brown, J Helga Principles of Distributed Systems, 207-221, 2011 | 60 | 2011 |
| Pragmatic primitives for non-blocking data structures T Brown, F Ellen, E Ruppert Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 51 | 2013 |
| Range queries in non-blocking k-ary search trees T Brown, H Avni Principles of Distributed Systems, 31-45, 2012 | 47 | 2012 |
| Investigating the performance of hardware transactions on a multi-socket machine T Brown, A Kogan, Y Lev, V Luchangco Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016 | 43 | 2016 |
| Harnessing epoch-based reclamation for efficient range queries M Arbel-Raviv, T Brown ACM SIGPLAN Notices 53 (1), 14-27, 2018 | 39 | 2018 |
| Persistent hybrid transactional memory for databases H Avni, T Brown Proceedings of the VLDB Endowment 10 (4), 409-420, 2016 | 34 | 2016 |
| Distributionally linearizable data structures D Alistarh, T Brown, J Kopinsky, JZ Li, G Nadiradze Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 33 | 2018 |
| Getting to the Root of Concurrent Binary Search Tree Performance M Arbel-Raviv, T Brown, A Morrison 2018 {USENIX} Annual Technical Conference ({USENIX}{ATC} 18), 295-306, 2018 | 31 | 2018 |
| Techniques for Constructing Efficient Lock-free Data Structures T Brown University of Toronto (Canada), 2017 | 30 | 2017 |
| Non-blocking interpolation search trees with doubly-logarithmic running time T Brown, A Prokopec, D Alistarh Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of …, 2020 | 24 | 2020 |
| Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors M Arbel-Raviv, T Brown arXiv preprint arXiv:1708.01797, 2017 | 19 | 2017 |
| NBR: neutralization based reclamation A Singh, T Brown, A Mashtizadeh Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of …, 2021 | 18 | 2021 |
| Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms D Alistarh, T Brown, J Kopinsky, G Nadiradze Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 14 | 2018 |
| A Template for Implementing Fast Lock-free Trees Using HTM T Brown Proceedings of the ACM Symposium on Principles of Distributed Computing, 293-302, 2017 | 14 | 2017 |
| PHyTM: Persistent Hybrid Transactional Memory. T Brown, H Avni Proc. VLDB Endow. 10 (4), 409-420, 2016 | 11 | 2016 |
| Elimination (a, b)-trees with fast, durable updates A Srivastava, T Brown Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022 | 9 | 2022 |
| Analysis and Evaluation of Non-Blocking Interpolation Search Trees A Prokopec, T Brown, D Alistarh arXiv preprint arXiv:2001.00413, 2020 | 6 | 2020 |
| B-slack trees: Space Efficient B-trees T Brown Algorithm Theory–SWAT 2014, 122-133, 2014 | 6 | 2014 |
Dan AlistarhIST AustriaVerified email at ist.ac.at
