On the public citation graph

Average-Time Complexity of Gossiping in Radio Networks

0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45061-0_8openalex-snapshot
Generalized Framework for Selectors with Applications in Optimal Group Testing
inferredcites →https://doi.org/10.1007/3-540-45465-9_33openalex-snapshot
Gossiping with Bounded Size Messages in ad hoc Radio Networks
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_34openalex-snapshot
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_57openalex-snapshot
Deterministic M2M Multicast in Radio Networks
inferredcites →https://doi.org/10.1007/b98413openalex-snapshot
Algorithm Theory - SWAT 2004
inferredcites →https://doi.org/10.1007/s446-002-8028-1openalex-snapshot
Deterministic broadcasting in ad hoc radio networks
inferredcites →https://doi.org/10.1016/0022-0000(91)90015-wopenalex-snapshot
A lower bound for radio broadcast
inferredcites →https://doi.org/10.1016/0022-0000(92)90042-hopenalex-snapshot
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
inferredcites →https://doi.org/10.1016/j.jcss.2005.09.003openalex-snapshot
Radio communication in random graphs
inferredcites →https://doi.org/10.1016/j.tcs.2004.04.017openalex-snapshot
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
inferredcites →https://doi.org/10.1016/j.tcs.2006.06.017openalex-snapshot
Deterministic M2M multicast in radio networks
inferredcites →https://doi.org/10.1016/s0196-6774(02)00004-4openalex-snapshot
Fast broadcasting and gossiping in radio networks
inferredcites →https://doi.org/10.1016/s0304-3975(02)00851-4openalex-snapshot
Distributed broadcast in radio networks of unknown topology
inferredcites →https://doi.org/10.1109/sfcs.2003.1238222openalex-snapshot
Broadcasting algorithms in radio networks with unknown topology
inferredcites →https://doi.org/10.1109/tcom.1985.1096245openalex-snapshot
On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
inferredcites →https://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferredcites →https://doi.org/10.1137/s0097539703428002openalex-snapshot
Optimal Two-Stage Algorithms for Group Testing Problems
inferredcites →https://doi.org/10.1145/1073970.1074021openalex-snapshot
Radio communication in random graphs
inferredcites →https://doi.org/10.1145/381448.381454openalex-snapshot
Oblivious gossiping in ad-hoc radio networks
inferredcites →https://doi.org/10.1145/41840.41849openalex-snapshot
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
inferredcites →https://doi.org/10.1145/72981.73005openalex-snapshot
Multiple communication in multi-hop radio networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11780823openalex-snapshot
Structural Information and Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-74871-7_7openalex-snapshot
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_21openalex-snapshot
Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/s00453-007-9123-5openalex-snapshot
Many-to-Many Communication in Radio Networks
inferred← citeshttps://doi.org/10.1007/s10878-014-9713-5openalex-snapshot
Information exchange with collision detection on multiple channels
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.02.006openalex-snapshot
Deterministic multi-channel information exchange
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.002openalex-snapshot
Energy efficient randomised communication in unknown AdHoc networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.030openalex-snapshot
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
inferred← citeshttps://doi.org/10.1137/1.9781611973402.132openalex-snapshot
Broadcast Throughput in Radio Networks: Routing vs. Network Coding
inferred← citeshttps://doi.org/10.1145/1248377.1248419openalex-snapshot
Energy efficient randomised communication in unknown AdHoc networks
inferred← citeshttps://doi.org/10.1145/1998476.1998487openalex-snapshot
Time-optimal information exchange on multiple channels
inferred← citeshttps://doi.org/10.1145/2312005.2312028openalex-snapshot
Deterministic multi-channel information exchange
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612074openalex-snapshot
Energy Efficient Randomized Communication in Unknown AdHoc Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.