Optimal trees for minimizing average individual updating cost (Q896107): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal tree structure with loyal users and batch updates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Tree Structures for Group Key Management with Batch Updates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing deletion cost for secure multicast key management / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximately optimal trees for group key management with batch updates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal tree structures for group key tree management considering insertion and deletion cost / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal key tree structure for two-user replacement and deletion problems / rank | |||
Normal rank | |||
Revision as of 04:32, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal trees for minimizing average individual updating cost |
scientific article |
Statements
Optimal trees for minimizing average individual updating cost (English)
0 references
11 December 2015
0 references
key tree
0 references
optimality
0 references
individual re-keying
0 references
average case
0 references
0 references
