Author of the publication

Two new methods for constructing double-ended priority queues from priority queues.

, , and . Computing, 83 (4): 193-204 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Heap Construction - 50 Years Later., , and . Comput. J., 60 (5): 657-674 (2017)Worst-Case Optimal Priority Queues via Extended Regular Counters, and . CoRR, (2011)Violation Heaps: A Better Substitute for Fibonacci Heaps. CoRR, (2008)Red-Black Trees with Constant Update Time., , , and . CoRR, (2018)Two Constant-Factor-Optimal Realizations of Adaptive Heapsort., , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 195-208. Springer, (2011)A Catalogue of Algorithms for Building Weak Heaps., , and . IWOCA, volume 7643 of Lecture Notes in Computer Science, page 249-262. Springer, (2012)Pairing Heaps with Costless Meld.. ESA (2), volume 6347 of Lecture Notes in Computer Science, page 183-193. Springer, (2010)Strictly-Regular Number System and Data Structures., , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 26-37. Springer, (2010)Optimal prefix codes with fewer distinct codeword lengths are faster to construct., and . Inf. Comput., (2019)Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls., , and . ACM Trans. Algorithms, 17 (2): 18:1-18:19 (2021)