Pu, I. and Gibbons, A.M. (1996) Matricial space-economy with constant access-time. Technical Report. Department of Computer Science, Coventry, UK.
Abstract
We describe a particularly simple and practical algorithm for economic storage of arrays without recourse to the intricacies of perfect hash functions. This is done while retaining constant access time. The algorithm performs usefully over a range of values of x/n where the notional input array contains n entries with x non-zero elements. For x less than or equal to n/k and one particular setting of the array parameter, we show that the average storage required is about n(k+30)/10k. For sparse arrays this becomes n/10.
Actions (login required)
![[img]](http://eprints.dcs.warwick.ac.uk/style/images/fileicons/application_pdf.png)
