Heap Bibliography

[   About   |  Browse   |   Statistics   ]

Number of references:	191	Last update:	September 4, 1997
Number of online publications:	0	Supported:	Unknown
Most recent reference:	1994

Search the bibliography

Information on the Bibliography

Authors:

Walter Kosters <Kosters @ rulwinw . LeidenUniv . nl> (email mangled to prevent spamming)
Roderick Bloem, Ray Dassen, Jeannette de Graaf, Jurriaan Hage, Koen van der Hauw, Hendrik Jan Hoogeboom

Department of Computer Science
Leiden University
P.O. Box 9512
2300 RA Leiden
The Netherlands

Abstract:

This file contains a list of BiBTeX-entries of papers concerning heaps in the field of Computer Science.

Author Comments:

In many references the annote field contains the abstract provided by the authors. In this case the word ``Abstract'' is used. The refersto field gives a list of references to other entries in this bib-file. Not all textbooks on (complexity of) algorithms are included. Not all references on adaptive sorting, deques, priority queues are included. Improvements are welcome.

Browsing the bibliography

• Original source:

  ftp://ftp.wi.leidenuniv.nl... (Format: bibtex, compressed with gzip)

  Other sites:

  http://www.wi.leidenuniv.nl... (Format: bibtex, compressed with gzip)
  

Bibliographic Statistics

Types:

article(85), inproceedings(48), book(25), techreport(24), phdthesis(4), incollection(2), mastersthesis(2), misc(1)

Fields:

title(191), year(191), author(190), pages(132), annote(91), volume(91), refersto(87), journal(85), number(72), publisher(56), booktitle(50), series(27), institution(24), address(20), note(16), organization(14), month(9), school(6), edition(4), editor(3), chapter(1), type(1)

Distribution of publication dates:

Please direct comments regarding the bibliography collection to <liinwwwa@ira.uka.de>. This page is part of the Computer Science Bibliography Collection. Copyright © 1994-2004, Alf-Christian Achilles. All Rights Reserved.