On the public citation graph

Contention Resolution in a Non-synchronized Multiple Access Channel

https://doi.org/10.1109/ipdps.2013.68
0 signed · 51 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/rsa.20417openalex-snapshot
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
inferredcites →https://doi.org/10.1007/11523468_29openalex-snapshot
On the Wake-Up Problem in Radio Networks
inferredcites →https://doi.org/10.1007/3-540-36136-7_47openalex-snapshot
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
inferredcites →https://doi.org/10.1007/s00224-005-1144-3openalex-snapshot
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks
inferredcites →https://doi.org/10.1007/s00453-007-9123-5openalex-snapshot
Many-to-Many Communication in Radio Networks
inferredcites →https://doi.org/10.1007/s446-002-8028-1openalex-snapshot
Deterministic broadcasting in ad hoc radio networks
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1016/j.dam.2006.08.009openalex-snapshot
Faster deterministic wakeup in multiple access channels
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.046openalex-snapshot
Scalable wake-up of multi-channel single-hop 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.1108/03684920810907904openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/icdcs.2010.50openalex-snapshot
Towards Power-Sensitive Communication on a Multiple-Access Channel
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.1964.1053689openalex-snapshot
Nonrandom binary superimposed codes
inferredcites →https://doi.org/10.1109/tit.1979.1056093openalex-snapshot
Tree algorithms for packet broadcast channels
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.1109/tit.1985.1057022openalex-snapshot
A perspective on multiaccess channels
inferredcites →https://doi.org/10.1137/080733826openalex-snapshot
Distributed Broadcast in Unknown Radio Networks
inferredcites →https://doi.org/10.1137/s0097539704442726openalex-snapshot
The Wake‐Up Problem in MultiHop Radio Networks
inferredcites →https://doi.org/10.1137/s0097539794279109openalex-snapshot
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
inferredcites →https://doi.org/10.1137/s0895480100376022openalex-snapshot
The Wakeup Problem in Synchronous Broadcast Systems
inferredcites →https://doi.org/10.1145/1011767.1011806openalex-snapshot
A better wake-up in radio networks
inferredcites →https://doi.org/10.1145/1073814.1073843openalex-snapshot
On selection problem in radio networks
inferredcites →https://doi.org/10.1145/1478462.1478502openalex-snapshot
THE ALOHA SYSTEM
inferredcites →https://doi.org/10.1145/3828.214125openalex-snapshot
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2446openalex-snapshot
Dynamic Sharing of a Multiple Access Channel

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-319-14472-6_13openalex-snapshot
Scalable Wake-up of Multi-channel Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_21openalex-snapshot
Faster Information Gathering in Ad-Hoc Radio Tree 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/978-3-662-55751-8_25openalex-snapshot
Deterministic Oblivious Local Broadcast in the SINR Model
inferred← citeshttps://doi.org/10.1007/s00224-016-9725-xopenalex-snapshot
Adversarial Multiple Access Channels with Individual Injection Rates
inferred← citeshttps://doi.org/10.1007/s00453-017-0336-yopenalex-snapshot
Faster Information Gathering in Ad-Hoc Radio Tree Networks
inferred← citeshttps://doi.org/10.1007/s11235-017-0407-zopenalex-snapshot
Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl–Cocke–Jelinek–Raviv algorithm
inferred← citeshttps://doi.org/10.1016/j.adhoc.2018.09.008openalex-snapshot
How to obfuscate execution of protocols in an ad hoc radio network?
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.jcss.2020.02.002openalex-snapshot
Subquadratic non-adaptive threshold group testing
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.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/icdcs51616.2021.00100openalex-snapshot
Deterministic Contention Resolution without Collision Detection: Throughput vs Energy
inferred← citeshttps://doi.org/10.1109/icpads51040.2020.00022openalex-snapshot
Contention resolution on a restrained channel
inferred← citeshttps://doi.org/10.1137/17m1158604openalex-snapshot
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses
inferred← citeshttps://doi.org/10.1145/3087801.3087831openalex-snapshot
Asynchronous Shared Channel
inferred← citeshttps://doi.org/10.1145/3276769openalex-snapshot
Scaling Exponential Backoff
inferred← citeshttps://doi.org/10.1145/3350755.3400239openalex-snapshot
Contention Resolution with Message Deadlines
inferred← citeshttps://doi.org/10.1145/3733594openalex-snapshot
A Survey on Adversarial Contention Resolution
inferred← citeshttps://doi.org/10.14209/jcis.2017.13openalex-snapshot
Data Transmission Using Convolutional Codes and Bi-directional Soft Output Viterbi Algorithm over the Two-User Binary Adder Channel
inferred← citeshttps://doi.org/10.48550/arxiv.1908.10388openalex-snapshot
Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds
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.