Demo Data from EDBT 2026 / reviewers in the wild / expert
Ruben A. Quiros
dblp:285/0917
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1988
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author
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 |
Wireless networking · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking
medium access control |
0.0 | 1 | 1988 | Stubborn: a medium access protocol for expert assistants in distributed control systems · INFOCOM 1988 |
Embedded and real-time systems › industrial control systems
distributed control systems |
0.0 | 1 | 1988 | Stubborn: a medium access protocol for expert assistants in distributed control systems · INFOCOM 1988 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1988 | Stubborn: a medium access protocol for expert assistants in distributed control systemsabstractA novel implementation is presented, the Stubborn protocol, which provides the right compromise to obtain a balanced and near-optimal performance under both normal (control) operation and transient (emergency) conditions. It is based on the following simple principle: stations make access attempts as in the usual 1-persistent CSMA/CD (carrier-sense multiple-access with collision detection). In case of collision, a station with priority higher than zero will not interrupt transmission, but will exercise its right to extend the collision for a period proportional to its priority level. The station that persists longer will be able to start 'clean' transmission as soon as all others have desisted. The algorithm is complemented with tie-breaking procedures.> Ruben A. Quiros, Isaac D. Scherson |
INFOCOM | 1 |