On the public citation graph

Distributed Broadcast in Unknown Radio Networks

https://doi.org/10.1137/080733826
0 signed · 63 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.1002/0471224561.ch24openalex-snapshot
Broadcasting in Radio Networks
inferredcites →https://doi.org/10.1007/3-540-45022-x_60openalex-snapshot
Deterministic Radio Broadcasting
inferredcites →https://doi.org/10.1007/s00446-006-0007-8openalex-snapshot
Optimal Deterministic Broadcasting in Known Topology 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/j.tcs.2004.04.017openalex-snapshot
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
inferredcites →https://doi.org/10.1016/s0020-0190(00)00178-2openalex-snapshot
Faster broadcasting in unknown 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.2000.892325openalex-snapshot
Fast broadcasting and gossiping in radio networks
inferredcites →https://doi.org/10.1109/sfcs.2002.1181883openalex-snapshot
Deterministic broadcasting time 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/tit.1985.1057020openalex-snapshot
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
inferredcites →https://doi.org/10.1137/s089548010342464xopenalex-snapshot
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
inferredcites →https://doi.org/10.1145/164051.164059openalex-snapshot
An Ω( D log( N/D )) lower bound for broadcast in 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

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_10openalex-snapshot
Optimal Channel Utilization with Limited Feedback
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_8openalex-snapshot
On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_47openalex-snapshot
Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-Broadcasting
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_11openalex-snapshot
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_13openalex-snapshot
Scalable Wake-up of Multi-channel Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_2openalex-snapshot
Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_43openalex-snapshot
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_49openalex-snapshot
Efficient k-Shot Broadcasting in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_2openalex-snapshot
On Efficient Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-24550-3_41openalex-snapshot
Brief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_7openalex-snapshot
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_8openalex-snapshot
Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_8openalex-snapshot
Electing a Leader in Multi-hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_15openalex-snapshot
Subquadratic Non-adaptive Threshold Group Testing
inferred← citeshttps://doi.org/10.1007/s00446-008-0075-zopenalex-snapshot
Broadcasting in UDG radio networks with unknown topology
inferred← citeshttps://doi.org/10.1007/s00446-010-0093-5openalex-snapshot
Broadcasting in UDG radio networks with missing and inaccurate information
inferred← citeshttps://doi.org/10.1007/s00446-011-0154-4openalex-snapshot
Fast message dissemination in random geometric networks
inferred← citeshttps://doi.org/10.1007/s00446-015-0244-9openalex-snapshot
Bounded-Contention Coding for the additive network model
inferred← citeshttps://doi.org/10.1016/j.dam.2015.08.021openalex-snapshot
Efficient k-shot broadcasting in radio networks
inferred← citeshttps://doi.org/10.1016/j.ic.2017.11.003openalex-snapshot
Information gathering in ad-hoc radio networks with tree topology
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104769openalex-snapshot
Information gathering in ad-hoc radio networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.02.001openalex-snapshot
Round complexity of leader election and gossiping in bidirectional radio networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.04.003openalex-snapshot
Leader election in ad hoc radio networks: A keen ear helps
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.02.002openalex-snapshot
Subquadratic non-adaptive threshold group testing
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.004openalex-snapshot
Optimal channel utilization with limited feedback
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.11.001openalex-snapshot
Deterministic non-adaptive contention resolution on a shared channel
inferred← citeshttps://doi.org/10.1016/j.jda.2016.11.004openalex-snapshot
Energy-efficient broadcasting in ad hoc wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.004openalex-snapshot
Fast radio broadcasting with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.003openalex-snapshot
Improved lower bound for deterministic broadcasting in radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.009openalex-snapshot
Information dissemination in unknown radio networks with large labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.006openalex-snapshot
Message and time efficient multi-broadcast schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.046openalex-snapshot
Scalable wake-up of multi-channel single-hop radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.014openalex-snapshot
Contention resolution in a non-synchronized multiple access channel
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00054openalex-snapshot
Deterministic Contention Resolution on a Shared Channel
inferred← citeshttps://doi.org/10.1109/ipdps.2013.68openalex-snapshot
Contention Resolution in a Non-synchronized Multiple Access Channel
inferred← citeshttps://doi.org/10.1137/140982763openalex-snapshot
Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
inferred← citeshttps://doi.org/10.1137/17m1111322openalex-snapshot
Deterministic Communication in Radio Networks
inferred← citeshttps://doi.org/10.1145/2634274.2634279openalex-snapshot
Dynamic multiple-message broadcast
inferred← citeshttps://doi.org/10.1145/3087801.3087831openalex-snapshot
Asynchronous Shared Channel
inferred← citeshttps://doi.org/10.1145/3212734.3212752openalex-snapshot
Deterministic Digital Clustering of Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1145/3350755.3400238openalex-snapshot
Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast
inferred← citeshttps://doi.org/10.1145/3733594openalex-snapshot
A Survey on Adversarial Contention Resolution
inferred← citeshttps://doi.org/10.4204/eptcs.132.3openalex-snapshot
Message and time efficient multi-broadcast schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0479openalex-snapshot
Faster Gossiping in Bidirectional Radio Networks with Large Labels
inferred← citeshttps://doi.org/10.48550/arxiv.1207.0602openalex-snapshot
Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6732openalex-snapshot
Distributed Broadcasting in Wireless Networks under the SINR Model
inferred← citeshttps://doi.org/10.48550/arxiv.1208.6125openalex-snapshot
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
inferred← citeshttps://doi.org/10.48550/arxiv.1210.1804openalex-snapshot
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices under the SINR Model
inferred← citeshttps://doi.org/10.48550/arxiv.1407.1521openalex-snapshot
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
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.