Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Rotem Oshman

Rotem Oshman

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Distributed×1Algorithms×1

Frequent co-authors

Hagit Attiya1×
Noa Schiller1×

Research Timeline

2026
Space-Efficient Lock-Free Linear-Probing Hash Table

This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.

Highlighted terms show continued research focus across papers

Papers

cs.DCcs.DSTheoreticalRecentJun 15, 2026

Space-Efficient Lock-Free Linear-Probing Hash Table

Hagit Attiya, Rotem Oshman, Noa Schiller

This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.

View →