The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Programming pearls: algorithm design techniques
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
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
On-line bin packing in linear time
Ramanan, P., Brown, D. J., Lee, C. C., & Lee, D. T. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90031-x · Cited by 127
Cited by
Efficient grasping from RGBD images: Learning using a new rectangle representation
Jiang, Y., Moseson, S., & Saxena, A. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980145 · Cited by 657
A morphological algorithm for improving radio-frequency interference detection
Offringa, A. R., van de Gronde, J. J., & Roerdink, J. B. T. M. (2012) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201118497 · Cited by 385
Multi-region Two-Stream R-CNN for Action Detection
Peng, X., & Schmid, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46493-0_45 · Cited by 354
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233313 · Cited by 265
Detecting Identity by Descent and Estimating Genotype Error Rates in Sequence Data
Browning, B. L., & Browning, S. R. (2013) · The American Journal of Human Genetics · doi:10.1016/j.ajhg.2013.09.014 · Cited by 187
Metadata
- Authors
- Bentley, J.
- Venue
- Communications of the ACM
- Published
- 1984-09
- Volume
- 27
- Issue
- 9
- Pages
- 865-873
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2060164640
- Cited by
- 242
- References
- 3
- FWCI
- 2.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Programming pearls: algorithm design techniques. https://app.cochat.ai/papers/10.1145/358234.381162
- The paper
- Bentley, J. (1984). Programming pearls: algorithm design techniques. Communications of the ACM. https://doi.org/10.1145/358234.381162
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.