The Fourier transform. The discrete Fourier transform (DFT). Radix 2 FFT algorithms. Decimation in time (DIT) FFT. Decimation in frequency (DIF) FFT. Using higher radix algorithms. Higher radix DIT and DIF algorithms. Split radix Fourier transforms (SRFT). Multidimensional FTs. The matrix Fourier algorithm (MFA). Eigenvectors of the Fourier transform. Convolutions. Weighted Fourier transforms. The z-transform (ZT). The Hartley transform (HT). Radix 2 FHT algorithms. Discrete cosine transform (DCT) by HT. Discrete sine transform (DST) by DCT. Number theoretic transforms (NTTs). The Chinese Remainder Theorem (CRT). The Reed-Muller transform (RMT). Permutations. The radix permutation. In-place matrix transposition. Revbin permutation vs. transposition. The zip permutation. The reversed zip-permutation. The XOR permutation. The Gray code permutation. The reversed Gray code permutation. The green code permutation. The reversed green code permutation. Factorizing permutations. General permutations. Trivia. Hilbert’s space-filling curve. Searching. Index sorting. Pointer sorting. Sorting by a supplied comparison function. Unique. Heap-sort. Data structures. Stack (LIFO). Ring buffer. Queue (FIFO). Deque (double-ended queue). Heap and priority queue. Bit-array. Resizable array. Ordered resizable array. Resizable set. Selected combinatorial algorithms. Combinations in lexicographic order. Combinations in co-lexicographic order. Combinations in minimal-change order. Combinations in alternative minimal-change order. Offline functions: funcemu. Parenthesis. Partitions. Compositions. Compositions in lexicographic order. Compositions from combinations. Compositions in minimal-change order. Numbers in lexicographic order. Subsets in lexicographic order. Subsets in minimal-change order. Subsets ordered by number of elements. Subsets ordered with shift register sequences/ Shift register sequences. Feedback carry shift register (FCSR). Linear hybrid cellular automata (LHCA). Necklaces. Division. Square root extraction. Cube root extraction. Iterations for the inverse n-th root. Re-orthogonalization of matrices. Goldschmidt’s algorithm. Householder’s formula. The AGM. Elliptic K. Elliptic E. Chebyshev polynomials and recurrences. Continued fractions. Hypergeometric functions. CORDIC algorithms.
Sign up or login using form at top of the page to download this file.
Kenneth A. Berman, Jerome L. Paul, Course Technology, 2005, pages: 996 Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers,...
The MIT Press, 2009. - 1312 p. 3rd edition. ISBN13: 978-0262033848 Solutions for a select set of exercises and problems for Introduction to Algorithms, Third Edition . Selected Solutions for Chapter 2: Getting Started Selected Solutions for Chapter 3: Growth of Functions Selected Solutions for Chapter 4: Divide-and-Conquer Selected Solutions for Chapter 5: Probabilistic...
MIT Press, 2016. — 802 p. A comprehensive introduction to neural networks and deep learning by leading researchers of this field. Written for two main target audiences: university students (undergraduate or graduate) learning about machine learning, and software engineers. This is a PDF compilation of online book (www.deeplearningbook.org) Who Should Read This Book? Historical...
Cambridge University Press, 2007. — 1262 p. William H. Press - Raymer Chair in Computer Sciences and Integrative Biology The University of Texas at Austin. Saul A. Teukolsky - Hans A. Bethe Professor of Physics and Astrophysics Cornell University. William T. Vetterling - Research Fellow and Director of Image Science ZINK Imaging, LLC. Brian P. Flannery - Science, Strategy and...
Pearson Education, Inc., 2013. – 592 p. – ISBN: 032190575X, 9780321905758. – 2nd edition. "[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways." —From the Foreword by Donald E. Knuth Despite growing interest, basic information on...
4th Edition. — Addison-Wesley, 2011. — 969 p. — ISBN 032157351X. Essential Information about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph...