Pages that link to "Item:Q3773810"

The following pages link to Estimating the multiplicities of conflicts to speed their resolution in multiple access channels (Q3773810):

Displaying 21 items.

• Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
• On adaptive conflict resolution algorithms in a multiple access channel (Q809980) (← links)
• Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
• The average CRI-length of a controlled ALOHA collision resolution algorithm (Q1208718) (← links)
• The throughput of the stack algorithm in a channel with \(N\)-conflicts (Q1320668) (← links)
• Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals (Q2241304) (← links)
• Fast size approximation of a radio network in beeping model (Q2292914) (← links)
• A class of algorithms for collision resolution with multiplicity estimation (Q2471709) (← links)
• Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221) (← links)
• Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
• (Q3699596) (← links)
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels (Q3765234) (← links)
• Stochastic Contention Resolution With Short Delays (Q4210173) (← links)
• Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses (Q4687247) (← links)
• Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
• Approximate Neighbor Counting in Radio Networks (Q5091104) (← links)
• How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (Q5204318) (← links)
• Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel (Q5501204) (← links)
• Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)