Fat heaps: source code

Amr Ahmed Abd Elmoneim Elmasry; Jyrki Katajainen

Fat heaps: source code

Amr Ahmed Abd Elmoneim Elmasry, Jyrki Katajainen

Abstract

This report is an electronic appendix to our paper \Fat heaps without
regular counters". In that paper we described a new variant of fat heaps that is
conceptually simpler and easier to implement than the original version. We also
compared the practical performance of this data structure to that of other related
data structures (run-relaxed weak queues and Fibonacci heaps). This report to-
gether with an accompanying tar le gives the source code used in the experiments
reported in the paper. By making the programs publicly available, we provide other
researchers the opportunity to scrutinize the code and compare their own imple-
mentations against ours.

Originalsprog	Engelsk

Forlag	Department of Computer Science, University of Copenhagen
Antal sider	54
Status	Udgivet - 2011

Navn	CPH STL Report
Vol/bind	2010-2

Citationsformater

@book{cdbce36bea2e4bdd92b83095833bb1f8,

title = "Fat heaps: source code",

abstract = "This report is an electronic appendix to our paper \Fat heaps withoutregular counters{"}. In that paper we described a new variant of fat heaps that isconceptually simpler and easier to implement than the original version. We alsocompared the practical performance of this data structure to that of other relateddata structures (run-relaxed weak queues and Fibonacci heaps). This report to-gether with an accompanying tar le gives the source code used in the experimentsreported in the paper. By making the programs publicly available, we provide otherresearchers the opportunity to scrutinize the code and compare their own imple-mentations against ours.",

author = "Elmasry, {Amr Ahmed Abd Elmoneim} and Jyrki Katajainen",

year = "2011",

language = "English",

series = "CPH STL Report",

publisher = "Department of Computer Science, University of Copenhagen",

}

TY - RPRT

T1 - Fat heaps

T2 - source code

AU - Elmasry, Amr Ahmed Abd Elmoneim

AU - Katajainen, Jyrki

PY - 2011

Y1 - 2011

N2 - This report is an electronic appendix to our paper \Fat heaps withoutregular counters". In that paper we described a new variant of fat heaps that isconceptually simpler and easier to implement than the original version. We alsocompared the practical performance of this data structure to that of other relateddata structures (run-relaxed weak queues and Fibonacci heaps). This report to-gether with an accompanying tar le gives the source code used in the experimentsreported in the paper. By making the programs publicly available, we provide otherresearchers the opportunity to scrutinize the code and compare their own imple-mentations against ours.

AB - This report is an electronic appendix to our paper \Fat heaps withoutregular counters". In that paper we described a new variant of fat heaps that isconceptually simpler and easier to implement than the original version. We alsocompared the practical performance of this data structure to that of other relateddata structures (run-relaxed weak queues and Fibonacci heaps). This report to-gether with an accompanying tar le gives the source code used in the experimentsreported in the paper. By making the programs publicly available, we provide otherresearchers the opportunity to scrutinize the code and compare their own imple-mentations against ours.