Naama Ben-David

According to our database1, Naama Ben-David authored at least 37 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the Round Complexity of Asynchronous Crusader Agreement.
IACR Cryptol. ePrint Arch., 2023

Lock-Free Locks.
Bull. EATCS, 2023

The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

uBFT: Microsecond-Scale BFT using Disaggregated Memory.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement.
IACR Cryptol. ePrint Arch., 2022

Survey of Persistent Memory Correctness Conditions.
CoRR, 2022

Brief Announcement: Survey of Persistent Memory Correctness Conditions.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

FliT: a library for simple and efficient persistent algorithms.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Lock-free locks revisited.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Revisiting the Power of Non-Equivocation in Distributed Protocols.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Fast and Fair Randomized Wait-Free Locks.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Fast and Fair Lock-Free Locks.
CoRR, 2021

Classifying Trusted Hardware via Unidirectional Communication.
CoRR, 2021

Space and Time Bounded Multiversion Garbage Collection.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Frugal Byzantine Computing.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Constant-time snapshots with applications to concurrent data structures.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures.
CoRR, 2020

NVTraverse: in NVRAM data structures, the destination is more important than the journey.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Microsecond Consensus for Microsecond Applications.
Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation, 2020

2019
PODC 2019 Review.
SIGACT News, 2019

Delay-Free Concurrency on Faulty Persistent Memory.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Multiversion Concurrency with Bounded Delay and Precise Garbage Collection.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Making concurrent algorithms detectable: poster.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

The Impact of RDMA on Agreement.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Unfair Scheduling Patterns in NUMA Architectures.
Proceedings of the 28th International Conference on Parallel Architectures and Compilation Techniques, 2019

2018
PODC 2018 Review.
SIGACT News, 2018

Making Concurrent Algorithms Detectable.
CoRR, 2018

Efficient Single Writer Concurrency.
CoRR, 2018

Passing Messages while Sharing Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Implicit Decomposition for Write-Efficient Connectivity Algorithms.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017
Contention in Structured Concurrency: Provably Efficient Dynamic Non-Zero Indicators for Nested Parallelism.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Analyzing Contention and Backoff in Asynchronous Shared Memory.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
k-Abortable Objects: Progress Under High Contention.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Parallel Algorithms for Asymmetric Read-Write Costs.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

2015
Sentence segmentation of aphasic speech.
Proceedings of the NAACL HLT 2015, The 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Denver, Colorado, USA, May 31, 2015

MU-MMINT: An IDE for Model Uncertainty.
Proceedings of the 37th IEEE/ACM International Conference on Software Engineering, 2015


  Loading...