Matters Computational

1. Bit wizardry
Jörg Arndt

2. Permutations and their operations
Jörg Arndt

3. Sorting and searching
Jörg Arndt

4. Data structures
Jörg Arndt

5. Conventions and considerations
Jörg Arndt

6. Combinations
Jörg Arndt

7. Compositions
Jörg Arndt

8. Subsets
Jörg Arndt

9. Mixed radix numbers
Jörg Arndt

10. Permutations
Jörg Arndt

11. Permutations with special properties
Jörg Arndt

12. k-permutations
Jörg Arndt

13. Multisets
Jörg Arndt

14. Gray codes for strings with restrictions
Jörg Arndt

15. Parentheses strings
Jörg Arndt

16. Integer partitions
Jörg Arndt

17. Set partitions
Jörg Arndt

18. Necklaces and Lyndon words
Jörg Arndt

19. Hadamard and conference matrices
Jörg Arndt

20. Searching paths in directed graphs
Jörg Arndt

21. The Fourier transform
Jörg Arndt

22. Convolution correlation and more FFT algorithms
Jörg Arndt

23. The Walsh transform and its relatives
Jörg Arndt

24. The Haar transform
Jörg Arndt

25. The Hartley transform
Jörg Arndt

26. Number theoretic transforms (NTTs)
Jörg Arndt

27. Fast wavelet transforms
Jörg Arndt

28. Fast multiplication and exponentiation
Jörg Arndt

29. Root extraction
Jörg Arndt

30. Iterations for the inversion of a function
Jörg Arndt

31. The AGM, elliptic integrals, and algorithms for computing π
Jörg Arndt

32. Logarithm and exponential function
Jörg Arndt

33. Computing the elementary functions with limited resources
Jörg Arndt

34. Numerical evaluation of power series
Jörg Arndt

35. Recurrences and Chebyshev polynomials
Jörg Arndt

36. Hypergeometric series
Jörg Arndt

37. Cyclotomic polynomials product forms and continued fractions
Jörg Arndt

38. Synthetic Iterations ‡
Jörg Arndt

39. Modular arithmetic and some number theory
Jörg Arndt

40. Binary polynomials
Jörg Arndt

41. Shift registers
Jörg Arndt

42. Binary finite fields: GF(2n)
Jörg Arndt

Avainsanat: Computer Science, Algorithm Analysis and Problem Complexity