Skip Navigation

The Computer Journal 1985 28(5):496-497; doi:10.1093/comjnl/28.5.496
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by O'Keefe, R. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Comment on ‘Complexity Analyses of Event Set Algorithms’

R. M. O'Keefe *

Board of Quantitative Social Science and Management Science, University of Kent at Canterbury, Canterbury, CT2 7NX, UK

Reeves1 proposes the use of a heap-based mechanism for the event set of discrete-event simulations. This short note reports experience in the design and use of event set mechanisms and concludes that for small- to medium-sized sets the linked list with a median pointer proves suitably efficient and highly transparent.


* Board of Quantitative Social Science and Management Science, University of Kent at Canterbury, Canterbury CT2 7NX


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.