DBScholar

Back to papers

A Discipline for Robustness or Storage Reduction in Binary Search Trees

Summary: Fault-tolerant BST encoding that detects any two field corruptions and corrects one with O(n) repair time and negligible storage overhead. Also provides a single-pointer-per-key BST preserving search/update costs and compatible with balancing, often shortening paths. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
646
Venue
PODS
Year
1983
Pagerank
-
Overall Rank
14,500 | 0.52%
DOI
10.1145/588058.588069

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{munro_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{A Discipline for Robustness or Storage Reduction in Binary Search Trees}},
        url = {https://dl.acm.org/doi/10.1145/588058.588069},
        doi = {10.1145/588058.588069},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Munro, J Ian and Poblete, Patricio V.},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers