EDBT 2026 Demo / reviewers in the wild / expert
Ophir Rachman
dblp:48/1478
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3Theory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Distributed computing theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed computing theory › concurrent objects
snapshot objects |
0.0 | 2 | 1998 | Atomic Snapshots in O(n log n) Operations · SIAM J. Comput. 1998 Atomic Snapshots in O(n log n) Operations (Preliminary Version) · PODC 1993 |
Distributed computing theory › shared memory
shared-memory primitive |
0.0 | 1 | 1998 | Atomic Snapshots in O(n log n) Operations · SIAM J. Comput. 1998 |
Distributed computing theory › concurrent objects
wait-free algorithms |
0.0 | 1 | 1998 | Atomic Snapshots in O(n log n) Operations · SIAM J. Comput. 1998 |
Distributed computing theory
concurrent objects |
0.0 | 1 | 1993 | Atomic Snapshots in O(n log n) Operations (Preliminary Version) · PODC 1993 |
Distributed computing theory › shared memory
shared-memory algorithms |
0.0 | 1 | 1993 | Atomic Snapshots in O(n log n) Operations (Preliminary Version) · PODC 1993 |
Methods — techniques the papers use, named apart from their topics
read/write registers · 0.0snapshot algorithm design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Atomic Snapshots in O(n log n) OperationsabstractThe atomic snapshot object is an important primitive used for the design and verification of wait-free algorithms in shared-memory distributed systems. A snapshot object is a shared data structure partitioned into segments. Processors can either update an individual segment or instantaneously scan all segments of the object. This paper presents an implementation of an atomic snapshot object in which each high-level operation (scan or update) requires O(n log n) low-level operations on atomic read/write registers. Hagit Attiya, Ophir Rachman |
SIAM J. Comput. | 2 |
| 1995 | Atomic Snapshots Using Lattice Agreement
Hagit Attiya, Maurice Herlihy, Ophir Rachman |
Distributed Comput. | 3 |
| 1993 | Atomic Snapshots in O(n log n) Operations (Preliminary Version)abstractArticle Atomic snapshots in O(n log n) operations Share on Authors: Hagit Attiya View Profile , Ophir Rachman View Profile Authors Info & Claims PODC '93: Proceedings of the twelfth annual ACM symposium on Principles of distributed computingSeptember 1993 Pages 29–40https://doi.org/10.1145/164051.164055Online:01 September 1993Publication History 17citation273DownloadsMetricsTotal Citations17Total Downloads273Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Hagit Attiya, Ophir Rachman |
PODC | 2 |
| 1993 | Linear test sequences for detecting functionally faulty RAM's
Guy Even, Ophir Rachman, Ilan Y. Spillinger |
Integr. | 2 |