Programming pearls

1984/09/01 by Jon Bentley · 1 citation
Computer Science · Biochemistry, Genetics and Molecular Biology · Engineering · #Algorithms and Data Compression #Advanced Database Systems and Queries #DNA and Biological Computing #Citation #Computer science #World Wide Web #Operations research #Engineering

paper · doi:10.1145/358234.381162

openalex publication_date 1984/09/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/05/17

Abstract

article Free Access Share on Programming pearls: algorithm design techniques Author: Jon Bentley AT&T Bell Laboratories, Room 2C-317, 600 Mountain Avenue, Murray Hill, NJ AT&T Bell Laboratories, Room 2C-317, 600 Mountain Avenue, Murray Hill, NJView Profile Authors Info & Claims Communications of the ACMVolume 27Issue 9Sept. 1984 pp 865–873https://doi.org/10.1145/358234.381162Published:01 September 1984Publication History 176citation6,729DownloadsMetricsTotal Citations176Total Downloads6,729Last 12 Months580Last 6 weeks197 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Citations

• The String-to-String Correction Problem
• Algorithm 97: Shortest path
• Closest-point problems
• On-line bin packing in linear time
• Gaussian elimination is not optimal
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• A lower bound for on-line bin packing
• A Method for the Construction of Minimum-Redundancy Codes
• Optimum binary search trees
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Compression of individual sequences via variable-rate coding

Cited by

• Maximum subarray problem [wikipedia]