Paper Info
Title
The amortized complexity of Henriksen's algorithm
Abstract
Henriksen's algorithm is a priority queue implementation that has been proposed for the event list found in discrete event simulations. It offers several practical advantages over heaps and tree structures.
Year
DOI
Venue
1986
10.1007/BF01933741
BIT
Keywords
Field
DocType
amortized complexity,discrete event simulation,tree structure,priority queue
Data structure,Algorithm complexity,Computer science,Queue,Amortized analysis,Algorithm,Heap (data structure),Priority queue,File management,Tree structure
Journal
Volume
Issue
ISSN
26
2
1572-9125
Citations 
PageRank 
References 
2
1.62
8
Authors
1
Name
Order
Citations
PageRank
Jeffrey H. Kingston133638.79