Aravind Natarajan, Ph.D.
Affiliations: | 2014 | Computer Engineering | University of Texas at Dallas, Richardson, TX, United States |
Area:
Computer Engineering, Computer ScienceGoogle:
"Aravind Natarajan"Parents
Sign in to add mentorNeeraj Mittal | grad student | 2014 | UT Dallas | |
(Concurrent algorithms for binary search trees.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Natarajan A, Ramachandran A, Mittal N. (2020) FEAST: A Lightweight Lock-free Concurrent Binary Search Tree Acm Transactions On Parallel Computing. 7: 1-64 |
Natarajan A, Mittal N. (2014) Fast concurrent lock-free binary search trees Acm Sigplan Notices. 49: 317-328 |
Natarajan A, Chauhan H, Mittal N, et al. (2014) Efficient abstraction algorithms for predicate detection Theoretical Computer Science |
Natarajan A, Mittal N. (2013) Brief announcement: A concurrent lock-free red-black tree Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8205: 565-566 |
Natarajan A, Mittal N. (2010) False conflict reduction in the Swiss Transactional Memory (SwissTM) system Proceedings of the 2010 Ieee International Symposium On Parallel and Distributed Processing, Workshops and Phd Forum, Ipdpsw 2010 |