Optimal Key Tree Structure for Deleting Two or More Leaves

DOI10.1007/978-3-540-92182-0_10zbMath1183.68275OpenAlexW1529499406MaRDI QIDQ3596708

Weiwei Wu, Enhong Chen, Minming Li

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)

Related Items (2)

Optimal key tree structure for two-user replacement and deletion problems ⋮ Optimal tree structure with loyal users and batch updates

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