The DOI matches its Crossref record.
Concrete Mathematics: A Foundation for Computer Science
Abstract
Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods ...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Planck 2018 results: X. Constraints on inflation
Planck Collaboration, Akrami, Y., Arroja, F., Ashdown, M., Aumont, J., Baccigalupi, C., Ballardini, M., Banday, A. J., Barreiro, R. B., Bartolo, N., et al. (2020) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201833887 · Cited by 2,442
Volume of the set of separable states
Życzkowski, K., Horodecki, P., Sanpera, A., & Lewenstein, M. (1998) · Physical Review A · doi:10.1103/physreva.58.883 · Cited by 1,410
An Introduction to Random Matrices
Anderson, G. W., Guionnet, A., & Zeitouni, O. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511801334 · Cited by 1,281
Planck 2013 results. XXII. Constraints on inflation
Planck Collaboration, Ade, P. A. R., Aghanim, N., Armitage-Caplan, C., Arnaud, M., Ashdown, M., Atrio-Barandela, F., Aumont, J., Baccigalupi, C., Banday, A. J., et al. (2014) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201321569 · Cited by 1,082
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
Complexity measures and decision tree complexity: a survey
Buhrman, H., & de Wolf, R. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00144-x · Cited by 665
On Distances in Uniformly Random Networks
Haenggi, M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855610 · Cited by 611
Mousavinasab, E., Zarifsanaiey, N., R. Niakan Kalhori, S., Rakhshan, M., Keikha, L., & Ghazi Saeedi, M. (2021) · Interactive Learning Environments · doi:10.1080/10494820.2018.1558257 · Cited by 605
Adaptive filters for continuous queries over distributed data streams
Olston, C., Jiang, J., & Widom, J. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872825 · Cited by 447
An Overview of the Transmission Capacity of Wireless Networks
Weber, S., Andrews, J. G., & Jindal, N. (2010) · IEEE Transactions on Communications · doi:10.1109/tcomm.2010.093010.090478 · Cited by 422
Kim, S., Gupta, N., & Pevzner, P. A. (2008) · Journal of Proteome Research · doi:10.1021/pr8001244 · Cited by 412
Efficient Detection of Network Motifs
Wernicke, S. (2006) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2006.51 · Cited by 402
Parriaux, A., Hammani, K., & Millot, G. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.382052 · Cited by 385
Critical behavior of colored tensor models in the large N limit
Bonzom, V., Gurau, R., Riello, A., & Rivasseau, V. (2011) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2011.07.022 · Cited by 384
Colored Tensor Models - a Review
Gurau, R. (2012) · Symmetry, Integrability and Geometry: Methods and Applications · doi:10.3842/sigma.2012.020 · Cited by 327
Thompson, S. E., Basu, N. B., Lascurain, J., Aubeneau, A., & Rao, P. S. C. (2011) · Water Resources Research · doi:10.1029/2010wr009605 · Cited by 324
Brent, R. P., & Zimmermann, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921698 · Cited by 321
Introducing global constraints in CHIP
Beldiceanu, N., & Contejean, E. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90127-9 · Cited by 315
Zhang, X., & Pandey, M. D. (2013) · Structural Safety · doi:10.1016/j.strusafe.2013.03.001 · Cited by 309
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Roffo, G., Melzi, S., & Cristani, M. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.478 · Cited by 290
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
Srinivasa, S., & Haenggi, M. (2010) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2035044 · Cited by 285
Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach
Roffo, G., Melzi, S., Castellani, U., & Vinciarelli, A. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.156 · Cited by 257
Techniques of Cluster Algorithms in Data Mining
Grabmeier, J., & Rudolph, A. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1016308404627 · Cited by 255
Successful classroom deployment of a social document annotation system
Zyto, S., Karger, D., Ackerman, M., & Mahajan, S. (2012) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/2207676.2208326 · Cited by 90
Local leaders in random networks
Blondel, V. D., Guillaume, J.-L., Hendrickx, J. M., de Kerchove, C., & Lambiotte, R. (2008) · Physical Review E · doi:10.1103/physreve.77.036114 · Cited by 69
Results on Maximally Flat Fractional-Delay Systems
Samadi, S., Ahmad, M. O., & Swamy, M. N. S. (2004) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2004.836848 · Cited by 51
Metadata
- Authors
- Graham, R. L., Knuth, D. E., Patashnik, O., & Liu, S.
- Venue
- Computers in Physics
- Publisher
- AIP Publishing
- Published
- 1989-09-01
- Volume
- 3
- Issue
- 5
- Pages
- 106-107
- ISSN
- 0894-1866 (ISSN-L)
- OpenAlex
- W2029948740
- Cited by
- 2,407
- References
- 0
- FWCI
- 16.44
- 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
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.