From the 2 of 8 linked papers with an AI index.
8 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…
Dynamic Rental Games with Stagewise Individual Rationality
Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
The paper investigates dynamic mechanism design for renting a single asset over multiple days, focusing on agents who require stagewise individual rationality and deriving optimal…
Optimal Auction Design for Constrained Buyers
Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
The paper studies optimal auction design when buyers face constraints on how they can bid or spend, showing that classic auction theory results break down and providing new optimal…
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…
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,…
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: […