Search results
From MaRDI portal
- backwards analysis 2018-03-15 Paper Consistent hashing with bounded loads 2018-03-15 Paper Dynamic bridge-finding in \(\tilde{O}(\log^2 n)\) amortized time...10 bytes (15 words) - 20:42, 9 December 2023
- Competitive weighted throughput analysis of greedy protocols on DAGs 2015-03-10 Paper Competitive weighted throughput analysis of greedy protocols on dags...10 bytes (13 words) - 15:46, 10 December 2023
- 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...15 bytes (396 words) - 20:48, 4 February 2024
- 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...15 bytes (1,167 words) - 11:22, 3 February 2024
- algorithms Organization and maintenance of large ordered indexes Design and Analysis of a Data Structure for Representing Sorted Lists On the average number...15 bytes (441 words) - 05:45, 31 January 2024
- priority queues Amortized Computational Complexity Implementation and Analysis of Binomial Queue Algorithms Cited In (52) A systematic analysis of splaying...15 bytes (551 words) - 01:55, 31 January 2024
- sorted lists Amortized Computational Complexity An Amortized Analysis of Insertions into AVL-Trees Relaxed balance using standard rotations Analysis and performance...15 bytes (361 words) - 17:01, 31 January 2024
