Pu, Ida Mengyi and Gibbons, Alan (Alan M.) (1996) Matricial space-economy with constant access-time. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Preview

PDF (Department of Computer Science Research Report) WRAP_cs-rr-303.pdf - Other - Requires a PDF viewer. Download (734Kb) | Preview

Request Changes to record.

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.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Data structures (Computer science), Memory management (Computer science) -- Mathematical models
Series Name:	Department of Computer Science research report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	March 1996
Dates:	Date Event March 1996 Completion
Number:	Number 303
Number of Pages:	11
DOI:	CS-RR-303
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Funder:	European Strategic Programme of Research and Development in Information Technology (ESPRIT)
Grant number:	20244 (ESPRIT)
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads