MU-MMINT: An IDE for Model Uncertainty. - Michalis Famelis; Naama Ben-David; Alessio Di Sandro; Rick Salay; Marsha Chechik (ICSE (2), 2015)

Sentence segmentation of aphasic speech. - Kathleen C. Fraser; Naama Ben-David; Graeme Hirst; Naida L. Graham; Elizabeth Rochon (HLT-NAACL, 2015)

Parallel Algorithms for Asymmetric Read-Write Costs. - Naama Ben-David; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (SPAA, 2016)

k-Abortable Objects: Progress Under High Contention. - Naama Ben-David; David Yu Cheng Chan; Vassos Hadzilacos; Sam Toueg (DISC, 2016)

Analyzing Contention and Backoff in Asynchronous Shared Memory. - Naama Ben-David; Guy E. Blelloch (PODC, 2017)

Contention in Structured Concurrency: Provably Efficient Dynamic Non-Zero Indicators for Nested Parallelism. - Umut A. Acar; Naama Ben-David; Mike Rainey (PPoPP, 2017)

Implicit Decomposition for Write-Efficient Connectivity Algorithms. - Naama Ben-David; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (IPDPS, 2018)

Passing Messages while Sharing Memory. - Marcos K. Aguilera; Naama Ben-David; Irina Calciu; Rachid Guerraoui; Erez Petrank; Sam Toueg (PODC, 2018)

Efficient Single Writer Concurrency. - Naama Ben-David; Guy E. Blelloch; Yihan Sun 001; Yuanhao Wei (CoRR, 2018)

Making Concurrent Algorithms Detectable. - Naama Ben-David; Guy E. Blelloch; Yuanhao Wei (CoRR, 2018)

PODC 2018 Review. - Naama Ben-David (SIGACT News, 2018)

Unfair Scheduling Patterns in NUMA Architectures. - Naama Ben-David; Ziv Scully; Guy E. Blelloch (PACT, 2019)

The Impact of RDMA on Agreement. - Marcos K. Aguilera; Naama Ben-David; Rachid Guerraoui; Virendra J. Marathe; Igor Zablotchi (PODC, 2019)

Making concurrent algorithms detectable: poster. - Naama Ben-David; Guy E. Blelloch; Michal Friedman 001; Yuanhao Wei (PPoPP, 2019)

Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. - Naama Ben-David; Guy E. Blelloch; Yihan Sun 001; Yuanhao Wei (SPAA, 2019)

Delay-Free Concurrency on Faulty Persistent Memory. - Naama Ben-David; Guy E. Blelloch; Michal Friedman 001; Yuanhao Wei (SPAA, 2019)

PODC 2019 Review. - Naama Ben-David; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (SIGACT News, 2019)

Microsecond Consensus for Microsecond Applications. - Marcos K. Aguilera; Naama Ben-David; Rachid Guerraoui; Virendra J. Marathe; Athanasios Xygkis; Igor Zablotchi (OSDI, 2020)

NVTraverse: in NVRAM data structures, the destination is more important than the journey. - Michal Friedman 001; Naama Ben-David; Yuanhao Wei; Guy E. Blelloch; Erez Petrank (PLDI, 2020)

Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. - Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001; Yuanhao Wei (CoRR, 2020)

Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. - Naama Ben-David; Kartik Nayak (PODC, 2021)

Constant-time snapshots with applications to concurrent data structures. - Yuanhao Wei; Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001 (PPoPP, 2021)

Frugal Byzantine Computing. - Marcos K. Aguilera; Naama Ben-David; Rachid Guerraoui; Dalia Papuc; Athanasios Xygkis; Igor Zablotchi (DISC, 2021)

Space and Time Bounded Multiversion Garbage Collection. - Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001; Yuanhao Wei (DISC, 2021)

Classifying Trusted Hardware via Unidirectional Communication. - Naama Ben-David; Kartik Nayak (CoRR, 2021)

Fast and Fair Lock-Free Locks. - Naama Ben-David; Guy E. Blelloch (CoRR, 2021)

Revisiting the Power of Non-Equivocation in Distributed Protocols. - Naama Ben-David; Benjamin Y. Chan; Elaine Shi (PODC, 2022)

Lock-free locks revisited. - Naama Ben-David; Guy E. Blelloch; Yuanhao Wei (PPoPP, 2022)

FliT: a library for simple and efficient persistent algorithms. - Yuanhao Wei; Naama Ben-David; Michal Friedman 001; Guy E. Blelloch; Erez Petrank (PPoPP, 2022)

Brief Announcement: Survey of Persistent Memory Correctness Conditions. - Naama Ben-David; Michal Friedman 001; Yuanhao Wei (DISC, 2022)

Survey of Persistent Memory Correctness Conditions. - Naama Ben-David; Michal Friedman 001; Yuanhao Wei (CoRR, 2022)

Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. - Ittai Abraham; Naama Ben-David; Sravya Yandamuri (IACR Cryptol. ePrint Arch., 2022)

uBFT: Microsecond-Scale BFT using Disaggregated Memory. - Marcos K. Aguilera; Naama Ben-David; Rachid Guerraoui; Antoine Murat; Athanasios Xygkis; Igor Zablotchi (ASPLOS (2), 2023)

The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems. - Naama Ben-David; Gal Sela 001; Adriana Szekeres (DISC, 2023)

Lock-Free Locks. - Naama Ben-David (Bull. EATCS, 2023)

On the Round Complexity of Asynchronous Crusader Agreement. - Ittai Abraham; Naama Ben-David; Gilad Stern; Sravya Yandamuri (IACR Cryptol. ePrint Arch., 2023)

The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems (Abstract). - Naama Ben-David; Gal Sela 001; Adriana Szekeres (HOPC@SPAA, 2024)

Lock-Free Locks Revisited (Abstract). - Naama Ben-David; Guy E. Blelloch; Yuanhao Wei (HOPC@SPAA, 2024)

Byzantine Agreement with Predictions. - Naama Ben-David; Muhammad Ayaz Dzulfikar; Faith Ellen; Seth Gilbert (PODC, 2025)

Fast and fair randomized wait-free locks. - Naama Ben-David; Guy E. Blelloch (Distributed Comput., 2025)