Optimal Key Tree Structure for Deleting Two or More Leaves

DOI10.1007/978-3-540-92182-0_10MaRDI QIDQ3596708zbMATH OpenOpenAlexFDO

Authors Weiwei Wu, Minming Li, Enhong Chen

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_10

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Optimal key tree structure for two-user replacement and deletion problems
• Optimal tree structures for group key tree management considering insertion and deletion cost
• Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
• Optimal search trees using two-way key comparisons
• Deletion without rebalancing in multiway search trees
• Deletion without rebalancing in multiway search trees
• Deleting to structured trees
• Deleting keys of B-trees in parallel
• Analysis of the standard deletion algorithms in exact fit domain binary search trees

Cited in

(7)

• Optimal tree structures for group key tree management considering insertion and deletion cost
• Optimal trees for minimizing average individual updating cost
• Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
• Optimal key tree structure for two-user replacement and deletion problems
• Optimal tree structure with loyal users and batch updates
• Optimal trees for minimizing average individual updating cost
• Optimizing deletion cost for secure multicast key management

This page was built for publication: Optimal Key Tree Structure for Deleting Two or More Leaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596708)