Minimal perfect hash functions for reserved word lists

Robert W. Sebasta, Mark A. Taylor · ACM SIGPLAN Notices · 1985

article Minimal perfect hash functions for reserved word lists Share on Authors: Robert W. Sebasta Department of Computer Science, University of Colorado, Austin Bluffs Parkway, Colorado Springs, CO Department of Computer Science, University of Colorado, Austin Bluffs Parkway, Colorado Springs, COView Profile , Mark A. Taylor Department of Computer Science, University of Colorado, Austin Bluffs Parkway, Colorado Springs, CO Department of Computer Science, University of Colorado, Austin Bluffs Parkway, Colorado Springs, COView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 20Issue 12Dec. 1985 pp 47–53https://doi.org/10.1145/382086.382626Online:01 December 1985Publication History 1citation272DownloadsMetricsTotal Citations1Total Downloads272Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Read the paper · More papers on PaperTik