◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ohad Ben-Baruch

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.DC3

identity via Semantic Scholar / OpenAlex

most citedUpper and Lower Bounds on the Space Complexity of Detectable Object

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DC2021

Execution of NVRAM Programs with Persistent Stack

Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler +2

Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware that combines the benefits of traditional persistent memory (persistency of data over hardware failures) and D…

cs.DC2020

Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models

Ohad Ben-Baruch, Srivatsan Ravi

Linearizability, the traditional correctness condition for concurrent data structures is considered insufficient for the non-volatile shared memory model where processes recover fo…

cs.DC2020★ 1 cited

Upper and Lower Bounds on the Space Complexity of Detectable Object

Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky

The emergence of systems with non-volatile main memory (NVM) increases the interest in the design of \emph{recoverable concurrent objects} that are robust to crash-failures, since…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.