Fixed robots.txt

Author: akcube

hugo.toml

@@ -1,6 +1,7 @@
 baseURL = 'https://akcube.github.io/'
 languageCode = 'en-us'
 title = 'Kishore Kumar'
+enableRobotsTXT = true
 theme = 'obsidian-hugo-texify3'
 
 [author]

static/linkmap

@@ -1,53 +1,53 @@
-/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/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/
+/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/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/more-greedy-algorithms-kruskal-s-disjoint-set-union/index.{html} /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/
+/index.html /
 /blog/profiling-a-program/index.{html} /blog/profiling-a-program/
-/blog/a-c-programmer-s-guide-to-c/index.{html} /blog/a-c-programmer-s-guide-to-c/
-/blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/
+/blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/
+/blog/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/
+/blog/extended-euclidean-algorithm/index.{html} /blog/extended-euclidean-algorithm/
+/blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/
+/blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/
+/blog/booyer-moore-knuth-morris-pratt-for-exact-matching/index.{html} /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/
+/blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/
+/blog/smart-pointers/index.{html} /blog/smart-pointers/
+/blog/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/
+/blog/flynn-s-taxonomy/index.{html} /blog/flynn-s-taxonomy/
 /blog/how-the-economic-machine-works-by-ray-dalio/index.{html} /blog/how-the-economic-machine-works-by-ray-dalio/
-/blog/p-vs-np/index.{html} /blog/p-vs-np/
+/blog/brent-s-theorem-task-level-parallelism/index.{html} /blog/brent-s-theorem-task-level-parallelism/
+/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/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/
+/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/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/
+/blog/new-and-delete/index.{html} /blog/new-and-delete/
+/blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/
+/interests/index.{html} /interests/
+/blog/activity-selection-huffman-encoding/index.{html} /blog/activity-selection-huffman-encoding/
+/blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/
+/blog/derivatives-options/index.{html} /blog/derivatives-options/
 /blog/riemann-series-rearrangement/index.{html} /blog/riemann-series-rearrangement/
-/index.html /
-/blog/flynn-s-taxonomy/index.{html} /blog/flynn-s-taxonomy/
+/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/complexity-theory-reductions/index.{html} /blog/complexity-theory-reductions/
+/blog/network-flow-algorithms-ford-fulkerson/index.{html} /blog/network-flow-algorithms-ford-fulkerson/
+/blog/a-c-programmer-s-guide-to-c/index.{html} /blog/a-c-programmer-s-guide-to-c/
 /blog/technical-analysis/index.{html} /blog/technical-analysis/
+/blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/
+/blog/stock-multiples/index.{html} /blog/stock-multiples/
+/blog/dna-sequencing/index.{html} /blog/dna-sequencing/
+/blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/
+/blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/index.{html} /blog/shortest-reliable-path-floyd-warshall-max-independent-set-tree/
+/blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/
 /blog/vectorization-analyzing-loop-dependencies/index.{html} /blog/vectorization-analyzing-loop-dependencies/
-/blog/derivatives-options/index.{html} /blog/derivatives-options/
-/blog/finite-and-infinite-sums/index.{html} /blog/finite-and-infinite-sums/
 /blog/knapsack-using-branch-and-bounding/index.{html} /blog/knapsack-using-branch-and-bounding/
-/blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/
-/blog/stock-multiples/index.{html} /blog/stock-multiples/
+/blog/what-is-the-stock-market/index.{html} /blog/what-is-the-stock-market/
 /blog/are-there-computational-problems-that-computers-cannot-solve/index.{html} /blog/are-there-computational-problems-that-computers-cannot-solve/
 /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/chain-matrix-multiplication/index.{html} /blog/chain-matrix-multiplication/
-/blog/de-novo-assembly-overlap-graphs/index.{html} /blog/de-novo-assembly-overlap-graphs/
-/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/p-vs-np/index.{html} /blog/p-vs-np/
 /blog/church-turing-hypothesis/index.{html} /blog/church-turing-hypothesis/
+/blog/covered-calls-strategy/index.{html} /blog/covered-calls-strategy/
 /blog/getting-rid-of-short-form-content/index.{html} /blog/getting-rid-of-short-form-content/
-/blog/smart-pointers/index.{html} /blog/smart-pointers/
 /blog/parallelism-with-omp/index.{html} /blog/parallelism-with-omp/
-/blog/set-cover-approximation-algorithms/index.{html} /blog/set-cover-approximation-algorithms/
-/blog/the-black-scholes-merton-equation/index.{html} /blog/the-black-scholes-merton-equation/
-/blog/network-flow-algorithms-ford-fulkerson/index.{html} /blog/network-flow-algorithms-ford-fulkerson/
-/blog/randomization-primality-testing-algorithms/index.{html} /blog/randomization-primality-testing-algorithms/
-/blog/shortest-common-superstring-de-brujin-graphs/index.{html} /blog/shortest-common-superstring-de-brujin-graphs/
-/blog/dna-sequencing/index.{html} /blog/dna-sequencing/
-/blog/defining-computational-problems/index.{html} /blog/defining-computational-problems/
-/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/the-fast-fourier-transform-fft/index.{html} /blog/the-fast-fourier-transform-fft/
-/blog/theoretical-metrics-for-benchmarking/index.{html} /blog/theoretical-metrics-for-benchmarking/
-/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/more-greedy-algorithms-kruskal-s-disjoint-set-union/index.{html} /blog/more-greedy-algorithms-kruskal-s-disjoint-set-union/
-/blog/public-key-cryptography-coming-up-with-rsa/index.{html} /blog/public-key-cryptography-coming-up-with-rsa/
-/blog/a-deep-dive-into-the-knapsack-problem/index.{html} /blog/a-deep-dive-into-the-knapsack-problem/
-/blog/booyer-moore-knuth-morris-pratt-for-exact-matching/index.{html} /blog/booyer-moore-knuth-morris-pratt-for-exact-matching/
-/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/extended-euclidean-algorithm/index.{html} /blog/extended-euclidean-algorithm/
-/blog/introduction-to-complexity-theory/index.{html} /blog/introduction-to-complexity-theory/
-/blog/levenshtein-edit-distance/index.{html} /blog/levenshtein-edit-distance/
-/blog/new-and-delete/index.{html} /blog/new-and-delete/
-/blog/activity-selection-huffman-encoding/index.{html} /blog/activity-selection-huffman-encoding/
+/blog/algorithms-for-approximate-string-matching-alignment/index.{html} /blog/algorithms-for-approximate-string-matching-alignment/
 /blog/amdahl-s-law-gustafson-s-law/index.{html} /blog/amdahl-s-law-gustafson-s-law/
-/blog/analyzing-fibonacci-karatsuba-multiplication/index.{html} /blog/analyzing-fibonacci-karatsuba-multiplication/
-/blog/the-economics-of-foreign-exchange-forex/index.{html} /blog/the-economics-of-foreign-exchange-forex/
-/blog/what-is-the-stock-market/index.{html} /blog/what-is-the-stock-market/
-/interests/index.{html} /interests/