-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Make headings direct to heading permalinks
- Loading branch information
Showing
2 changed files
with
40 additions
and
40 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,51 +1,51 @@ | ||
| /blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/ | ||
| /blog/technical-analysis/index.{html} /blog/technical-analysis/ | ||
| /blog/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/ | ||
| /blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/ | ||
| /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/index.{html} /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/ | ||
| /blog/p-vs-np/index.{html} /blog/p-vs-np/ | ||
| /blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/ | ||
| /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/index.{html} /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/ | ||
| /blog/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/ | ||
| /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/index.{html} /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/ | ||
| /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/ | ||
| /blog/what-is-the-stock-market/index.{html} /blog/what-is-the-stock-market/ | ||
| /blog/derivatives-options/index.{html} /blog/derivatives-options/ | ||
| /blog/dna-sequencing/index.{html} /blog/dna-sequencing/ | ||
| /blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/ | ||
| /blog/flynn-s-taxonomy/index.{html} /blog/flynn-s-taxonomy/ | ||
| /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/index.{html} /blog/master-s-theorem-strassen-s-matrix-multiplication-kth-order-statistics/ | ||
| /blog/profiling-a-program/index.{html} /blog/profiling-a-program/ | ||
| /blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/ | ||
| /blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/ | ||
| /blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/ | ||
| /blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/ | ||
| /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/index.{html} /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/ | ||
| /blog/stock-multiples/index.{html} /blog/stock-multiples/ | ||
| /blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/ | ||
| /blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/ | ||
| /blog/dna-sequencing/index.{html} /blog/dna-sequencing/ | ||
| /blog/knapsack-using-branch-and-bounding/index.{html} /blog/knapsack-using-branch-and-bounding/ | ||
| /blog/p-vs-np/index.{html} /blog/p-vs-np/ | ||
| /blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/ | ||
| /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/ | ||
| /blog/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/ | ||
| /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/index.{html} /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/ | ||
| /blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/ | ||
| /index.html / | ||
| /blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/ | ||
| /blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/ | ||
| /blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/ | ||
| /blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/ | ||
| /blog/vectorization-analyzing-loop-dependencies/index.{html} /blog/vectorization-analyzing-loop-dependencies/ | ||
| /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/index.{html} /blog/wilson-s-theorem-fermat-s-little-theorem-euler-s-totient-function/ | ||
| /blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/ | ||
| /blog/profiling-a-program/index.{html} /blog/profiling-a-program/ | ||
| /blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/ | ||
| /blog/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/ | ||
| /interests/index.{html} /interests/ | ||
| /blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/ | ||
| /blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/ | ||
| /blog/derivatives-options/index.{html} /blog/derivatives-options/ | ||
| /blog/extended-euclidean-algorithm/index.{html} /blog/extended-euclidean-algorithm/ | ||
| /blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/ | ||
| /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/index.{html} /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/ | ||
| /blog/stock-multiples/index.{html} /blog/stock-multiples/ | ||
| /blog/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/ | ||
| /blog/vectorization-analyzing-loop-dependencies/index.{html} /blog/vectorization-analyzing-loop-dependencies/ | ||
| /blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/ | ||
| /blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/ | ||
| /blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/ | ||
| /blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/ | ||
| /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/index.{html} /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/ | ||
| /blog/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/ | ||
| /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/index.{html} /blog/how-to-analyze-algorithms-proving-a-lower-bound-for-comparison-based-sorting/ | ||
| /blog/new-and-delete/index.{html} /blog/new-and-delete/ | ||
| /blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/ | ||
| /blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/ | ||
| /blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/ | ||
| /blog/complexity-theory-reductions/index.{html} /blog/complexity-theory-reductions/ | ||
| /blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/ | ||
| /blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/ | ||
| /blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/ | ||
| /blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/ | ||
| /blog/smart-pointers/index.{html} /blog/smart-pointers/ | ||
| /blog/network-flow-algorithms-ford-fulkerson/index.{html} /blog/network-flow-algorithms-ford-fulkerson/ | ||
| /blog/new-and-delete/index.{html} /blog/new-and-delete/ | ||
| /blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/ | ||
| /blog/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/ | ||
| /blog/activity-selection-huffman-encoding/index.{html} /blog/activity-selection-huffman-encoding/ | ||
| /blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/ | ||
| /blog/technical-analysis/index.{html} /blog/technical-analysis/ | ||
| /blog/church-turing-hypothesis/index.{html} /blog/church-turing-hypothesis/ | ||
| /blog/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/ | ||
| /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/index.{html} /blog/mega-project-kblas-writing-a-benchmark-library-in-c-optimizing-l1-l2-basic-linear-algebra-subprograms/ | ||
| /blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/ | ||
| /blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/ | ||
| /blog/smart-pointers/index.{html} /blog/smart-pointers/ | ||
| /blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/ | ||
| /blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/ | ||
| /blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/ | ||
| /blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/ | ||
| /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/index.{html} /blog/dp-as-dags-shortest-path-on-dags-lis-in-o-nlogn/ |