| Fat heaps: Source code | |
| Authors: | Amr Elmasry and Jyrki Katajainen |
| Publication: | CPH STL Report 2010-2, Department of Computer Science, University of Copenhagen (2010--2011), 54 pp. |
| Full text: |  PDF (294 kB) |
| 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 together with an accompanying tar file 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 implementations against ours. |
| Related: |  HTML (Conference paper) HTML (Journal article) HTML (tar ball) |
| BibLATEX: | @report{EK2011bS,
author = {Amr Elmasry and Jyrki Katajainen},
title = {Fat heaps: {S}ource code},
type = {CPH STL Report},
number = {2010-2},
institution = {Department of Computer Science, University of Copenhagen},
year = {2010--2011},
pagetotal = {54},
}
|