AT_Exzerpt.out.ps
author Eugen Sawin <sawine@me73.com>
Mon, 07 Mar 2011 20:17:23 +0100
changeset 11 1226c74fd4f9
permissions -rw-r--r--
Added formulary (Eugen).
     1 %!
     2 /pdfmark where{pop}
     3 {/globaldict where{pop globaldict}{userdict}ifelse/pdfmark/cleartomark load put}
     4 ifelse
     5 [
     6 /Title(Einleitung)
     7 /Count -3
     8 /Action/GoTo/Dest(section.1)cvn
     9 /OUT pdfmark
    10 [
    11 /Title(Themen:)
    12 /Action/GoTo/Dest(subsection.1.1)cvn
    13 /OUT pdfmark
    14 [
    15 /Title(Problem-/Anwendungsbereiche:)
    16 /Action/GoTo/Dest(subsection.1.2)cvn
    17 /OUT pdfmark
    18 [
    19 /Title(Literatur:)
    20 /Action/GoTo/Dest(subsection.1.3)cvn
    21 /OUT pdfmark
    22 [
    23 /Title(Divide and Conquer)
    24 /Count -5
    25 /Action/GoTo/Dest(section.2)cvn
    26 /OUT pdfmark
    27 [
    28 /Title(Formulierung des Divide and Conquer Prinzips)
    29 /Action/GoTo/Dest(subsection.2.1)cvn
    30 /OUT pdfmark
    31 [
    32 /Title(Quicksort)
    33 /Count -2
    34 /Action/GoTo/Dest(subsection.2.2)cvn
    35 /OUT pdfmark
    36 [
    37 /Title(Algorithmus)
    38 /Action/GoTo/Dest(subsubsection.2.2.1)cvn
    39 /OUT pdfmark
    40 [
    41 /Title(Analyse)
    42 /Action/GoTo/Dest(subsubsection.2.2.2)cvn
    43 /OUT pdfmark
    44 [
    45 /Title(N\344chste Paare)
    46 /Count -2
    47 /Action/GoTo/Dest(subsection.2.3)cvn
    48 /OUT pdfmark
    49 [
    50 /Title(Algorithmus)
    51 /Action/GoTo/Dest(subsubsection.2.3.1)cvn
    52 /OUT pdfmark
    53 [
    54 /Title(Analyse)
    55 /Action/GoTo/Dest(subsubsection.2.3.2)cvn
    56 /OUT pdfmark
    57 [
    58 /Title(Segmentschnitt)
    59 /Count -2
    60 /Action/GoTo/Dest(subsection.2.4)cvn
    61 /OUT pdfmark
    62 [
    63 /Title(Algorithmus)
    64 /Action/GoTo/Dest(subsubsection.2.4.1)cvn
    65 /OUT pdfmark
    66 [
    67 /Title(Analyse)
    68 /Action/GoTo/Dest(subsubsection.2.4.2)cvn
    69 /OUT pdfmark
    70 [
    71 /Title(Polynomprodukt und Fast Fourier-Transformation \(TODO\))
    72 /Action/GoTo/Dest(subsection.2.5)cvn
    73 /OUT pdfmark
    74 [
    75 /Title(Randomisierung)
    76 /Count -5
    77 /Action/GoTo/Dest(section.3)cvn
    78 /OUT pdfmark
    79 [
    80 /Title(Randomisierter Quicksort)
    81 /Count -1
    82 /Action/GoTo/Dest(subsection.3.1)cvn
    83 /OUT pdfmark
    84 [
    85 /Title(Analyse)
    86 /Action/GoTo/Dest(subsubsection.3.1.1)cvn
    87 /OUT pdfmark
    88 [
    89 /Title(Randomisierter Primzahltest \(TODO\))
    90 /Action/GoTo/Dest(subsection.3.2)cvn
    91 /OUT pdfmark
    92 [
    93 /Title(RSA \(TODO\))
    94 /Action/GoTo/Dest(subsection.3.3)cvn
    95 /OUT pdfmark
    96 [
    97 /Title(Treaps \(TODO\))
    98 /Action/GoTo/Dest(subsection.3.4)cvn
    99 /OUT pdfmark
   100 [
   101 /Title(Hashing \(TODO\))
   102 /Action/GoTo/Dest(subsection.3.5)cvn
   103 /OUT pdfmark
   104 [
   105 /Title(Amortisierte Analyse \(TODO\))
   106 /Count -3
   107 /Action/GoTo/Dest(section.4)cvn
   108 /OUT pdfmark
   109 [
   110 /Title(Binomial Heaps \(TODO\))
   111 /Action/GoTo/Dest(subsection.4.1)cvn
   112 /OUT pdfmark
   113 [
   114 /Title(Fibonacci Heaps \(TODO\))
   115 /Action/GoTo/Dest(subsection.4.2)cvn
   116 /OUT pdfmark
   117 [
   118 /Title(Union Find \(TODO\))
   119 /Action/GoTo/Dest(subsection.4.3)cvn
   120 /OUT pdfmark
   121 [
   122 /Title(Greedy)
   123 /Count -2
   124 /Action/GoTo/Dest(section.5)cvn
   125 /OUT pdfmark
   126 [
   127 /Title(K\374rzeste \(billigste\) Wege)
   128 /Count -1
   129 /Action/GoTo/Dest(subsection.5.1)cvn
   130 /OUT pdfmark
   131 [
   132 /Title(Single Source Shortest Paths)
   133 /Action/GoTo/Dest(subsubsection.5.1.1)cvn
   134 /OUT pdfmark
   135 [
   136 /Title(Spannb\344ume minimalen Gewichts)
   137 /Count -6
   138 /Action/GoTo/Dest(subsection.5.2)cvn
   139 /OUT pdfmark
   140 [
   141 /Title(Das Wachsen von min. Spannb\344umen)
   142 /Action/GoTo/Dest(subsubsection.5.2.1)cvn
   143 /OUT pdfmark
   144 [
   145 /Title(Schnitte)
   146 /Action/GoTo/Dest(subsubsection.5.2.2)cvn
   147 /OUT pdfmark
   148 [
   149 /Title(Sichere Kanten)
   150 /Action/GoTo/Dest(subsubsection.5.2.3)cvn
   151 /OUT pdfmark
   152 [
   153 /Title(Der Graph GA)
   154 /Action/GoTo/Dest(subsubsection.5.2.4)cvn
   155 /OUT pdfmark
   156 [
   157 /Title(Algorithmus von Kruskal)
   158 /Action/GoTo/Dest(subsubsection.5.2.5)cvn
   159 /OUT pdfmark
   160 [
   161 /Title(Algorithmus von Prim)
   162 /Action/GoTo/Dest(subsubsection.5.2.6)cvn
   163 /OUT pdfmark
   164 [
   165 /Title(Bin Packing)
   166 /Count -2
   167 /Action/GoTo/Dest(section.6)cvn
   168 /OUT pdfmark
   169 [
   170 /Title(Online Verfahren)
   171 /Count -3
   172 /Action/GoTo/Dest(subsection.6.1)cvn
   173 /OUT pdfmark
   174 [
   175 /Title(Next Fit \(NF\))
   176 /Action/GoTo/Dest(subsubsection.6.1.1)cvn
   177 /OUT pdfmark
   178 [
   179 /Title(First-Fit \(FF\))
   180 /Action/GoTo/Dest(subsubsection.6.1.2)cvn
   181 /OUT pdfmark
   182 [
   183 /Title(Best-Fit \(BF\))
   184 /Action/GoTo/Dest(subsubsection.6.1.3)cvn
   185 /OUT pdfmark
   186 [
   187 /Title(Offline Verfahren)
   188 /Count -2
   189 /Action/GoTo/Dest(subsection.6.2)cvn
   190 /OUT pdfmark
   191 [
   192 /Title(First Fit Decreasing \(FFD oder FFNI\))
   193 /Action/GoTo/Dest(subsubsection.6.2.1)cvn
   194 /OUT pdfmark
   195 [
   196 /Title(Best Fit Decreasing \(BFD\))
   197 /Action/GoTo/Dest(subsubsection.6.2.2)cvn
   198 /OUT pdfmark
   199 [
   200 /Title(Dynamische Programmierung)
   201 /Count -3
   202 /Action/GoTo/Dest(section.7)cvn
   203 /OUT pdfmark
   204 [
   205 /Title(Matrixkettenprodukt \(TODO\))
   206 /Action/GoTo/Dest(subsection.7.1)cvn
   207 /OUT pdfmark
   208 [
   209 /Title(Optimale Suchb\344ume \(TODO\))
   210 /Action/GoTo/Dest(subsection.7.2)cvn
   211 /OUT pdfmark
   212 [
   213 /Title(Editierdistanz)
   214 /Action/GoTo/Dest(subsection.7.3)cvn
   215 /OUT pdfmark
   216 [
   217 /Title(Suche in Texten)
   218 /Action/GoTo/Dest(section.8)cvn
   219 /OUT pdfmark
   220 [
   221 /Title(Landau-Symbole)
   222 /Action/GoTo/Dest(appendix.A)cvn
   223 /OUT pdfmark