Let T be a tree with n nodes from which edges are deleted interspersed with m on-line connectivity queries. Even and Shiloach gave an O(n log n + m) algorithm to process edge deletion and m queries (An On-Line Edge-Deletion problem, J. ACM, Vol. 28, Nr. 1, 1981). In this paper we present an O(n + m) algorithm for the same problem.
The behaviour of three methods for constructing a binary heap on a computer with a hierarchical memory is studied. The methods considered are the original one proposed by Williams , in which elements are repeatedly inserted into a single heap; the improvement by Floyd , in which small heaps are repeatedly merged to bigger heaps; and a recent… (More)
This thesis is presented in partial fulfillment of the Danish Kandidatgrad i Datalogi (candidatus scientiarium in Computer Science) at the University of Copenhagen, and was written during the autumn and winter of 1998 under the supervision of Jyrki Katajainen. The cache behaviour of programs is studied. It is common knowledge that the cache memory subsystem… (More)