Heaps applied to event driven mechanisms-Reference-Cited by-同舟云学术

Heaps applied to event driven mechanisms

Published:1976-07 Issue:7 Volume:19 Page:417-418
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Gonnet Gaston H.¹

Affiliation:

1. Univ. of Waterloo, Ont., Canada

Abstract

I read with great interest F.P. Wyman's paper “Improved Event-Scanning Mechanisms for Discrete Event Simulation” [10] which, I found, makes a careful study of some techniques for event-list scanning.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/360248.360261

Reference10 articles.

1. Algorithm 245: Treesort

2. Gannet G.H. and Rogers L.D. An algorithmic and complexity analysis of the heap as a data structure. Research Rep. CS-75-20 U. of Waterloo July 1975. Gannet G.H. and Rogers L.D. An algorithmic and complexity analysis of the heap as a data structure. Research Rep. CS-75-20 U. of Waterloo July 1975.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Smart priority queue algorithms for self-optimizing event storage;Simulation Modelling Practice and Theory;2004-04

2. A performance comparison of event calendar algorithms: An empirical approach;Software: Practice and Experience;1993-10

3. An experimental analysis of event set algorithms for discrete event simulation;Microprocessing and Microprogramming;1993-03

4. A Mergeable Double-ended Priority Queue;The Computer Journal;1991-05-01

5. Analysis of Henriksen’s Algorithm for the Simulation Event Set;SIAM Journal on Computing;1986-08