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 VLDB 2026 / reviewers in the wild / expert

Vidya Gummadi

dblp:22/5896 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 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
1 paper
Distributed computing theory · 100%
Computer networks
1 paper
Optical networks · 100%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory
leader election		 0.011994
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks · IEEE Trans. Parallel Distributed Syst. 1994
Distributed computing theory › timing models
synchronous network		 0.011994
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks · IEEE Trans. Parallel Distributed Syst. 1994
Optical networks
fiber optic network		 0.011994
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks · IEEE Trans. Parallel Distributed Syst. 1994

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

distributed algorithm design · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
1994 New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks
abstract
We improve on I. Cidon, I. Gopal and S. Kutten's leader election algorithm (Proc. 7th ACM Symp. Principles Distrib. Computing, Toronto, Ont., Canada. Aug. 1988) by presenting an algorithm that uses only O(/spl radic/n log D + f) time units to run on synchronous networks of degree f and diameter D, where f/spl ges/3. When f is 2, the algorithm uses only O(log D) time units.>
Hosame Abu-Amara, Vidya Gummadi
 IEEE Trans. Parallel Distributed Syst.2