13 citations · 31 across the 13 of their papers we have counts for
19 papers
Privacy-Preserving Vertical K-Means Clustering
Federico Mazzone, Trevor Brown, Florian Kerschbaum +4
Clustering is a fundamental data processing task used for grouping records based on one or more features. In the vertically partitioned setting, data is distributed among entities,…
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures
Ajay Singh, Trevor Brown, Michael Spear
Safe memory reclamation (SMR) algorithms are crucial for preventing use-after-free errors in optimistic data structures. SMR algorithms typically delay reclamation for safety and r…
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures
Trevor Brown, William Sigouin, Dan Alistarh
To maximize the performance of concurrent data structures, researchers have often turned to highly complex fine-grained techniques, resulting in efficient and elegant algorithms, w…
Unexpected Scaling in Path Copying Trees
Ilya Kokorin, Alexander Fedorov, Trevor Brown +1
Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (henceforth called Universal Constructi…
Performance Anomalies in Concurrent Data Structure Microbenchmarks
Rosina F. Kharal, Trevor Brown
Recent decades have witnessed a surge in the development of concurrent data structures with an increasing interest in data structures implementing concurrent sets (CSets). Microben…
Elimination (a,b)-trees with fast, durable updates
Anubhav Srivastava, Trevor Brown
Many concurrent dictionary implementations are designed and optimized for read-mostly workloads with uniformly distributed keys, and often perform poorly on update-heavy workloads.…