Optimal key tree structure for two-user replacement and deletion problems (Q358638)
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: Optimal key tree structure for two-user replacement and deletion problems |
scientific article; zbMATH DE number 6196994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal key tree structure for two-user replacement and deletion problems |
scientific article; zbMATH DE number 6196994 |
Statements
Optimal key tree structure for two-user replacement and deletion problems (English)
0 references
9 August 2013
0 references
key tree
0 references
optimality
0 references
updating cost
0 references
user deletion
0 references
multicast cost
0 references
0.9477312564849854
0 references
0.8678657412528992
0 references
0.8645561337471008
0 references
0.8459290862083435
0 references
