|
lindenmannm@5
|
1 |
\relax
|
|
lindenmannm@5
|
2 |
\providecommand\BKM@entry[2]{}
|
|
lindenmannm@5
|
3 |
\catcode`"\active
|
|
lindenmannm@5
|
4 |
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
|
|
lindenmannm@5
|
5 |
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
|
|
lindenmannm@5
|
6 |
\global\let\oldcontentsline\contentsline
|
|
lindenmannm@5
|
7 |
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
|
|
lindenmannm@5
|
8 |
\global\let\oldnewlabel\newlabel
|
|
lindenmannm@5
|
9 |
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
|
|
lindenmannm@5
|
10 |
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
|
|
lindenmannm@5
|
11 |
\AtEndDocument{\ifx\hyper@anchor\@undefined
|
|
lindenmannm@5
|
12 |
\let\contentsline\oldcontentsline
|
|
lindenmannm@5
|
13 |
\let\newlabel\oldnewlabel
|
|
lindenmannm@5
|
14 |
\fi}
|
|
lindenmannm@5
|
15 |
\fi}
|
|
lindenmannm@5
|
16 |
\global\let\hyper@last\relax
|
|
lindenmannm@5
|
17 |
\gdef\HyperFirstAtBeginDocument#1{#1}
|
|
lindenmannm@5
|
18 |
\providecommand*\HyPL@Entry[1]{}
|
|
lindenmannm@5
|
19 |
\bibstyle{alphadin}
|
|
lindenmannm@5
|
20 |
\HyPL@Entry{0<</S/D>>}
|
|
lindenmannm@5
|
21 |
\select@language{ngerman}
|
|
lindenmannm@5
|
22 |
\@writefile{toc}{\select@language{ngerman}}
|
|
lindenmannm@5
|
23 |
\@writefile{lof}{\select@language{ngerman}}
|
|
lindenmannm@5
|
24 |
\@writefile{lot}{\select@language{ngerman}}
|
|
lindenmannm@5
|
25 |
\BKM@entry{id=1,dest={73656374696F6E2E31}}{45696E6C656974756E67}
|
|
lindenmannm@5
|
26 |
\BKM@entry{id=2,dest={73756273656374696F6E2E312E31}}{5468656D656E3A}
|
|
lindenmannm@5
|
27 |
\BKM@entry{id=3,dest={73756273656374696F6E2E312E32}}{50726F626C656D2D2F416E77656E64756E677362657265696368653A}
|
|
lindenmannm@5
|
28 |
\BKM@entry{id=4,dest={73756273656374696F6E2E312E33}}{4C69746572617475723A}
|
|
lindenmannm@5
|
29 |
\bibdata{literatur}
|
|
lindenmannm@5
|
30 |
\bibcite{2}{PW02}
|
|
lindenmannm@5
|
31 |
\bibcite{1}{THC01}
|
|
lindenmannm@5
|
32 |
\citation{*}
|
|
lindenmannm@5
|
33 |
\@writefile{toc}{\contentsline {section}{\numberline {1}Einleitung}{3}{section.1}}
|
|
lindenmannm@5
|
34 |
\newlabel{sec:intro}{{1}{3}{Einleitung\relax }{section.1}{}}
|
|
lindenmannm@5
|
35 |
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Themen:}{3}{subsection.1.1}}
|
|
lindenmannm@5
|
36 |
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Problem-/Anwendungsbereiche:}{3}{subsection.1.2}}
|
|
lindenmannm@5
|
37 |
\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Literatur:}{3}{subsection.1.3}}
|
|
lindenmannm@5
|
38 |
\BKM@entry{id=5,dest={73656374696F6E2E32}}{44697669646520616E6420436F6E71756572}
|
|
lindenmannm@5
|
39 |
\BKM@entry{id=6,dest={73756273656374696F6E2E322E31}}{466F726D756C696572756E67206465732044697669646520616E6420436F6E71756572205072696E7A697073}
|
|
lindenmannm@5
|
40 |
\BKM@entry{id=7,dest={73756273656374696F6E2E322E32}}{517569636B736F7274}
|
|
lindenmannm@5
|
41 |
\BKM@entry{id=8,dest={73756273756273656374696F6E2E322E322E31}}{416C676F726974686D7573}
|
|
lindenmannm@5
|
42 |
\BKM@entry{id=9,dest={73756273756273656374696F6E2E322E322E32}}{416E616C797365}
|
|
lindenmannm@5
|
43 |
\BKM@entry{id=10,dest={73756273656374696F6E2E322E33}}{4E5C3334346368737465205061617265}
|
|
lindenmannm@5
|
44 |
\@writefile{toc}{\contentsline {section}{\numberline {2}Divide and Conquer}{4}{section.2}}
|
|
lindenmannm@5
|
45 |
\newlabel{sec:div&conq}{{2}{4}{Divide and Conquer\relax }{section.2}{}}
|
|
lindenmannm@5
|
46 |
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Formulierung des Divide and Conquer Prinzips}{4}{subsection.2.1}}
|
|
lindenmannm@5
|
47 |
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Quicksort}{4}{subsection.2.2}}
|
|
lindenmannm@5
|
48 |
\newlabel{ch:qs}{{2.2}{4}{Quicksort\relax }{subsection.2.2}{}}
|
|
lindenmannm@5
|
49 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1}Algorithmus}{4}{subsubsection.2.2.1}}
|
|
lindenmannm@5
|
50 |
\newlabel{lst:TTlookup}{{1}{4}{Algorithmus Quicksort\relax }{lstlisting.1}{}}
|
|
lindenmannm@5
|
51 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {1}Algorithmus Quicksort}{4}{lstlisting.1}}
|
|
lindenmannm@5
|
52 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2}Analyse}{4}{subsubsection.2.2.2}}
|
|
lindenmannm@5
|
53 |
\BKM@entry{id=11,dest={73756273756273656374696F6E2E322E332E31}}{416C676F726974686D7573}
|
|
lindenmannm@5
|
54 |
\BKM@entry{id=12,dest={73756273756273656374696F6E2E322E332E32}}{416E616C797365}
|
|
lindenmannm@5
|
55 |
\BKM@entry{id=13,dest={73756273656374696F6E2E322E34}}{5365676D656E747363686E697474}
|
|
lindenmannm@5
|
56 |
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}N\"achste Paare}{5}{subsection.2.3}}
|
|
lindenmannm@5
|
57 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.3.1}Algorithmus}{5}{subsubsection.2.3.1}}
|
|
lindenmannm@5
|
58 |
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces N\"achste Paare: Pr\"uf Distanz}}{5}{figure.1}}
|
|
lindenmannm@5
|
59 |
\newlabel{cl_pair}{{1}{5}{Nächste Paare: Prüf Distanz\relax }{figure.1}{}}
|
|
lindenmannm@5
|
60 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.3.2}Analyse}{5}{subsubsection.2.3.2}}
|
|
lindenmannm@5
|
61 |
\BKM@entry{id=14,dest={73756273756273656374696F6E2E322E342E31}}{416C676F726974686D7573}
|
|
lindenmannm@5
|
62 |
\BKM@entry{id=15,dest={73756273756273656374696F6E2E322E342E32}}{416E616C797365}
|
|
lindenmannm@5
|
63 |
\BKM@entry{id=16,dest={73756273656374696F6E2E322E35}}{506F6C796E6F6D70726F64756B7420756E64204661737420466F75726965722D5472616E73666F726D6174696F6E205C28544F444F5C29}
|
|
lindenmannm@5
|
64 |
\@writefile{toc}{\contentsline {subsection}{\numberline {2.4}Segmentschnitt}{6}{subsection.2.4}}
|
|
lindenmannm@5
|
65 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.1}Algorithmus}{6}{subsubsection.2.4.1}}
|
|
lindenmannm@5
|
66 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.2}Analyse}{6}{subsubsection.2.4.2}}
|
|
lindenmannm@5
|
67 |
\@writefile{toc}{\contentsline {subsection}{\numberline {2.5}Polynomprodukt und Fast Fourier-Transformation (TODO)}{6}{subsection.2.5}}
|
|
lindenmannm@5
|
68 |
\BKM@entry{id=17,dest={73656374696F6E2E33}}{52616E646F6D6973696572756E67}
|
|
lindenmannm@5
|
69 |
\BKM@entry{id=18,dest={73756273656374696F6E2E332E31}}{52616E646F6D697369657274657220517569636B736F7274}
|
|
lindenmannm@5
|
70 |
\BKM@entry{id=19,dest={73756273756273656374696F6E2E332E312E31}}{416E616C797365}
|
|
lindenmannm@5
|
71 |
\BKM@entry{id=20,dest={73756273656374696F6E2E332E32}}{52616E646F6D6973696572746572205072696D7A61686C74657374205C28544F444F5C29}
|
|
lindenmannm@5
|
72 |
\BKM@entry{id=21,dest={73756273656374696F6E2E332E33}}{525341205C28544F444F5C29}
|
|
lindenmannm@5
|
73 |
\BKM@entry{id=22,dest={73756273656374696F6E2E332E34}}{547265617073205C28544F444F5C29}
|
|
lindenmannm@5
|
74 |
\BKM@entry{id=23,dest={73756273656374696F6E2E332E35}}{48617368696E67205C28544F444F5C29}
|
|
lindenmannm@5
|
75 |
\@writefile{toc}{\contentsline {section}{\numberline {3}Randomisierung}{7}{section.3}}
|
|
lindenmannm@5
|
76 |
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Randomisierter Quicksort}{7}{subsection.3.1}}
|
|
lindenmannm@5
|
77 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.1}Analyse}{7}{subsubsection.3.1.1}}
|
|
lindenmannm@5
|
78 |
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Randomisierter Primzahltest (TODO)}{7}{subsection.3.2}}
|
|
lindenmannm@5
|
79 |
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}RSA (TODO)}{7}{subsection.3.3}}
|
|
lindenmannm@5
|
80 |
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Treaps (TODO)}{7}{subsection.3.4}}
|
|
lindenmannm@5
|
81 |
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5}Hashing (TODO)}{7}{subsection.3.5}}
|
|
lindenmannm@5
|
82 |
\BKM@entry{id=24,dest={73656374696F6E2E34}}{416D6F72746973696572746520416E616C797365205C28544F444F5C29}
|
|
lindenmannm@5
|
83 |
\BKM@entry{id=25,dest={73756273656374696F6E2E342E31}}{42696E6F6D69616C204865617073205C28544F444F5C29}
|
|
lindenmannm@5
|
84 |
\BKM@entry{id=26,dest={73756273656374696F6E2E342E32}}{4669626F6E61636369204865617073205C28544F444F5C29}
|
|
lindenmannm@5
|
85 |
\BKM@entry{id=27,dest={73756273656374696F6E2E342E33}}{556E696F6E2046696E64205C28544F444F5C29}
|
|
lindenmannm@5
|
86 |
\@writefile{toc}{\contentsline {section}{\numberline {4}Amortisierte Analyse (TODO)}{8}{section.4}}
|
|
lindenmannm@5
|
87 |
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Binomial Heaps (TODO)}{8}{subsection.4.1}}
|
|
lindenmannm@5
|
88 |
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Fibonacci Heaps (TODO)}{8}{subsection.4.2}}
|
|
lindenmannm@5
|
89 |
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Union Find (TODO)}{8}{subsection.4.3}}
|
|
lindenmannm@5
|
90 |
\BKM@entry{id=28,dest={73656374696F6E2E35}}{477265656479}
|
|
lindenmannm@5
|
91 |
\BKM@entry{id=29,dest={73756273656374696F6E2E352E31}}{4B5C333734727A65737465205C2862696C6C69677374655C292057656765}
|
|
lindenmannm@5
|
92 |
\BKM@entry{id=30,dest={73756273756273656374696F6E2E352E312E31}}{53696E676C6520536F757263652053686F7274657374205061746873}
|
|
lindenmannm@5
|
93 |
\@writefile{toc}{\contentsline {section}{\numberline {5}Greedy}{9}{section.5}}
|
|
lindenmannm@5
|
94 |
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}K\"urzeste (billigste) Wege}{9}{subsection.5.1}}
|
|
lindenmannm@5
|
95 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.1.1}Single Source Shortest Paths}{9}{subsubsection.5.1.1}}
|
|
lindenmannm@5
|
96 |
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Tree for Dijkstra Example}}{10}{figure.2}}
|
|
lindenmannm@5
|
97 |
\newlabel{fig:dijExT}{{2}{10}{Tree for Dijkstra Example\relax }{figure.2}{}}
|
|
lindenmannm@5
|
98 |
\newlabel{lst:TTlookup}{{2}{10}{Algorithmus von Dijkstra\relax }{lstlisting.2}{}}
|
|
lindenmannm@5
|
99 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {2}Algorithmus von Dijkstra}{10}{lstlisting.2}}
|
|
lindenmannm@5
|
100 |
\newlabel{lst:TTlookup}{{3}{10}{Algorithmus von Belman-Ford\relax }{lstlisting.3}{}}
|
|
lindenmannm@5
|
101 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {3}Algorithmus von Belman-Ford}{10}{lstlisting.3}}
|
|
lindenmannm@5
|
102 |
\BKM@entry{id=31,dest={73756273656374696F6E2E352E32}}{5370616E6E625C333434756D65206D696E696D616C656E204765776963687473}
|
|
lindenmannm@5
|
103 |
\BKM@entry{id=32,dest={73756273756273656374696F6E2E352E322E31}}{446173205761636873656E20766F6E206D696E2E205370616E6E625C333434756D656E}
|
|
lindenmannm@5
|
104 |
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Dijkstra Example}}{11}{table.1}}
|
|
lindenmannm@5
|
105 |
\newlabel{tab:dijEx}{{1}{11}{Dijkstra Example\relax }{table.1}{}}
|
|
lindenmannm@5
|
106 |
\newlabel{lst:TTlookup}{{4}{11}{Algorithmus für Azyklische Netzwerke\relax }{lstlisting.4}{}}
|
|
lindenmannm@5
|
107 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {4}Algorithmus f\"ur Azyklische Netzwerke}{11}{lstlisting.4}}
|
|
lindenmannm@5
|
108 |
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Spannb\"aume minimalen Gewichts}{11}{subsection.5.2}}
|
|
lindenmannm@5
|
109 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.2.1}Das Wachsen von min. Spannb\"aumen}{11}{subsubsection.5.2.1}}
|
|
lindenmannm@5
|
110 |
\newlabel{lst:TTlookup}{{5}{11}{Greedy Algorithmus für Spannbäume\relax }{lstlisting.5}{}}
|
|
lindenmannm@5
|
111 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {5}Greedy Algorithmus f\"ur Spannb\"aume}{11}{lstlisting.5}}
|
|
lindenmannm@5
|
112 |
\BKM@entry{id=33,dest={73756273756273656374696F6E2E352E322E32}}{5363686E69747465}
|
|
lindenmannm@5
|
113 |
\BKM@entry{id=34,dest={73756273756273656374696F6E2E352E322E33}}{53696368657265204B616E74656E}
|
|
lindenmannm@5
|
114 |
\BKM@entry{id=35,dest={73756273756273656374696F6E2E352E322E34}}{446572204772617068204741}
|
|
lindenmannm@5
|
115 |
\BKM@entry{id=36,dest={73756273756273656374696F6E2E352E322E35}}{416C676F726974686D757320766F6E204B7275736B616C}
|
|
lindenmannm@5
|
116 |
\BKM@entry{id=37,dest={73756273756273656374696F6E2E352E322E36}}{416C676F726974686D757320766F6E205072696D}
|
|
lindenmannm@5
|
117 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.2.2}Schnitte}{12}{subsubsection.5.2.2}}
|
|
lindenmannm@5
|
118 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.2.3}Sichere Kanten}{12}{subsubsection.5.2.3}}
|
|
lindenmannm@5
|
119 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.2.4}Der Graph $G_A$}{12}{subsubsection.5.2.4}}
|
|
lindenmannm@5
|
120 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.2.5}Algorithmus von Kruskal}{12}{subsubsection.5.2.5}}
|
|
lindenmannm@5
|
121 |
\newlabel{lst:TTlookup}{{6}{12}{Algorithmus von Kruskal\relax }{lstlisting.6}{}}
|
|
lindenmannm@5
|
122 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {6}Algorithmus von Kruskal}{12}{lstlisting.6}}
|
|
lindenmannm@5
|
123 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.2.6}Algorithmus von Prim}{13}{subsubsection.5.2.6}}
|
|
lindenmannm@5
|
124 |
\newlabel{lst:TTlookup}{{7}{13}{Algorithmus von Prim\relax }{lstlisting.7}{}}
|
|
lindenmannm@5
|
125 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {7}Algorithmus von Prim}{13}{lstlisting.7}}
|
|
lindenmannm@5
|
126 |
\BKM@entry{id=38,dest={73656374696F6E2E36}}{42696E205061636B696E67}
|
|
lindenmannm@5
|
127 |
\BKM@entry{id=39,dest={73756273656374696F6E2E362E31}}{4F6E6C696E652056657266616872656E}
|
|
lindenmannm@5
|
128 |
\BKM@entry{id=40,dest={73756273756273656374696F6E2E362E312E31}}{4E65787420466974205C284E465C29}
|
|
lindenmannm@5
|
129 |
\BKM@entry{id=41,dest={73756273756273656374696F6E2E362E312E32}}{46697273742D466974205C2846465C29}
|
|
lindenmannm@5
|
130 |
\@writefile{toc}{\contentsline {section}{\numberline {6}Bin Packing}{14}{section.6}}
|
|
lindenmannm@5
|
131 |
\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}Online Verfahren}{14}{subsection.6.1}}
|
|
lindenmannm@5
|
132 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.1.1}Next Fit (NF)}{14}{subsubsection.6.1.1}}
|
|
lindenmannm@5
|
133 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.1.2}First-Fit (FF)}{14}{subsubsection.6.1.2}}
|
|
lindenmannm@5
|
134 |
\BKM@entry{id=42,dest={73756273756273656374696F6E2E362E312E33}}{426573742D466974205C2842465C29}
|
|
lindenmannm@5
|
135 |
\BKM@entry{id=43,dest={73756273656374696F6E2E362E32}}{4F66666C696E652056657266616872656E}
|
|
lindenmannm@5
|
136 |
\BKM@entry{id=44,dest={73756273756273656374696F6E2E362E322E31}}{4669727374204669742044656372656173696E67205C28464644206F6465722046464E495C29}
|
|
lindenmannm@5
|
137 |
\BKM@entry{id=45,dest={73756273756273656374696F6E2E362E322E32}}{42657374204669742044656372656173696E67205C284246445C29}
|
|
lindenmannm@5
|
138 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.1.3}Best-Fit (BF)}{15}{subsubsection.6.1.3}}
|
|
lindenmannm@5
|
139 |
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Offline Verfahren}{15}{subsection.6.2}}
|
|
lindenmannm@5
|
140 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.2.1}First Fit Decreasing (FFD oder FFNI)}{15}{subsubsection.6.2.1}}
|
|
lindenmannm@5
|
141 |
\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.2.2}Best Fit Decreasing (BFD)}{15}{subsubsection.6.2.2}}
|
|
lindenmannm@5
|
142 |
\BKM@entry{id=46,dest={73656374696F6E2E37}}{44796E616D69736368652050726F6772616D6D696572756E67}
|
|
lindenmannm@5
|
143 |
\BKM@entry{id=47,dest={73756273656374696F6E2E372E31}}{4D61747269786B657474656E70726F64756B74205C28544F444F5C29}
|
|
lindenmannm@5
|
144 |
\BKM@entry{id=48,dest={73756273656374696F6E2E372E32}}{4F7074696D616C652053756368625C333434756D65205C28544F444F5C29}
|
|
lindenmannm@5
|
145 |
\BKM@entry{id=49,dest={73756273656374696F6E2E372E33}}{4564697469657264697374616E7A}
|
|
lindenmannm@5
|
146 |
\@writefile{toc}{\contentsline {section}{\numberline {7}Dynamische Programmierung}{16}{section.7}}
|
|
lindenmannm@5
|
147 |
\@writefile{toc}{\contentsline {subsection}{\numberline {7.1}Matrixkettenprodukt (TODO)}{16}{subsection.7.1}}
|
|
lindenmannm@5
|
148 |
\@writefile{toc}{\contentsline {subsection}{\numberline {7.2}Optimale Suchb\"aume (TODO)}{16}{subsection.7.2}}
|
|
lindenmannm@5
|
149 |
\@writefile{toc}{\contentsline {subsection}{\numberline {7.3}Editierdistanz}{16}{subsection.7.3}}
|
|
lindenmannm@5
|
150 |
\BKM@entry{id=50,dest={73656374696F6E2E38}}{537563686520696E2054657874656E}
|
|
lindenmannm@5
|
151 |
\newlabel{lst:TTlookup}{{8}{17}{Algorithmus zur Editierdistanz\relax }{lstlisting.8}{}}
|
|
lindenmannm@5
|
152 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {8}Algorithmus zur Editierdistanz}{17}{lstlisting.8}}
|
|
lindenmannm@5
|
153 |
\newlabel{lst:TTlookup}{{9}{17}{Algorithmus zum Spurgraphen\relax }{lstlisting.9}{}}
|
|
lindenmannm@5
|
154 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {9}Algorithmus zum Spurgraphen}{17}{lstlisting.9}}
|
|
lindenmannm@5
|
155 |
\@writefile{toc}{\contentsline {section}{\numberline {8}Suche in Texten}{17}{section.8}}
|
|
lindenmannm@5
|
156 |
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces next[j] Beispiel}}{17}{table.2}}
|
|
lindenmannm@5
|
157 |
\newlabel{tab:nextJ}{{2}{17}{next[j] Beispiel\relax }{table.2}{}}
|
|
lindenmannm@5
|
158 |
\newlabel{lst:TTlookup}{{10}{18}{KMP Algorithmus\relax }{lstlisting.10}{}}
|
|
lindenmannm@5
|
159 |
\@writefile{lol}{\contentsline {lstlisting}{\numberline {10}KMP Algorithmus}{18}{lstlisting.10}}
|
|
lindenmannm@5
|
160 |
\BKM@entry{id=51,dest={617070656E6469782E41}}{4C616E6461752D53796D626F6C65}
|
|
lindenmannm@5
|
161 |
\@writefile{toc}{\contentsline {section}{\numberline {A}Landau-Symbole}{19}{appendix.A}}
|
|
lindenmannm@5
|
162 |
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Definition der Landau Symbole}}{19}{figure.3}}
|
|
lindenmannm@5
|
163 |
\newlabel{fig:landau_sym}{{3}{19}{Definition der Landau Symbole\relax }{figure.3}{}}
|
|
lindenmannm@5
|
164 |
\newlabel{LastPage}{{}{19}{}{page.19}{}}
|