Demo Data from EDBT 2026 / reviewers in the wild / expert
Oren Dobzinski
dblp:54/2177
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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.
| Computer networks
1 paper |
Internet architecture and protocols · 67% Network performance modeling · 33% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › peer-to-peer networks
distributed hash tables |
0.0 | 1 | 2004 | LAND: stretch (1 + epsilon) locality-aware networks for DHTs · SODA 2004 |
Internet architecture and protocols
peer-to-peer networks |
0.0 | 1 | 2004 | LAND: stretch (1 + epsilon) locality-aware networks for DHTs · SODA 2004 |
Methods — techniques the papers use, named apart from their topics
stretch embedding · 0.0locality-aware routing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Abuse Freedom in Access Control SchemesabstractWe present a protocol for access control in which any entity can prove its access privileges only to designated servers. This generalizes the problem of abuse freedom to the question of access control. If an abuse free access control device is captured by a malicious party, the information about places or resources it can access would not be revealed to the capturing party. Anat Talmy, Oren Dobzinski |
AINA (2) | 2 |
| 2004 | LAND: stretch (1 + epsilon) locality-aware networks for DHTs
Ittai Abraham, Dahlia Malkhi, Oren Dobzinski |
SODA | 3 |