<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
		<id>http://wiki.atp-fivt.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Ariel</id>
		<title>Public ATP Wiki - Вклад участника [ru]</title>
		<link rel="self" type="application/atom+xml" href="http://wiki.atp-fivt.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Ariel"/>
		<link rel="alternate" type="text/html" href="http://wiki.atp-fivt.org/index.php/%D0%A1%D0%BB%D1%83%D0%B6%D0%B5%D0%B1%D0%BD%D0%B0%D1%8F:%D0%92%D0%BA%D0%BB%D0%B0%D0%B4/Ariel"/>
		<updated>2026-04-11T02:30:32Z</updated>
		<subtitle>Вклад участника</subtitle>
		<generator>MediaWiki 1.30.0</generator>

	<entry>
		<id>http://wiki.atp-fivt.org/index.php?title=Algorithms_and_data_structures_III&amp;diff=2023</id>
		<title>Algorithms and data structures III</title>
		<link rel="alternate" type="text/html" href="http://wiki.atp-fivt.org/index.php?title=Algorithms_and_data_structures_III&amp;diff=2023"/>
				<updated>2023-06-01T12:16:55Z</updated>
		
		<summary type="html">&lt;p&gt;Ariel: Page creation&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Feb, 18. &lt;br /&gt;
Recalling [http://judge2.vdi.mipt.ru/yudaev/english/1-bfs.pptx bfs] and [http://judge2.vdi.mipt.ru/yudaev/english/2-DFS.pdf dfs]. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
[http://judge2.vdi.mipt.ru/yudaev/english/3-shortest-paths.pdf Shortest paths], [http://judge2.vdi.mipt.ru/yudaev/english/4-dijkstra.pdf Dijkstra algorithm].  &lt;br /&gt;
&lt;br /&gt;
[https://contest.yandex.ru/contest/21550/enter/  Contest on Dijkstra]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Feb, 25.&lt;br /&gt;
Balanced binary trees, heaps.&lt;br /&gt;
&amp;lt;/h3&amp;gt; Cormen et al: ch 6, 12 &lt;br /&gt;
[http://judge2.vdi.mipt.ru/cgi-bin/new-register?contest_id=410404  Contest on binary trees and heaps] &lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Mar, 4.&lt;br /&gt;
[http://judge2.vdi.mipt.ru/yudaev/english/hashing.ppt  Hash-tables] , [http://judge2.vdi.mipt.ru/yudaev/english/Rabin-Karp.ppt  Rabin-Carpe algorithm]&lt;br /&gt;
&amp;lt;/h3&amp;gt; Cormen et al.: ch 10.3, 11, 32.2&lt;br /&gt;
&lt;br /&gt;
[http://judge2.vdi.mipt.ru/cgi-bin/new-register?contest_id=410405  Contest on hash tables]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Mar, 9. [http://judge2.vdi.mipt.ru/yudaev/english/FiniteAutomata.ppt  Finite-state automata].&lt;br /&gt;
&amp;lt;/h3&amp;gt; &lt;br /&gt;
Cormen et al: ch 32.3,&lt;br /&gt;
 &lt;br /&gt;
[https://www.gatevidyalay.com/minimization-of-dfa-minimize-dfa-example/  Dramatic how-to about DFA minimisation]&lt;br /&gt;
Also see &amp;lt;br/&amp;gt;&lt;br /&gt;
Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman, Compilers: principles, techniques, and tools, ch 3.9&lt;br /&gt;
&amp;lt;br/&amp;gt;John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to automata theory, languages, and computation, ch 4.4.3&lt;br /&gt;
&lt;br /&gt;
[http://judge2.vdi.mipt.ru/cgi-bin/new-register?contest_id=410406  Contest on automata]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Mar,16. Dynamic programming. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
[http://olymp3.vdi.mipt.ru/cgi-bin/new-register?contest_id=410407  Contest on dynamic programming]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Mar,23. [http://judge2.vdi.mipt.ru/yudaev/english/fenwick.ppt  Segment trees]. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
[http://olymp3.vdi.mipt.ru/cgi-bin/new-register?contest_id=410408  Contest on segment and Fenwick trees]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Mar,30. Semiterm control work. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Topics: hash tables, Fenwick trees, compound data structures, word correctness check. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Apr,6. Graph algorithms recalling. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
[http://judge2.vdi.mipt.ru/cgi-bin/new-register?contest_id=410403  Contest on basic graph algorithms]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Apr,13. [http://judge2.vdi.mipt.ru/yudaev/english/8-dynamic-programing-shortest-paths.pdf  Bellman-Ford] and other shortest paths.  &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
Cormen et al, ch 24-25.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://judge2.vdi.mipt.ru/cgi-bin/new-register?contest_id=410410  Contest on shortest paths]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Apr,20. [http://judge2.vdi.mipt.ru/yudaev/english/flowcut.pdf  Maximal flow]/minimal cut. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
Cormen et al, ch 26.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://judge2.vdi.mipt.ru/cgi-bin/new-register?contest_id=410411  Contest on maximal flows]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 Apr,27. [http://judge2.vdi.mipt.ru/yudaev/english/MinSpanningTrees.pdf  Spanning trees]. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
Cormen et al, ch 23.2&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
[http://olymp3.vdi.mipt.ru/cgi-bin/new-register?contest_id=410412  Contest on spanning trees]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 May, 4th. [http://judge2.vdi.mipt.ru/yudaev/english/grGames.pdf  Games on graphs]. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
[http://olymp3.vdi.mipt.ru/cgi-bin/new-register?contest_id=410413  Contest on games]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h3&amp;gt;&lt;br /&gt;
 May, 11th. End of term contest. &lt;br /&gt;
&amp;lt;/h3&amp;gt;&lt;br /&gt;
&amp;lt;p&amp;gt;&lt;br /&gt;
Topics: least-weight cycles, maximal flows, least weight trees, last common ancestor in a tree. &lt;br /&gt;
&amp;lt;/p&amp;gt;&lt;/div&gt;</summary>
		<author><name>Ariel</name></author>	</entry>

	</feed>