The art of computer programming: V.2.: Seminumerica algorithms
Explore this paper's citation graph
Summary
This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read.
- Published
- 1997-01-01
- Cited by
- 2,070
- References
- 0
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:59794703
References
No references recorded for this paper.
Cited by
- Bounding Smooth Integers
- Modern Climatology - Full Text
- Applied batch cryptography
- Naming and its Regularities in Distributed Environments
- GENERATING NON-UNIFORM RANDOM DEVIATES
- Code Generation for the Beehive ISA
- Two-Step Shortlisting by Imperfect Experts
- Some facets of complexity theory and cryptography: A five-lecture tutorial
- Computational perspectives on Bell Inequalities and many-body quantum correlations
- Automated statistical methods for measuring the strength of block ciphers
- Random Number Generation Using a Biased Source
- Predicting end-to-end network characteristics on mobile devices
- The accurary of Mathematica 4 as a statistical package
- Large multipliers with less DSP blocks
- Concept development in novice programmers learning Java
- Implementations of Montgomery Multiplication Algorithms in Machine Languages
- Probabilistic Instruction Execution: The MAYBE Predicate
- Reliable and High-Performance Hardware Architectures for the Advanced Encryption Standard/Galois Counter Mode
- Applications of the collision test to produce results consistent with the spectral test
- Elliptic curve cryptography algorithms resistant against power analysis attacks on resource constrained devices. (Algorithmes cryptographiques à base de courbes elliptiques résistant aux attaques par analyse de consommation)
Related papers
No related papers recorded.