Maya Arbel-Raviv

According to our database, Maya Arbel-Raviv authored at least 8 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Theoretical and Experimental Methods for Concurrent Search Trees.

Maya Arbel-Raviv

PhD thesis, 2018

Getting to the Root of Concurrent Binary Search Tree Performance.

Maya Arbel-Raviv, Trevor Brown, Adam Morrison

Proceedings of the 2018 USENIX Annual Technical Conference, 2018

Harnessing epoch-based reclamation for efficient range queries.

Maya Arbel-Raviv, Trevor Brown

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

2017

Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors.

Maya Arbel-Raviv, Trevor Brown

Proceedings of the 31st International Symposium on Distributed Computing, 2017

POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors.

Maya Arbel-Raviv, Trevor Brown

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2015

Towards Automatic Lock Removal for Scalable Synchronization.

Maya Arbel, Guy Golan-Gueta, Eshcar Hillel, Idit Keidar

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Predicate RCU: an RCU for scalable concurrent updates.

Maya Arbel, Adam Morrison

Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

2014

Concurrent updates with RCU: search tree as an example.

Maya Arbel, Hagit Attiya

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014