Improved bounds for multipass pairing heaps and path-balanced binary search trees

Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Fingerprint

Dive into the research topics of 'Improved bounds for multipass pairing heaps and path-balanced binary search trees'. Together they form a unique fingerprint.

Keyphrases

Mathematics

Computer Science