Pages that link to "Item:Q923051"
From MaRDI portal
The following pages link to Conflict resolution in a multiple access channel (Q923051):
Displaying 16 items.
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- On adaptive conflict resolution algorithms in a multiple access channel (Q809980) (← links)
- Conflict-resolving tree algorithm stable to incomplete interference damping (Q1027716) (← links)
- An optimal strategy for a conflict resolution problem (Q1079450) (← links)
- Packet output time for a strategy which knows the multiplicities of occurring conflicts (Q1280746) (← links)
- Average packet output time for conflict with multiplicity 3 and ternary feedback (Q1280781) (← links)
- A fast maximum finding algorithm on broadcast communication (Q1350933) (← links)
- A logarithmic lower bound for time-spread multiple-access (TSMA) protocols (Q1853910) (← links)
- New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions (Q2333785) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
- Generalized selectors and locally thin families with applications to conflict resolution in multiple access channels supporting simultaneous successful transmissions (Q3174950) (← links)
- (Q3699596) (← links)
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels (Q3765234) (← links)
- Asynchronous Shared Channel (Q5368991) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5919324) (← links)
