default search action
Naama Ben-David
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Naama Ben-David, Gal Sela, Adriana Szekeres:
The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems (Abstract). HOPC@SPAA 2024 - [c29]Naama Ben-David
, Guy E. Blelloch
Lock-Free Locks Revisited (Abstract). HOPC@SPAA 2024 - 2023
- [j3]Naama Ben-David:
Lock-Free Locks. Bull. EATCS 139 (2023) - [c28]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Antoine Murat, Athanasios Xygkis, Igor Zablotchi:
uBFT: Microsecond-Scale BFT using Disaggregated Memory. ASPLOS (2) 2023: 862-877 - [c27]Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri:
On the Round Complexity of Asynchronous Crusader Agreement. OPODIS 2023: 29:1-29:21 - [c26]Naama Ben-David, Gal Sela
The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems. DISC 2023: 9:1-9:24 - [i18]Naama Ben-David, Gal Sela
The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems. CoRR abs/2308.03919 (2023) - [i17]Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri:
On the Round Complexity of Asynchronous Crusader Agreement. IACR Cryptol. ePrint Arch. 2023: 1586 (2023) - 2022
- [c25]Naama Ben-David, Guy E. Blelloch:
Fast and Fair Randomized Wait-Free Locks. PODC 2022: 187-197 - [c24]Ittai Abraham, Naama Ben-David, Sravya Yandamuri:
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. PODC 2022: 381-391 - [c23]Naama Ben-David, Benjamin Y. Chan
Revisiting the Power of Non-Equivocation in Distributed Protocols. PODC 2022: 450-459 - [c22]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Lock-free locks revisited. PPoPP 2022: 278-293 - [c21]Yuanhao Wei, Naama Ben-David, Michal Friedman
FliT: a library for simple and efficient persistent algorithms. PPoPP 2022: 309-321 - [c20]Naama Ben-David, Michal Friedman, Yuanhao Wei:
Brief Announcement: Survey of Persistent Memory Correctness Conditions. DISC 2022: 41:1-41:4 - [i16]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Lock-Free Locks Revisited. CoRR abs/2201.00813 (2022) - [i15]Naama Ben-David, Michal Friedman, Yuanhao Wei:
Survey of Persistent Memory Correctness Conditions. CoRR abs/2208.11114 (2022) - [i14]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Antoine Murat, Athanasios Xygkis, Igor Zablotchi:
uBFT: Microsecond-scale BFT using Disaggregated Memory. CoRR abs/2210.17174 (2022) - [i13]Ittai Abraham, Naama Ben-David, Sravya Yandamuri:
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. IACR Cryptol. ePrint Arch. 2022: 711 (2022) - 2021
- [c19]Naama Ben-David, Kartik Nayak:
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. PODC 2021: 191-194 - [c18]Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
Constant-time snapshots with applications to concurrent data structures. PPoPP 2021: 31-46 - [c17]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui
Frugal Byzantine Computing. DISC 2021: 3:1-3:19 - [c16]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
Space and Time Bounded Multiversion Garbage Collection. DISC 2021: 12:1-12:20 - [i12]Naama Ben-David, Kartik Nayak:
Classifying Trusted Hardware via Unidirectional Communication. CoRR abs/2105.10566 (2021) - [i11]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Dalia Papuc, Athanasios Xygkis, Igor Zablotchi:
Frugal Byzantine Computing. CoRR abs/2108.01330 (2021) - [i10]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. CoRR abs/2108.02775 (2021) - [i9]Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank:
FliT: A Library for Simple and Efficient Persistent Algorithms. CoRR abs/2108.04202 (2021) - [i8]Naama Ben-David, Guy E. Blelloch:
Fast and Fair Lock-Free Locks. CoRR abs/2108.04520 (2021) - 2020
- [c15]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui
Microsecond Consensus for Microsecond Applications. OSDI 2020: 599-616 - [c14]Michal Friedman
NVTraverse: in NVRAM data structures, the destination is more important than the journey. PLDI 2020: 377-392 - [i7]Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank:
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. CoRR abs/2004.02841 (2020) - [i6]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR abs/2007.02372 (2020) - [i5]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Virendra J. Marathe, Athanasios Xygkis, Igor Zablotchi:
Microsecond Consensus for Microsecond Applications. CoRR abs/2010.06288 (2020)
2010 – 2019
- 2019
- [j2]Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
PODC 2019 Review. SIGACT News 50(4): 33-45 (2019) - [c13]Naama Ben-David, Ziv Scully
Unfair Scheduling Patterns in NUMA Architectures. PACT 2019: 205-218 - [c12]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui
The Impact of RDMA on Agreement. PODC 2019: 409-418 - [c11]Naama Ben-David, Guy E. Blelloch, Michal Friedman
Making concurrent algorithms detectable: poster. PPoPP 2019: 419-420 - [c10]Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei:
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. SPAA 2019: 241-252 - [c9]Naama Ben-David, Guy E. Blelloch, Michal Friedman
Delay-Free Concurrency on Faulty Persistent Memory. SPAA 2019: 253-264 - [i4]Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Virendra J. Marathe, Igor Zablotchi:
The Impact of RDMA on Agreement. CoRR abs/1905.12143 (2019) - 2018
- [j1]Naama Ben-David:
PODC 2018 Review. SIGACT News 49(4): 83-88 (2018) - [c8]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. IPDPS 2018: 711-722 - [c7]Marcos K. Aguilera, Naama Ben-David, Irina Calciu, Rachid Guerraoui
Passing Messages while Sharing Memory. PODC 2018: 51-60 - [i3]Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei:
Efficient Single Writer Concurrency. CoRR abs/1803.08617 (2018) - [i2]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Making Concurrent Algorithms Detectable. CoRR abs/1806.04780 (2018) - 2017
- [c6]Naama Ben-David, Guy E. Blelloch:
Analyzing Contention and Backoff in Asynchronous Shared Memory. PODC 2017: 53-62 - [c5]Umut A. Acar, Naama Ben-David, Mike Rainey:
Contention in Structured Concurrency: Provably Efficient Dynamic Non-Zero Indicators for Nested Parallelism. PPoPP 2017: 75-88 - [i1]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. CoRR abs/1710.02637 (2017) - 2016
- [c4]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu
Parallel Algorithms for Asymmetric Read-Write Costs. SPAA 2016: 145-156 - [c3]Naama Ben-David, David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
k-Abortable Objects: Progress Under High Contention. DISC 2016: 298-312 - 2015
- [c2]Michalis Famelis, Naama Ben-David, Alessio Di Sandro
MU-MMINT: An IDE for Model Uncertainty. ICSE (2) 2015: 697-700 - [c1]Kathleen C. Fraser, Naama Ben-David, Graeme Hirst, Naida L. Graham, Elizabeth Rochon
Sentence segmentation of aphasic speech. HLT-NAACL 2015: 862-871
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: