On the public citation graph

Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards

https://doi.org/10.1002/cpe.783
0 signed · 36 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-40996-3_31openalex-snapshot
Randomized Leader Election Protocols in Radio Networks with no Collision Detection
inferredcites →https://doi.org/10.1007/3-540-45655-4_31openalex-snapshot
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
inferredcites →https://doi.org/10.1007/3-540-46632-0_23openalex-snapshot
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
inferredcites →https://doi.org/10.1007/3-540-49381-6_23openalex-snapshot
Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks
inferredcites →https://doi.org/10.1007/978-1-4615-0013-1openalex-snapshot
Handbook of Randomized Computing
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/icpp.2000.876141openalex-snapshot
Energy-efficient initialization protocols for radio networks with no collision detection
inferredcites →https://doi.org/10.1109/ipdps.2002.1016534openalex-snapshot
Doubly-logarithmic energy-efficient initialization protocols for single-hop radio networks
inferredcites →https://doi.org/10.1109/proc.1987.13703openalex-snapshot
The low-cost packet radio
inferredcites →https://doi.org/10.1137/0215032openalex-snapshot
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
inferredcites →https://doi.org/10.1137/s0097539795288490openalex-snapshot
Balanced Allocations
inferredcites →https://doi.org/10.1145/571825.571833openalex-snapshot
Efficient algorithms for leader election in radio networks
inferredcites →https://doi.org/10.5555/314613.314709openalex-snapshot
Computation in noisy 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/11611257_32openalex-snapshot
Merging and Merge-Sort in a Single Hop Radio Network
inferred← citeshttps://doi.org/10.1007/11750321_14openalex-snapshot
Adversary Immune Size Approximation of Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_35openalex-snapshot
Transmitting once to Elect a Leader on Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_12openalex-snapshot
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30496-8_4openalex-snapshot
Secure Initialization in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_37openalex-snapshot
Adversary Immune Leader Election in ad hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-88582-5_30openalex-snapshot
Leader Election Algorithms for Multi-channel Wireless Networks
inferred← citeshttps://doi.org/10.1007/s00453-023-01095-2openalex-snapshot
Transmitting Once to Elect a Leader on Wireless Networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103463openalex-snapshot
Restrained medium access control on adversarial shared channels
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114279openalex-snapshot
The energy complexity of diameter and minimum cut computation in bounded-genus networks
inferred← citeshttps://doi.org/10.1109/aciids.2009.29openalex-snapshot
Leader Election for Multi-channel Radio Networks - Dependent versus Independent Trials
inferred← citeshttps://doi.org/10.1109/icpads51040.2020.00022openalex-snapshot
Contention resolution on a restrained channel
inferred← citeshttps://doi.org/10.1145/3055399.3055481openalex-snapshot
Exponential separations in the energy complexity of leader election
inferred← citeshttps://doi.org/10.1145/3212734.3212774openalex-snapshot
The Energy Complexity of Broadcast
inferred← citeshttps://doi.org/10.1145/3341111openalex-snapshot
Exponential Separations in the Energy Complexity of Leader Election
inferred← citeshttps://doi.org/10.1145/3382734.3405713openalex-snapshot
The Energy Complexity of BFS in Radio Networks
inferred← citeshttps://doi.org/10.1145/3409964.3461830openalex-snapshot
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.1145/3614429openalex-snapshot
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.46298/dmtcs.2160openalex-snapshot
Energy-optimal algorithms for computing aggregative functions in random networks
inferred← citeshttps://doi.org/10.48550/arxiv.1711.04149openalex-snapshot
Broadcast in radio networks: time vs. energy tradeoffs
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04071openalex-snapshot
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2105.07518openalex-snapshot
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
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.