A space efficient variant of path copying for partially persistent sorted sets

DOI10.1006/JCSS.1996.0055zbMath0859.68012OpenAlexW2052140323MaRDI QIDQ1816748

Paul F. Dietz

Publication date: 13 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0055

zbMATH Keywords

partially persistent sorted set problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (1)

Some Results for Elementary Operations

This page was built for publication: A space efficient variant of path copying for partially persistent sorted sets