Automatic label collector for TI-2

You cannot simply open this page with a browser from your file system. Instead, you have to host it on an http server with CORS enabled running in the course main directory, for example 
        TI-1 $ http-server .  --cors
and then open http://localhost:8080/javascript/put-all-in-one-page.html in your browser.
  1. Einführung
    1. Klassische parallele Algorithmen
      1. Beispiele: Summen bilden, Minimum berechnen
      2. Binäraddierer mit Carry Look-Ahead
      3. Präfixsummen parallel berechnen
      4. Listenpräfix
      5. Maschinenmodell für parallele Algorithmen: die PRAM
      6. Listenpräfix in O(log⁡n) Zeit und O(n) Arbeit
      7. Probabilistisches Zwischenspiel: Chernoff Bounds
    2. Paralleles Sortieren
      1. Sortiernetzwerke
      2. Paralleles Mergesort mit naivem Merge
      3. Valiants O(log⁡log⁡n)-Merge (und warum es nicht ganz korrekt ist)
      4. Coles paralleler Mergesort-Algorithmus
      5. PRAMs: Varianten und Simulationen
    3. Parallele Algorithmen für Graphen
      1. Zusammenhangskomponenten
      2. Erreichbarkeit in gerichteten Graphen
      3. Sequentielle Algorithmen für Erreichbarkeit
      4. Matrizen: Invertieren und Determinanten berechnen
      5. Perfekte Matchings in bipartiten Graphen
    4. Komplexitätsklassen für paralleles Rechnen
      1. P, NP und Erfüllbarkeit
      2. Logarithmischer Speicherplatz: LogSpace
      3. LogSpace und paralleles Rechnen
    5. Massiv parallele Algorithmen
      1. Broadcast, Summen, Präfixsummen
      2. Sortieren
      3. Der Algorithmus von Goodrich, Sitchinava und Zhang
      4. MPC: Relationen und Funktionen auswerten
      5. MPC-Graphenalgorithmen: Zusammenhangskomponenten
    6. Big Data und Streaming-Algorithmen
      1. Verschiedene Elemente in einem Datenstrom zählen
      2. Modulare Arithmetik und Primzahlen
    loading iframe completed 
    globalLabelsCollection
 = {
  "exercise-crew-on-erew": {
    "filename": "02-07-Pram-Models-Simulations.html",
    "labelTitle": "Übungsaufgabe",
    "indexString": "3.5.2"
  },
  "exercise-max-in-O(1)": {
    "filename": "02-07-Pram-Models-Simulations.html",
    "labelTitle": "Übungsaufgabe",
    "indexString": "3.5.6"
  },
  "theorem-max-in-O(1)": {
    "filename": "02-07-Pram-Models-Simulations.html",
    "labelTitle": "Theoren",
    "indexString": "3.5.1"
  },
  "problem-find-max": {
    "filename": "02-07-Pram-Models-Simulations.html",
    "labelTitle": "Problem\n                                ",
    "indexString": "3.5.2"
  },
  "problem-multiple-max": {
    "filename": "02-07-Pram-Models-Simulations.html",
    "labelTitle": "Problem\n                                ",
    "indexString": "3.5.3"
  },
  "problem-s-t-reachability": {
    "filename": "02-09-d-Reachability.html",
    "labelTitle": "Problem",
    "indexString": "4.2.1"
  },
  "theorem-dfs": {
    "filename": "02-09-e-Reachability-Sequential.html",
    "labelTitle": "Theorem",
    "indexString": "4.3.2"
  },
  "theorem-find-min-weight-matching": {
    "filename": "02-11-Bipartite-Prefect-Matching.html",
    "labelTitle": "Theorem",
    "indexString": "4.5.1"
  },
  "prop-remove-edge": {
    "filename": "02-11-Bipartite-Prefect-Matching.html",
    "labelTitle": "Beobachtung",
    "indexString": "4.5.2"
  },
  "isolation-lemma": {
    "filename": "02-11-Bipartite-Prefect-Matching.html",
    "labelTitle": "Lemma",
    "indexString": "4.5.3"
  },
  "definition-MPC-round": {
    "filename": "04-00-Massively-Parallel-Algorithms.html",
    "labelTitle": "Definition",
    "indexString": "6.1"
  },
  "exercise-brute-force-sorting": {
    "filename": "04-03-MPC-Sorting-GSZ.html",
    "labelTitle": "Übungsaufgabe",
    "indexString": "6.3.3"
  },
  "def-k-ary-search-tree": {
    "filename": "04-03-MPC-Sorting-GSZ.html",
    "labelTitle": "Definition",
    "indexString": "6.3.1"
  },
  "def-rank-dist": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Definition",
    "indexString": "3.4.1"
  },
  "def-dense-list": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Definition",
    "indexString": "3.4.2"
  },
  "fact-sampling-distance": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Beobachtung",
    "indexString": "3.4.3"
  },
  "lemma-invariant": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Lemma",
    "indexString": "3.4.4"
  },
  "def-A-ranked-by-B": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Definition",
    "indexString": "3.4.5"
  },
  "invariant-ranked-dense": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Invariante",
    "indexString": "3.4.6"
  },
  "transitive-when-dense": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Lemma",
    "indexString": "3.4.7"
  },
  "symmetric-when-dense": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Lemma",
    "indexString": "3.4.8"
  },
  "lemma-merge-quickly": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Lemma",
    "indexString": "3.4.9"
  },
  "keep-the-invariant": {
    "filename": "02-06-z-Coles-Mergesort.html",
    "labelTitle": "Beobachtung",
    "indexString": "3.4.10"
  },
  "def-adjacency-matrix": {
    "filename": "02-09-d-Reachability.html",
    "labelTitle": "Definition",
    "indexString": "4.2.2"
  },
  "lemma-adj-power-k": {
    "filename": "02-09-d-Reachability.html",
    "labelTitle": "Lemma",
    "indexString": "4.2.3"
  },
  "prop-s-t-connecitivity-matrix-exp": {
    "filename": "02-09-d-Reachability.html",
    "labelTitle": "Beobachtung",
    "indexString": "4.2.4"
  },
  "lemma-naive-merge": {
    "filename": "02-06-b-Sorting-with-naive-merge.html",
    "labelTitle": "Lemma",
    "indexString": "3.2.1"
  },
  "theorem-naive-mergesort": {
    "filename": "02-06-b-Sorting-with-naive-merge.html",
    "labelTitle": "Theorem",
    "indexString": "3.2.2"
  },
  "cross-rank-in-constant-time": {
    "filename": "02-06-c-Valiants-Merge.html",
    "labelTitle": "Lemma",
    "indexString": "3.3.1"
  },
  "theorem-max-in-loglog": {
    "filename": "02-06-c-Valiants-Merge.html",
    "labelTitle": "Theorem",
    "indexString": "3.3.2"
  },
  "exercise-MPC-prefix-sum": {
    "filename": "04-01-Broadcast-Sums-Prefixsums.html",
    "labelTitle": "Übungsaufgabe",
    "indexString": "6.1.2"
  },
  "exercise-previous-True": {
    "filename": "04-01-Broadcast-Sums-Prefixsums.html",
    "labelTitle": "Übungsaufgabe",
    "indexString": "6.1.3"
  },
  "problem-Sum-MPC": {
    "filename": "04-01-Broadcast-Sums-Prefixsums.html",
    "labelTitle": "Problem",
    "indexString": "6.1.1"
  },
  "theorem-Sum-MPC": {
    "filename": "04-01-Broadcast-Sums-Prefixsums.html",
    "labelTitle": "Theorem",
    "indexString": "6.1.2"
  },
  "put-unique-name-here": {
    "filename": "05-02-Modulare-Arithmetik.html",
    "labelTitle": "Lemma",
    "indexString": "7.2.4"
  },
  "theorem-cc-algorithm": {
    "filename": "04-05-MPC-Graph.html",
    "labelTitle": "\n                                Es gibt einen MPC-Algorithmus, der die Zusammenhangskomponenten in\n                                ",
    "indexString": "6.5.1"
  },
  "problem-evaluate-relation": {
    "filename": "04-04-Functions-Relations.html",
    "labelTitle": "Problem",
    "indexString": "6.4.1"
  },
  "theorem-evaluate-relation": {
    "filename": "04-04-Functions-Relations.html",
    "labelTitle": "Theorem",
    "indexString": "6.4.2"
  },
  "lemma-unique-solution": {
    "filename": "05-02-Modulare-Arithmetik.html",
    "labelTitle": "Lemma",
    "indexString": "7.2.1"
  },
  "lemma-primes-are-prime": {
    "filename": "05-02-Modulare-Arithmetik.html",
    "labelTitle": "Lemma",
    "indexString": "7.2.2"
  },
  "prime-decomp-unique": {
    "filename": "05-02-Modulare-Arithmetik.html",
    "labelTitle": "Lemma",
    "indexString": "7.2.3"
  },
  "theorem-prime-factorization-uniquess": {
    "filename": "05-02-Modulare-Arithmetik.html",
    "labelTitle": "Theorem",
    "indexString": "7.2.5"
  },
  "exercise-collect-pivots": {
    "filename": "04-02-MPC-Sorting.html",
    "labelTitle": "Übungsaufgabe",
    "indexString": "6.2.1"
  },
  "claim-number-of-pivots": {
    "filename": "04-02-MPC-Sorting.html",
    "labelTitle": "Behauptung",
    "indexString": "6.2.1"
  },
  "claim-machine-does-not-receive-too-many": {
    "filename": "04-02-MPC-Sorting.html",
    "labelTitle": "Behauptung",
    "indexString": "6.2.2"
  },
  "claim-no-subproblem-too-large": {
    "filename": "04-02-MPC-Sorting.html",
    "labelTitle": "Behauptung",
    "indexString": "6.2.3"
  },
  "prop-distinct-items-trivial-algorithm": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Beobachtung",
    "indexString": "7.1.1"
  },
  "theorem-flajolet-martin-impraktikabel": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Theorem",
    "indexString": "7.1.2"
  },
  "pi-uniform": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Lemma",
    "indexString": "7.1.3"
  },
  "pi-pairwise-independent": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Lemma",
    "indexString": "7.1.4"
  },
  "theorem-flajolet-martin": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Theorem",
    "indexString": "7.1.5"
  },
  "lemma-markov-inequality": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Lemma",
    "indexString": "7.1.6"
  },
  "theorem-chebyshev-inequality": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Tschebyschow-Ungleichung",
    "indexString": "7.1.7"
  },
  "prop-variance-exp-squared": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Beobachtung",
    "indexString": "7.1.8"
  },
  "lemma-variance-pairwise-independent": {
    "filename": "05-01-Distinct-Items.html",
    "labelTitle": "Lemma",
    "indexString": "7.1.9"
  }
};

    When done, paste the above json globalLabelsCollection = {...} into the file number-my-theorems.js