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