5 citations · 21 across the 18 of their papers we have counts for
20 papers
Non-Leaking Concurrent Objects
Hagit Attiya, Rotem Oshman, Noa Schiller +1
Abstract specifications of concurrent objects determine which values operations may return, but they also implicitly constrain which information operations may know, for example th…
Optimal Auction Design for Constrained Buyers
Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
We study single-parameter, multi-buyer auctions in which buyers are subject to constraints that affect their bidding strategy. Such constraints arise in many real-world auction set…
Space-Efficient Lock-Free Linear-Probing Hash Table
Hagit Attiya, Rotem Oshman, Noa Schiller
Linear probing is one of the simplest and most space-efficient approaches to hash table design, and is widely used in sequential settings due to its compact memory layout. However,…
Fast Concurrent Primitives Despite Contention
Michael A. Bender, Guy E. Blelloch, Martin Farach-Colton +4
We study the problem of constructing concurrent objects in a setting where processes run in parallel and interact through a shared memory that is subject to write contention. O…
Pointer Chasing with Unlimited Interaction
Orr Fischer, Rotem Oshman, Adi Rosen +1
Pointer-chasing is a central problem in two-party communication complexity: given input size and a parameter , the two players Alice and Bob are given functions $N_A, N_B: […
Dynamic Rental Games with Stagewise Individual Rationality
Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
We study \emph{rental games} -- a single-parameter dynamic mechanism design problem, in which a designer rents out an indivisible asset over days. Each day, an agent arrives wi…