### Abstract

Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.

Original language | English (US) |
---|---|

Title of host publication | Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings |

Publisher | Springer Verlag |

Pages | 32-45 |

Number of pages | 14 |

Volume | 1851 |

ISBN (Print) | 3540676902, 9783540676904 |

DOIs | |

State | Published - 2000 |

Event | 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 - Bergen, Norway Duration: Jul 5 2000 → Jul 7 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1851 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 |
---|---|

Country | Norway |

City | Bergen |

Period | 7/5/00 → 7/7/00 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings*(Vol. 1851, pp. 32-45). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851). Springer Verlag. https://doi.org/10.1007/3-540-44985-X

**Improved upper bounds for pairing heaps.** / Iacono, John.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings.*vol. 1851, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851, Springer Verlag, pp. 32-45, 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, Bergen, Norway, 7/5/00. https://doi.org/10.1007/3-540-44985-X

}

TY - GEN

T1 - Improved upper bounds for pairing heaps

AU - Iacono, John

PY - 2000

Y1 - 2000

N2 - Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.

AB - Pairing heaps are shown to have constant amortized time in-sert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to per-form an extract-min on an element x is O(log min(n; k)) where k is the number of heap operations performed since x's insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensi-tive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.

UR - http://www.scopus.com/inward/record.url?scp=84956859079&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956859079&partnerID=8YFLogxK

U2 - 10.1007/3-540-44985-X

DO - 10.1007/3-540-44985-X

M3 - Conference contribution

AN - SCOPUS:84956859079

SN - 3540676902

SN - 9783540676904

VL - 1851

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 32

EP - 45

BT - Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings

PB - Springer Verlag

ER -