The simulation event list is a priority queue found in simulation packages like SIMULA. Its task is to hold the pending events of the simulation, so that they can be executed in the correct order. For varying reasons, most standard algorithms are poorly suited to the special demands of this application. Recent work, on the average-case performance of the binary search tree (BST) and p-tree algorithms under these conditions, is presented. The algorithms are shown to be worse than O(log(n)) in many cases.