Elth Ogston

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:45/887 · also Elizabeth Ogston · DBLP profile ↗

← Back

5ranked-venue papers

3as first author

0since 2021 · last 2011

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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 architecture, parallel and distributed computing, and storage systems

1 paper

Distributed systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Distributed systems fault tolerance	0.1	1	2007	ARRG: real-world gossiping · HPDC 2007
Distributed systems gossip protocols	0.1	1	2007	ARRG: real-world gossiping · HPDC 2007
Distributed systems › fault tolerance node failure	0.1	1	2007	ARRG: real-world gossiping · HPDC 2007

Methods — techniques the papers use, named apart from their topics

gossip algorithm · 0.1

Year	Publication	Venue	Position
2011	Dynamic Resource Allocation through Semi-structured Adaptation Sander van Splunter, Elth Ogston, Frances M. T. Brazier	ICAART (2)	2
2009	Peer sampling with improved accuracy Elth Ogston, Stephen A. Jarvis	Peer-to-Peer Netw. Appl.	1
2007	ARRG: real-world gossiping abstract Gossiping is an effective way of disseminating information in large dynamic systems. Until now, most gossiping algorithms have been designed and evaluated using simulations. However, these algorithms often cannot cope with several real-world problems that tend to be overlooked in simulations, such as node failures, message loss, non-atomicity ofinformation exchange, and firewalls. Niels Drost, Elth Ogston, Rob van Nieuwpoort, Henri E. Bal	HPDC	2
2006	On the Value of Random Opinions in Decentralized Recommendation Elth Ogston, Arno Bakker, Maarten van Steen	DAIS	1
2001	Local Distributed Agent Matchmaking Elth Ogston, Stamatis Vassiliadis	CoopIS	1