Randomized splay trees

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    15 Citations (Scopus)

    Abstract

    The performance of the original version of the splay tree algorithm has been unchallenged for over a decade. We propose three randomized versions with better upper bounds on the expected running times (by constant factors). The improvements are particularly strong if the number of insertions is relatively small. All expectations are taken over the coin tosses of the randomized algorithms for worst case inputs. Hence slow running times are very unlikely for any request sequence. Algorithm A improves the expected running time, but could be very slow (with tiny probability). Algorithm B shows that without any loss in the original amortized running time, the expected running time can still be improved by a constant percentage. Algorithm C has the same efficient expected running time as Algorithm A, while its (worst case) amortized running time deteriorates only by a constant factor compared to standard deterministic splaying.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    Editors Anon
    PublisherSIAM
    StatePublished - 1999
    EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
    Duration: Jan 17 1999Jan 19 1999

    Other

    OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
    CityBaltimore, MD, USA
    Period1/17/991/19/99

    Fingerprint

    Tree Algorithms
    Randomized Algorithms
    Insertion
    Percentage
    Upper bound
    Standards

    All Science Journal Classification (ASJC) codes

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    Cite this

    Furer, M. (1999). Randomized splay trees. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms SIAM.
    Furer, Martin. / Randomized splay trees. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1999.
    @inproceedings{674964b3928b4b5a9aea52ac02d3860e,
    title = "Randomized splay trees",
    abstract = "The performance of the original version of the splay tree algorithm has been unchallenged for over a decade. We propose three randomized versions with better upper bounds on the expected running times (by constant factors). The improvements are particularly strong if the number of insertions is relatively small. All expectations are taken over the coin tosses of the randomized algorithms for worst case inputs. Hence slow running times are very unlikely for any request sequence. Algorithm A improves the expected running time, but could be very slow (with tiny probability). Algorithm B shows that without any loss in the original amortized running time, the expected running time can still be improved by a constant percentage. Algorithm C has the same efficient expected running time as Algorithm A, while its (worst case) amortized running time deteriorates only by a constant factor compared to standard deterministic splaying.",
    author = "Martin Furer",
    year = "1999",
    language = "English (US)",
    editor = "Anon",
    booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
    publisher = "SIAM",

    }

    Furer, M 1999, Randomized splay trees. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 1/17/99.

    Randomized splay trees. / Furer, Martin.

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1999.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Randomized splay trees

    AU - Furer, Martin

    PY - 1999

    Y1 - 1999

    N2 - The performance of the original version of the splay tree algorithm has been unchallenged for over a decade. We propose three randomized versions with better upper bounds on the expected running times (by constant factors). The improvements are particularly strong if the number of insertions is relatively small. All expectations are taken over the coin tosses of the randomized algorithms for worst case inputs. Hence slow running times are very unlikely for any request sequence. Algorithm A improves the expected running time, but could be very slow (with tiny probability). Algorithm B shows that without any loss in the original amortized running time, the expected running time can still be improved by a constant percentage. Algorithm C has the same efficient expected running time as Algorithm A, while its (worst case) amortized running time deteriorates only by a constant factor compared to standard deterministic splaying.

    AB - The performance of the original version of the splay tree algorithm has been unchallenged for over a decade. We propose three randomized versions with better upper bounds on the expected running times (by constant factors). The improvements are particularly strong if the number of insertions is relatively small. All expectations are taken over the coin tosses of the randomized algorithms for worst case inputs. Hence slow running times are very unlikely for any request sequence. Algorithm A improves the expected running time, but could be very slow (with tiny probability). Algorithm B shows that without any loss in the original amortized running time, the expected running time can still be improved by a constant percentage. Algorithm C has the same efficient expected running time as Algorithm A, while its (worst case) amortized running time deteriorates only by a constant factor compared to standard deterministic splaying.

    UR - http://www.scopus.com/inward/record.url?scp=0032777283&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032777283&partnerID=8YFLogxK

    M3 - Conference contribution

    BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

    A2 - Anon, null

    PB - SIAM

    ER -

    Furer M. Randomized splay trees. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1999