On the public citation graph

Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel

https://doi.org/10.1137/0215032
0 signed · 197 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_95openalex-snapshot
Optimal unbounded search strategies
inferredcites →https://doi.org/10.1016/0020-0190(76)90071-5openalex-snapshot
An almost optimal algorithm for unbounded searching
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
inferredcites →https://doi.org/10.1109/tit.1979.1056093openalex-snapshot
Tree algorithms for packet broadcast channels
inferredcites →https://doi.org/10.1109/tit.1980.1056237openalex-snapshot
Improved prefix encodings of the natural numbers (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot
Additional comments on a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/357980.358015openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/359038.359044openalex-snapshot
Measured performance of an Ethernet local network
inferredcites →https://doi.org/10.1145/360248.360253openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
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.2307/2284419openalex-snapshot
Introduction to Probability Theory.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471224561.ch10openalex-snapshot
Leader Election Protocols for Radio Networks
inferred← citeshttps://doi.org/10.1002/cpe.783openalex-snapshot
Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
inferred← citeshttps://doi.org/10.1002/net.21463openalex-snapshot
Distributed tree comparison with nodes of limited memory
inferred← citeshttps://doi.org/10.1002/rsa.20417openalex-snapshot
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1127openalex-snapshot
Fast and Efficient Simulations among CRCW PRAMs
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1128openalex-snapshot
Renaming and Dispersing: Techniques for Fast Load Balancing
inferred← citeshttps://doi.org/10.1007/11602613_54openalex-snapshot
Basic Computations in Wireless Networks
inferred← citeshttps://doi.org/10.1007/11946441_26openalex-snapshot
Randomized Leader Election Protocols in Noisy Radio Networks with a Single Transceiver
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_47openalex-snapshot
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_31openalex-snapshot
Randomized Leader Election Protocols in Radio Networks with no Collision Detection
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_31openalex-snapshot
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_137openalex-snapshot
Weak Communication in Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_23openalex-snapshot
Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_29openalex-snapshot
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_11openalex-snapshot
Randomized Communication in 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-030-91081-5_30openalex-snapshot
Optimal Protocols for 2-Party Contention Resolution
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_29openalex-snapshot
Softening the Impact of Collisions in Contention Resolution
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_23openalex-snapshot
Approximating the Size of a Radio Network in Beeping Model
inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_2openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_1openalex-snapshot
Leader Election in SINR Model with Arbitrary Power Control
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-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_51openalex-snapshot
Consensus and Mutual Exclusion in a Multiple Access Channel
inferred← citeshttps://doi.org/10.1007/978-3-642-04383-3_13openalex-snapshot
Towards Fair Leader Election in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_12openalex-snapshot
Distributed Tree Comparison with Nodes of Limited Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_41openalex-snapshot
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_24openalex-snapshot
Repelling Sybil-Type Attacks in Wireless Ad Hoc Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_11openalex-snapshot
Coordination Problems in Ad Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_14openalex-snapshot
What Is the Use of Collision Detection (in Wireless Networks)?
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_25openalex-snapshot
How Much Memory Is Needed for Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_33openalex-snapshot
Trusted Computing for Fault-Prone Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_7openalex-snapshot
Fast Approximation in Subspaces by Doubling Metric Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_23openalex-snapshot
Unbounded Contention Resolution in Multiple-Access Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_26openalex-snapshot
Leader Election Using Loneliness Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-28169-3_3openalex-snapshot
Immune Size Approximation Algorithms in Ad Hoc Radio Network
inferred← citeshttps://doi.org/10.1007/978-3-642-30630-3_20openalex-snapshot
Dynamic Contention Resolution in Multiple-Access Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-31869-6_38openalex-snapshot
Efficient Information Exchange in Single-Hop Multi-Channel Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_42openalex-snapshot
Knowledge, Level of Symmetry, and Time of Leader Election
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-642-45346-5_1openalex-snapshot
Modeling Reality Algorithmically: The Case of Wireless Communication
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_15openalex-snapshot
Deterministic Leader Election in Multi-hop Beeping Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_18openalex-snapshot
Radio Network Lower Bounds Made Easy
inferred← citeshttps://doi.org/10.1007/bf02259748openalex-snapshot
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
inferred← citeshttps://doi.org/10.1007/bfb0040407openalex-snapshot
The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels
inferred← citeshttps://doi.org/10.1007/s00224-003-1149-8openalex-snapshot
Broadcasting Spanning Forests on a Multiple-Access Channel
inferred← citeshttps://doi.org/10.1007/s00446-005-0153-4openalex-snapshot
Performing work in broadcast networks
inferred← citeshttps://doi.org/10.1007/s00446-011-0131-yopenalex-snapshot
How much memory is needed for leader election
inferred← citeshttps://doi.org/10.1007/s00446-012-0172-xopenalex-snapshot
Leader election using loneliness detection
inferred← citeshttps://doi.org/10.1007/s00446-013-0196-xopenalex-snapshot
Leader election for anonymous asynchronous agents in arbitrary networks
inferred← citeshttps://doi.org/10.1007/s00446-014-0237-0openalex-snapshot
Knowledge, level of symmetry, and time of leader election
inferred← citeshttps://doi.org/10.1007/s00446-016-0265-zopenalex-snapshot
Randomized mutual exclusion on a multiple access channel
inferred← citeshttps://doi.org/10.1007/s00446-018-0323-9openalex-snapshot
Contention resolution on a fading channel
inferred← citeshttps://doi.org/10.1007/s00446-018-0341-7openalex-snapshot
Ordered and delayed adversaries and how to work against them on a shared channel
inferred← citeshttps://doi.org/10.1007/s00446-021-00403-9openalex-snapshot
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
inferred← citeshttps://doi.org/10.1007/s00446-023-00451-3openalex-snapshot
Four shades of deterministic leader election in anonymous networks
inferred← citeshttps://doi.org/10.1007/s00446-025-00490-yopenalex-snapshot
Contention resolution with message deadlines
inferred← citeshttps://doi.org/10.1007/s00453-013-9816-xopenalex-snapshot
Unbounded Contention Resolution in Multiple-Access Channels
inferred← citeshttps://doi.org/10.1007/s00453-014-9905-5openalex-snapshot
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
inferred← citeshttps://doi.org/10.1007/s00453-018-0444-3openalex-snapshot
Impact of Knowledge on Election Time in Anonymous 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.1007/s10878-014-9713-5openalex-snapshot
Information exchange with collision detection on multiple channels
inferred← citeshttps://doi.org/10.1007/s10922-006-9036-7openalex-snapshot
A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90116-6openalex-snapshot
A fast parallel quicksort algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90133-3openalex-snapshot
Maximum finding on a multiple access broadcast network
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.001openalex-snapshot
Quasi-optimal energy-efficient leader election algorithms in 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.jpdc.2003.12.001openalex-snapshot
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.037openalex-snapshot
Topology recognition and leader election in colored networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.022openalex-snapshot
Fast size approximation of a radio network in beeping model
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.024openalex-snapshot
Leader election in SINR model with arbitrary power control
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.027openalex-snapshot
Leader election in multi-hop radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.020openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.026openalex-snapshot
Singletons for simpletons revisiting windowed backoff with Chernoff bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115907openalex-snapshot
Softening the impact of collisions in contention resolution
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.5.1355openalex-snapshot
An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.4.1432openalex-snapshot
Generalization of Sorting in Single Hop Wireless Networks
inferred← citeshttps://doi.org/10.1098/rsta.2011.0212openalex-snapshot
Distributed algorithms for sensor networks
inferred← citeshttps://doi.org/10.1108/02602280610652749openalex-snapshot
A hybrid randomized protocol for RFID tag identification
inferred← citeshttps://doi.org/10.1109/12.537132openalex-snapshot
Dynamic prioritized conflict resolution on multiple access broadcast networks
inferred← citeshttps://doi.org/10.1109/12.93743openalex-snapshot
Optimal prioritized conflict resolution on a multiple access channel
inferred← citeshttps://doi.org/10.1109/71.877833openalex-snapshot
Randomized initialization protocols for ad hoc 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/allerton49937.2022.9929420openalex-snapshot
Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access
inferred← citeshttps://doi.org/10.1109/csndsp.2016.7573982openalex-snapshot
Practical privacy preserving size approximation in distributed systems
inferred← citeshttps://doi.org/10.1109/dcoss.2016.40openalex-snapshot
Time-Optimal and Energy-Efficient Size Approximation of Radio Networks
inferred← citeshttps://doi.org/10.1109/ftdcs.2007.8openalex-snapshot
A Transactional Framework for Programming Wireless Sensor/Actor Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2010.50openalex-snapshot
Towards Power-Sensitive Communication on a Multiple-Access Channel
inferred← citeshttps://doi.org/10.1109/icdcsw.2005.120openalex-snapshot
Reconciling the Theory and Practice of (Un)Reliable Wireless Broadcast
inferred← citeshttps://doi.org/10.1109/icpp.2001.952068openalex-snapshot
Uniform leader election protocols for radio networks
inferred← citeshttps://doi.org/10.1109/icpp.2013.49openalex-snapshot
Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1109/ictel.2003.1191592openalex-snapshot
Quasi-optimal leader election algorithms in radio networks with log-logarithmic awake time-slots
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062150openalex-snapshot
Interference-Resilient Information Exchange
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925118openalex-snapshot
Fundamental protocols for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016539openalex-snapshot
A hybrid randomized initialization protocol for TDMA in single-hop wireless networks
inferred← citeshttps://doi.org/10.1109/ipdps.2005.269openalex-snapshot
Local Leader Election, Signal Strength Aware Flooding, and Routeless Routing
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.80openalex-snapshot
K-Selection Protocols from Energetic Complexity Perspective
inferred← citeshttps://doi.org/10.1109/ipps.1999.760530openalex-snapshot
Randomized initialization protocols for packet radio networks
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004263openalex-snapshot
A survey on leader election protocols for radio networks
inferred← citeshttps://doi.org/10.1109/iwwan.2004.1525547openalex-snapshot
Mac-layer approach for cluster-based aggregation in sensor networks
inferred← citeshttps://doi.org/10.1109/mascots.2013.71openalex-snapshot
A Novel Energy Efficient Broadcast Leader Election
inferred← citeshttps://doi.org/10.1109/nca.2012.34openalex-snapshot
Spotcast -- A Communication Abstraction for Proximity-Based Mobile Applications
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1109/spdp.1991.218302openalex-snapshot
Fast load balancing on a PRAM
inferred← citeshttps://doi.org/10.1109/tpds.2002.1003864openalex-snapshot
Uniform leader election protocols for radio networks
inferred← citeshttps://doi.org/10.1109/tpds.2010.162openalex-snapshot
Consensus and Mutual Exclusion in a Multiple Access Channel
inferred← citeshttps://doi.org/10.1137/0218054openalex-snapshot
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
inferred← citeshttps://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973105.54openalex-snapshot
Near Optimal Leader Election in Multi-Hop Radio Networks
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch44openalex-snapshot
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
inferred← citeshttps://doi.org/10.1137/17m1158604openalex-snapshot
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses
inferred← citeshttps://doi.org/10.1137/24m1670743openalex-snapshot
Jamming-Resistant Backoff with Polylogarithmic Sending and Listening Cost
inferred← citeshttps://doi.org/10.1137/s0097539794279109openalex-snapshot
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
inferred← citeshttps://doi.org/10.1142/s0129054104002315openalex-snapshot
TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
inferred← citeshttps://doi.org/10.1142/s0219265902000628openalex-snapshot
IDENTIFYING FAULTY NODES IN WIRELESS SENSOR NETWORKS
inferred← citeshttps://doi.org/10.1142/s1793830910000796openalex-snapshot
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
inferred← citeshttps://doi.org/10.1145/1073814.1073843openalex-snapshot
On selection problem in radio networks
inferred← citeshttps://doi.org/10.1145/1073814.1073850openalex-snapshot
Consensus and collision detectors in wireless Ad Hoc networks
inferred← citeshttps://doi.org/10.1145/1146381.1146398openalex-snapshot
Adversarial queuing on the multiple-access channel
inferred← citeshttps://doi.org/10.1145/1400751.1400767openalex-snapshot
Secure communication over radio channels
inferred← citeshttps://doi.org/10.1145/1400751.1400783openalex-snapshot
Virtual infrastructure for collision-prone wireless networks
inferred← citeshttps://doi.org/10.1145/164051.164059openalex-snapshot
An Ω( D log( N/D )) lower bound for broadcast in radio networks
inferred← citeshttps://doi.org/10.1145/1993806.1993838openalex-snapshot
Unbounded contention resolution in multiple-access channels
inferred← citeshttps://doi.org/10.1145/2071379.2071384openalex-snapshot
Adversarial Queuing on the Multiple Access Channel
inferred← citeshttps://doi.org/10.1145/2107502.2107522openalex-snapshot
Self-stabilizing leader election for single-hop wireless networks despite jamming
inferred← citeshttps://doi.org/10.1145/2312005.2312028openalex-snapshot
Deterministic multi-channel information exchange
inferred← citeshttps://doi.org/10.1145/2335470.2335473openalex-snapshot
Asynchronous leader election and MIS using abstract MAC layer
inferred← citeshttps://doi.org/10.1145/2462096.2462125openalex-snapshot
Countermeasures against sybil attacks in WSN based on proofs-of-work
inferred← citeshttps://doi.org/10.1145/2635818openalex-snapshot
Principles of Robust Medium Access and an Application to Leader Election
inferred← citeshttps://doi.org/10.1145/2755573.2755602openalex-snapshot
Electing a Leader in Wireless Networks Quickly Despite Jamming
inferred← citeshttps://doi.org/10.1145/2767386.2767439openalex-snapshot
The Cost of Synchronizing Multiple-Access Channels
inferred← citeshttps://doi.org/10.1145/2897518.2897655openalex-snapshot
Contention resolution with log-logstar channel accesses
inferred← citeshttps://doi.org/10.1145/2933057.2933076openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/2933057.2933091openalex-snapshot
Contention Resolution on a Fading Channel
inferred← citeshttps://doi.org/10.1145/2933057.2933110openalex-snapshot
Contention Resolution on Multiple Channels with Collision Detection
inferred← citeshttps://doi.org/10.1145/2935764.2935772openalex-snapshot
Election vs. Selection
inferred← citeshttps://doi.org/10.1145/3039870openalex-snapshot
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
inferred← citeshttps://doi.org/10.1145/3055399.3055481openalex-snapshot
Exponential separations in the energy complexity of leader election
inferred← citeshttps://doi.org/10.1145/3087556.3087563openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferred← citeshttps://doi.org/10.1145/3087556.3087584openalex-snapshot
Is Our Model for Contention Resolution Wrong?
inferred← citeshttps://doi.org/10.1145/3212734.3212774openalex-snapshot
The Energy Complexity of Broadcast
inferred← citeshttps://doi.org/10.1145/3276769openalex-snapshot
Scaling Exponential Backoff
inferred← citeshttps://doi.org/10.1145/3341111openalex-snapshot
Exponential Separations in the Energy Complexity of Leader Election
inferred← citeshttps://doi.org/10.1145/3350755.3400239openalex-snapshot
Contention Resolution with Message Deadlines
inferred← citeshttps://doi.org/10.1145/3350755.3400276openalex-snapshot
Deterministic Leader Election in Anonymous Radio Networks
inferred← citeshttps://doi.org/10.1145/3350755.3400292openalex-snapshot
Efficient Local Medium Access
inferred← citeshttps://doi.org/10.1145/3357713.3384305openalex-snapshot
Contention resolution without collision detection
inferred← citeshttps://doi.org/10.1145/3409964.3461794openalex-snapshot
Four Shades of Deterministic Leader Election in Anonymous 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/3465084.3467911openalex-snapshot
Contention Resolution with Predictions
inferred← citeshttps://doi.org/10.1145/3465084.3467920openalex-snapshot
Tight Trade-off in Contention Resolution without Collision Detection
inferred← citeshttps://doi.org/10.1145/3490148.3538573openalex-snapshot
Contention Resolution for Coded Radio Networks
inferred← citeshttps://doi.org/10.1145/3490148.3538586openalex-snapshot
The Energy Complexity of Las Vegas Leader Election
inferred← citeshttps://doi.org/10.1145/3490148.3538592openalex-snapshot
Robust and Optimal Contention Resolution without Collision Detection
inferred← citeshttps://doi.org/10.1145/3527171openalex-snapshot
Deterministic Leader Election in Anonymous Radio Networks
inferred← citeshttps://doi.org/10.1145/3614429openalex-snapshot
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.1145/3662158.3662807openalex-snapshot
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
inferred← citeshttps://doi.org/10.1145/3733594openalex-snapshot
A Survey on Adversarial Contention Resolution
inferred← citeshttps://doi.org/10.1145/3737611.3776617openalex-snapshot
A Gentle Wakeup Call
inferred← citeshttps://doi.org/10.1145/383962.384000openalex-snapshot
The do-all problem in broadcast networks
inferred← citeshttps://doi.org/10.1145/41840.41849openalex-snapshot
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
inferred← citeshttps://doi.org/10.1145/571825.571833openalex-snapshot
Efficient algorithms for leader election in radio networks
inferred← citeshttps://doi.org/10.1145/72981.73005openalex-snapshot
Multiple communication in multi-hop radio networks
inferred← citeshttps://doi.org/10.1484/j.rm.5.124725openalex-snapshot
Habilitation à diriger des recherches
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_111openalex-snapshot
k-Selection Protocols from Energetic Complexity Perspective
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.17openalex-snapshot
Stable Memoryless Queuing under Contention
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2018.26openalex-snapshot
Approximate Neighbor Counting in Radio Networks
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2446openalex-snapshot
Dynamic Sharing of a Multiple Access Channel
inferred← citeshttps://doi.org/10.48550/arxiv.1107.0234openalex-snapshot
Unbounded Contention Resolution in Multiple-Access Channels
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7300openalex-snapshot
Radio Network Lower Bounds Made Easy
inferred← citeshttps://doi.org/10.48550/arxiv.1411.1319openalex-snapshot
Election vs. Selection: Two Ways of Finding the Largest Node in a Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1503.08570openalex-snapshot
Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01300openalex-snapshot
Knowledge, Level of Symmetry, and Time of Leader Election
inferred← citeshttps://doi.org/10.48550/arxiv.1508.06583openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
inferred← citeshttps://doi.org/10.48550/arxiv.1604.05023openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00137openalex-snapshot
On Leader Green Election
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01587openalex-snapshot
An Optimal Randomized Broadcasting Algorithm in Radio Networks with Collision Detection
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03534openalex-snapshot
Leader Election in Trees with Customized Advice
inferred← citeshttps://doi.org/10.48550/arxiv.1908.10388openalex-snapshot
Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.2105.07518openalex-snapshot
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607028openalex-snapshot
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
inferred← citeshttps://doi.org/10.7282/t3pz5985openalex-snapshot
Upper and lower bounds in radio 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.