The throughput of the stack algorithm in a channel with \(N\)-conflicts (Q1320668)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The throughput of the stack algorithm in a channel with \(N\)-conflicts |
scientific article; zbMATH DE number 560987
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The throughput of the stack algorithm in a channel with \(N\)-conflicts |
scientific article; zbMATH DE number 560987 |
Statements
The throughput of the stack algorithm in a channel with \(N\)-conflicts (English)
0 references
18 May 1994
0 references
random multiple access channel
0 references
stack algorithm
0 references
\(N\)-conficts
0 references
0.8601873
0 references
0.85681295
0 references
0.8566631
0 references
0 references
0.8476214
0 references
0.84427863
0 references
0.84153545
0 references
