Search results

Competitive weighted throughput analysis of greedy protocols on DAGs 2015-03-10 Paper Competitive weighted throughput analysis of greedy protocols on DAGs...

has expected amortized cost O(1) for insert, decrease-key, and merge. Karger conjectured that this data structure has expected amortized cost O(logs) for...

Pairing heaps with costless meld Why some heaps support constant-amortized-time decrease-key operations, and others do not On the efficiency of pairing heaps...

data structure for manipulating priority queues Amortized Computational Complexity Implementation and Analysis of Binomial Queue Algorithms Cited In (44) Quake...

heapsort on secondary storage A tight lower bound for top-down skew heaps Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN...

sorted lists Amortized Computational Complexity An Amortized Analysis of Insertions into AVL-Trees Relaxed balance using standard rotations Analysis and performance...

algorithms Organization and maintenance of large ordered indexes Design and Analysis of a Data Structure for Representing Sorted Lists On the average number...

Asymptotic Bound for Next-Fit-Decreasing Bin-Packing Approximation scheduling algorithms: a survey Several methods of analysis for cardinality constrained...

prior work on the topic. The sandwiched Renyi relative entropy is a key tool in our analysis. Finally, by combining our results with recent results of Hayashi...