2019•Distributed ComputingRequires access

The complexity of leader election in diameter-two networks

Soumyottam Chatterjee, Gopal Pandurangan, Peter D. Robinson

Open publisher page 6 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Leader election, Upper and lower bounds, Combinatorics, Constant (computer programming), Randomized algorithm, Monte Carlo method, Monte Carlo algorithm, Theory of computation

Back to paper search Browse research topics Original source

The complexity of leader election in diameter-two networks — Research Paper | ScholarLens