1992•Journal of Computer and System SciencesOpen access

On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization

Reuven Bar-Yehuda, Oded Goldreich, Alon Itai

Open full text 436 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 436 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: Logarithm, Computer science, Upper and lower bounds, Communication complexity, Hop (telecommunications), Time complexity, Binary logarithm, Randomized algorithm

Back to paper search Browse research topics Original source

On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization — Research Paper | ScholarLens