Computer Science and Its Relation to Mathematics
DOI10.2307/2318994zbMATH Open0279.68001OpenAlexW4249991923WikidataQ56041414 ScholiaQ56041414MaRDI QIDQ4765995FDOQ4765995
Authors: Donald E. Knuth
Publication date: 1974
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2318994
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Cited In (9)
- There is no fast single hashing algorithm
- Linear open addressing and Peterson's theorem rehashed
- Some quotients of the modular group
- The algorithms of Euclid and Jacobi†
- Mathematical analysis of some methods for amicable numbers
- When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
- Deviation results for sparse tables in hashing with linear probing
- A conditional Berry-Esseen inequality
- A Euclidean Algorithm for Integer Matrices
This page was built for publication: Computer Science and Its Relation to Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4765995)