The DOI matches its Crossref record.
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Explaining prediction models and individual predictions with feature contributions
Štrumbelj, E., & Kononenko, I. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-013-0679-x · Cited by 2,286
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
A class of rank test procedures for censored survival data
HARRINGTON, D. P., & FLEMING, T. R. (1982) · Biometrika · doi:10.1093/biomet/69.3.553 · Cited by 1,184
Handbook of Monte Carlo Methods
Kroese, D. P., Taimre, T., & Botev, Z. I. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9781118014967 · Cited by 1,104
Agent-based computational models and generative social science
Epstein, J. M. (1999) · Complexity · doi:10.1002/(sici)1099-0526(199905/06)4:5<41::aid-cplx9>3.0.co;2-f · Cited by 1,103
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Fast physical random bit generation with chaotic semiconductor lasers
Uchida, A., Amano, K., Inoue, M., Hirano, K., Naito, S., Someya, H., Oowada, I., Kurashige, T., Shiki, M., Yoshimori, S., et al. (2008) · Nature Photonics · doi:10.1038/nphoton.2008.227 · Cited by 1,024
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
Evaluating Kolmogorov's Distribution
Marsaglia, G., Tsang, W. W., & Wang, J. (2003) · Journal of Statistical Software · doi:10.18637/jss.v008.i18 · Cited by 979
Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems
Coron, J.-S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_25 · Cited by 965
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks
Liu, A., & Ning, P. (2008) · 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008) · doi:10.1109/ipsn.2008.47 · Cited by 924
Quick Shift and Kernel Methods for Mode Seeking
Vedaldi, A., & Soatto, S. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88693-8_52 · Cited by 890
Algorithmic Self-Assembly of DNA Sierpinski Triangles
Rothemund, P. W. K., Papadakis, N., & Winfree, E. (2004) · PLoS Biology · doi:10.1371/journal.pbio.0020424 · Cited by 860
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Quantum networks for elementary arithmetic operations
Vedral, V., Barenco, A., & Ekert, A. (1996) · Physical Review A · doi:10.1103/physreva.54.147 · Cited by 806
McCarthy, M. A. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511802454 · Cited by 756
Barrett, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_24 · Cited by 753
A Method for Simulating Non-Normal Distributions
Fleishman, A. I. (1978) · Psychometrika · doi:10.1007/bf02293811 · Cited by 713
Cryptanalysis of short RSA secret exponents
Wiener, M. J. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.54902 · Cited by 698
zt: A Software Tool for Simple and Partial Mantel Tests
Bonnet, E., & Van de Peer, Y. (2002) · Journal of Statistical Software · doi:10.18637/jss.v007.i10 · Cited by 696
A chronology of interpolation: from ancient astronomy to modern signal and image processing
Meijering, E. (2002) · Proceedings of the IEEE · doi:10.1109/5.993400 · Cited by 662
Fault Injection Attacks on Cryptographic Devices: Theory, Practice, and Countermeasures
Barenghi, A., Breveglieri, L., Koren, I., & Naccache, D. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2188769 · Cited by 609
When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
Sloan, I. H., & Woźniakowski, H. (1998) · Journal of Complexity · doi:10.1006/jcom.1997.0463 · Cited by 606
The Weil Pairing, and Its Efficient Calculation
Miller, V. S. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0315-8 · Cited by 578
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Risks and decisions for conservation and environmental management
(2005) · Choice Reviews Online · doi:10.5860/choice.43-2184 · Cited by 523
The Yeast Protein Interaction Network Evolves Rapidly and Contains Few Redundant Duplicate Genes
Wagner, A. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003913 · Cited by 521
Chaotic sequences to improve the performance of evolutionary algorithms
Caponetto, R., Fortuna, L., Fazzino, S., & Xibilia, M. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810069 · Cited by 519
Mobile-Phone Dispatch of Laypersons for CPR in Out-of-Hospital Cardiac Arrest
Ringh, M., Rosenqvist, M., Hollenberg, J., Jonsson, M., Fredman, D., Nordberg, P., Järnbert-Pettersson, H., Hasselqvist-Ax, I., Riva, G., & Svensson, L. (2015) · New England Journal of Medicine · doi:10.1056/nejmoa1406038 · Cited by 515
Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., & Wang, Y. (2014) · High-Performance Computing on the Intel® Xeon Phi™ · doi:10.1007/978-3-319-06486-4_7 · Cited by 506
Statistical approaches to DDoS attack detection and response
Feinstein, L., Schnackenberg, D., Balupari, R., & Kindred, D. (2004) · Proceedings DARPA Information Survivability Conference and Exposition · doi:10.1109/discex.2003.1194894 · Cited by 504
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
Efficient and portable combined random number generators
L'Ecuyer, P. (1988) · Communications of the ACM · doi:10.1145/62959.62969 · Cited by 494
Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
L'Ecuyer, P. (1999) · Operations Research · doi:10.1287/opre.47.1.159 · Cited by 460
An algebraic approach to IP traceback
Dean, D., Franklin, M., & Stubblefield, A. (2002) · ACM Transactions on Information and System Security · doi:10.1145/505586.505588 · Cited by 447
Quantum random number generation
Ma, X., Yuan, X., Cao, Z., Qi, B., & Zhang, Z. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.21 · Cited by 445
A fast Fourier transform compiler
Frigo, M. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301661 · Cited by 438
ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
LI, S., CHEN, G., & MOU, X. (2005) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127405014052 · Cited by 433
Software Implementation of Elliptic Curve Cryptography over Binary Fields
Hankerson, D., López Hernandez, J., & Menezes, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44499-8_1 · Cited by 423
Elliptic curves and primality proving
Atkin, A. O. L., & Morain, F. (1993) · Mathematics of Computation · doi:10.1090/s0025-5718-1993-1199989-x · Cited by 399
Ogita, T., Rump, S. M., & Oishi, S. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030601818 · Cited by 386
Polynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385
A brief history of cellular automata
Sarkar, P. (2000) · ACM Computing Surveys · doi:10.1145/349194.349202 · Cited by 384
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
A New Class of Random Number Generators
Marsaglia, G., & Zaman, A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005878 · Cited by 370
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
An Object-Oriented Random-Number Package with Many Long Streams and Substreams
L'Ecuyer, P., Simard, R., Chen, E. J., & Kelton, W. D. (2002) · Operations Research · doi:10.1287/opre.50.6.1073.358 · Cited by 347
An approximate Fourier transform useful in quantum factoring
Coppersmith, D. (2002) · arXiv · doi:10.48550/arxiv.quant-ph/0201067 · Cited by 343
Digital Synthesis of Plucked-String and Drum Timbres
Karplus, K., & Strong, A. (1983) · Computer Music Journal · doi:10.2307/3680062 · Cited by 337
Brent, R. P., & Zimmermann, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921698 · Cited by 321
Henderson, A. R. (2005) · Clinica Chimica Acta · doi:10.1016/j.cccn.2005.04.002 · Cited by 319
A new algorithm for factoring polynomials over finite fields
Cantor, D. G., & Zassenhaus, H. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0606517-5 · Cited by 306
Pod‐Specific Demography of Killer Whales (Orcinus Orca)
Brault, S., & Caswell, H. (1993) · Ecology · doi:10.2307/1940073 · Cited by 289
Lenstra, A. K., Lenstra, H. W., Manasse, M. S., & Pollard, J. M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100295 · Cited by 285
Private predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283
Improved long-period generators based on linear recurrences modulo 2
Panneton, F., L'Ecuyer, P., & Matsumoto, M. (2006) · ACM Transactions on Mathematical Software · doi:10.1145/1132973.1132974 · Cited by 283
Investigation of terpene diversification across multiple sequenced plant genomes
Boutanaev, A. M., Moses, T., Zi, J., Nelson, D. R., Mugford, S. T., Peters, R. J., & Osbourn, A. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1419547112 · Cited by 283
L'Ecuyer, P. (1990) · Communications of the ACM · doi:10.1145/84537.84555 · Cited by 282
Flajolet, P., & Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_34 · Cited by 274
Post-Quantum Lattice-Based Cryptography Implementations: A Survey
Nejatollahi, H., Dutt, N., Ray, S., Regazzoni, F., Banerjee, I., & Cammarota, R. (2019) · ACM Computing Surveys · doi:10.1145/3292548 · Cited by 277
Verification methods: Rigorous results using floating-point arithmetic
Rump, S. M. (2010) · Acta Numerica · doi:10.1017/s096249291000005x · Cited by 276
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
Mascagni, M., & Srinivasan, A. (2000) · ACM Transactions on Mathematical Software · doi:10.1145/358407.358427 · Cited by 275
Schmitz, C., & Hof, P. R. (2000) · Journal of Chemical Neuroanatomy · doi:10.1016/s0891-0618(00)00066-1 · Cited by 272
Cluster Algorithms for General-SQuantum Spin Systems
Todo, S., & Kato, K. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.047203 · Cited by 270
Number theoretic transforms to implement fast digital convolution
Agarwal, R. C., & Burrus, C. S. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9791 · Cited by 269
Maximally equidistributed combined Tausworthe generators
L’Ecuyer, P. (1996) · Mathematics of Computation · doi:10.1090/s0025-5718-96-00696-5 · Cited by 267
Montgomery Multiplication in GF(2k)
Koc, C. K., & Acar, T. (1998) · Designs, Codes and Cryptography · doi:10.1023/a:1008208521515 · Cited by 266
Feedback shift registers, 2-adic span, and combiners with memory
Klapper, A., & Goresky, M. (1997) · Journal of Cryptology · doi:10.1007/s001459900024 · Cited by 264
More Flexible Exponentiation with Precomputation
Lim, C. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_11 · Cited by 264
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
Har-Peled, S., & Mendel, M. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704446281 · Cited by 263
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906067174 · Cited by 260
Software Implementation of the NIST Elliptic Curves Over Prime Fields
Brown, M., Hankerson, D., López, J., & Menezes, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_19 · Cited by 258
Evolution of parallel cellular machines: The cellular programming approach
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)90209-1 · Cited by 257
Recent Advances in Randomized Quasi-Monte Carlo Methods
L’Ecuyer, P., & Lemieux, C. (2002) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48102-2_20 · Cited by 254
Discrete chaotic cryptography using external key
Pareek, N. K., Patidar, V., & Sud, K. K. (2003) · Physics Letters A · doi:10.1016/s0375-9601(03)00122-1 · Cited by 252
Logistic map: A possible random-number generator
Phatak, S. C., & Rao, S. S. (1995) · Physical Review E · doi:10.1103/physreve.51.3670 · Cited by 233
Parallel random numbers: as easy as 1, 2, 3
Salmon, J. K., Moraes, M. A., Dror, R. O., & Shaw, D. E. (2011) · Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/2063384.2063405 · Cited by 227
Privacy-preserving distributed linear regression on high-dimensional data
Gascón, A., Schoppmann, P., Balle, B., Raykova, M., Doerner, J., Zahur, S., & Evans, D. (2017) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0053 · Cited by 193
Factoring integers with the number field sieve
Buhler, J. P., Lenstra, H. W., & Pomerance, C. (1993) · Lecture Notes in Mathematics · doi:10.1007/bfb0091539 · Cited by 188
Fast quantum modular exponentiation
Van Meter, R., & Itoh, K. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052320 · Cited by 181
2D axial-azimuthal particle-in-cell benchmark for low-temperature partially magnetized plasmas
Charoy, T., Boeuf, J. P., Bourdon, A., Carlsson, J. A., Chabert, P., Cuenot, B., Eremin, D., Garrigues, L., Hara, K., Kaganovich, I. D., et al. (2019) · Plasma Sources Science and Technology · doi:10.1088/1361-6595/ab46c5 · Cited by 153
Matrices and the structure of random number sequences
Marsaglia, G., & Tsay, L.-H. (1985) · Linear Algebra and its Applications · doi:10.1016/0024-3795(85)90192-2 · Cited by 118
Boosting Privately: Federated Extreme Gradient Boosting for Mobile Crowdsensing
Liu, Y., Ma, Z., Liu, X., Ma, S., Nepal, S., Deng, R. H., & Ren, K. (2020) · 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs47774.2020.00017 · Cited by 93
The thermodynamic efficiency of computations made in cells across the range of life
Kempes, C. P., Wolpert, D., Cohen, Z., & Pérez-Mercader, J. (2017) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2016.0343 · Cited by 68
Boosting Privately: Privacy-Preserving Federated Extreme Boosting for Mobile Crowdsensing
Liu, Y., Ma, Z., Liu, X., Ma, S., Nepal, S., & Deng, R. (2019) · arXiv · doi:10.48550/arxiv.1907.10218 · Cited by 52
An Accurate Evaluation of Maurer’s Universal Test
Coron, J. S., & Naccache, D. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48892-8_5 · Cited by 47
A modified Luria-Delbrück fluctuation assay for estimating and comparing mutation rates
Crane, G. J., Thomas, S. M., & Jones, M. E. (1996) · Mutation Research - Fundamental and Molecular Mechanisms of Mutagenesis · doi:10.1016/0027-5107(96)00009-7 · Cited by 42
Informational laws of genome structures
Bonnici, V., & Manca, V. (2016) · Scientific Reports · doi:10.1038/srep28840 · Cited by 38
Close-Point Spatial Tests and Their Application to Random Number Generators
L'Écuyer, P., Cordeau, J.-F., & Simard, R. (2000) · Operations Research · doi:10.1287/opre.48.2.308.12385 · Cited by 38
On the Security of Random Sources
Coron, J. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49162-7_3 · Cited by 37
Program Characterization Using Runtime Values and Its Application to Software Plagiarism Detection
Jhi, Y.-C., Jia, X., Wang, X., Zhu, S., Liu, P., & Wu, D. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2015.2418777 · Cited by 35
Trotta, E. (2016) · BMC Genomics · doi:10.1186/s12864-016-2692-4 · Cited by 31
Metadata
- Authors
- Taussky, O., & Knuth, D. E.
- Venue
- The American Mathematical Monthly
- Publisher
- JSTOR
- Published
- 1970-10
- Volume
- 77
- Issue
- 8
- Pages
- 900
- ISSN
- 0002-9890 (ISSN-L)
- OpenAlex
- W1981663184
- Cited by
- 3,822
- References
- 0
- FWCI
- 15.71
- 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.