4 research outputs found

    Median-of-k Jumplists and Dangling-Min BSTs

    Get PDF
    We extend randomized jumplists introduced by Br\"onnimann et al. (STACS 2003) to choose jump-pointer targets as median of a small sample for better search costs, and present randomized algorithms with expected O(logn)O(\log n) time complexity that maintain the probability distribution of jump pointers upon insertions and deletions. We analyze the expected costs to search, insert and delete a random element, and we show that omitting jump pointers in small sublists hardly affects search costs, but significantly reduces the memory consumption. We use a bijection between jumplists and "dangling-min BSTs", a variant of (fringe-balanced) binary search trees for the analysis. Despite their similarities, some standard analysis techniques for search trees fail for dangling-min trees (and hence for jumplists)

    Smokejumper Magazine, January 2007

    Get PDF
    This issue of the National Smokejumper Association (NSA) Smokejumper Magazine contains the following articles: Prisoner in Laos Part II (continues in article from October 2006), Remembering Chuck Dywart, Alaska Fire Control Jumpers, Smokejumping and Ski Jumping (Historic). Smokejumper Magazine continues Static Line, which was the original title of the NSA quarterly magazine.https://dc.ewu.edu/smokejumper_mag/1053/thumbnail.jp

    Median-of-k Jumplists

    No full text
    Nebel M, Neumann E, Wild S. Median-of-k Jumplists. 2016
    corecore