Thumbnail
Access Restriction
Subscribed

Author Yao, Andrew Chi-Chih ♦ Tarjan, Robert Endre
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Parsing ♦ Gaussian elimination ♦ Searching ♦ Table compression ♦ Sparse matrix ♦ Table lookup
Abstract The problem of storing and searching large sparse tables is ubiquitous in computer science. The standard technique for storing such tables is hashing, but hashing has poor worst-case performance. We propose a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1. The method requires O(n) words of storage and allows O(logn N) access time. Although our method is a little complicated to use in practice, our analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Description Affiliation: Standford Univ., Stanford, CA (Tarjan, Robert Endre; Yao, Andrew Chi-Chih)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 11
Page Count 6
Starting Page 606
Ending Page 611


Open content in new tab

   Open content in new tab
Source: ACM Digital Library