Pages that link to "Item:Q3676042"
From MaRDI portal
The following pages link to Analysis of a stack algorithm for random multiple-access communication (Q3676042):
Displaying 15 items.
- Scale-free, self-organizing very large sensor networks (Q666139) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- Mathematical theory of queueing networks (Q913640) (← links)
- Analytical depoissonization and its applications (Q1129001) (← links)
- A stack protocol of CTM type with quartet feedback (Q1177132) (← links)
- The throughput of the stack algorithm in a channel with \(N\)-conflicts (Q1320668) (← links)
- A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events (Q1331296) (← links)
- Packet transmission using a blocked unmodified random multiple access stack-algorithm (Q1820123) (← links)
- Limit theorems for recursive algorithms (Q1893969) (← links)
- Dynamic tree algorithms (Q2268721) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- A probabilistic analysis of some tree algorithms (Q2496496) (← links)
- STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221) (← links)
- Stacked OSTBC: Error Performance and Rate Analysis (Q4567429) (← links)
- An extension of the kantorovich-rubinstein mass-transshipment problem (Q4845184) (← links)
