Selection: Algorithms

Algorithms and data structures from the beginning to advanced analysis.

Author: Grigory Sapunov
Course
Description
Dates
1
6-046jf05
6-046jf05
Prof. Charles Leiserson
MIT OpenCourseWare
Mathematics, Statistics and Data Analysis
Gb Free
Course added: long ago
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational...
Free schedule
Favored by 2 people
2
Small-icon.hover
Small-icon.hover
Tim Roughgarden
Stanford University
Computer Science
Gb Free
Course added: long ago
In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures (heaps, hash tables, search trees), randomized algorithms, and more. In this course you will learn several fundamental principles of algorithm design...
5 October 2015, 6 weeks
Favored by 4 people
3
Small-icon.hover
Small-icon.hover
Tim Roughgarden
Stanford University
Computer Science
Gb Free
Course added: long ago
In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more. In this course you will learn...
16 March 2015, 6 weeks
Favored by 4 people
4
Aofa-logo
Aofa-logo
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures...
4 March 2016, 6 weeks
Favored by 5 people
5
Small-icon.hover
Small-icon.hover
Kevin Wayne and Robert Sedgewick
Princeton University
Computer Science Engineering & Technology
Gb Free
Course added: long ago
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers basic iterable data types, sorting, and searching algorithms. An introduction...
22 January 2016, 6 weeks
Favored by 12 people
6
Small-icon.hover
Small-icon.hover
Kevin Wayne and Robert Sedgewick
Princeton University
Computer Science Engineering & Technology
Gb Free
Course added: long ago
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part II covers graph-processing algorithms, including minimum spanning tree and shortest...
16 March 2016, 6 weeks
Favored by 4 people
7
Csci52
Csci52
David J. Malan, PhD, Gordon McKay Professor of the Practice of Computer Science, Harvard University.
Harvard Extension School
Computer Science
Gb Free
Course added: long ago
This free online computer science course is an introduction to the intellectual enterprises of computer science. Topics include algorithms (their design, implementation, and analysis); software development (abstraction, encapsulation, data structures, debugging, and testing); architecture of computers...
Free schedule
Favored by 2 people
8
6-006f11
6-006f11
Prof. Erik Demaine
MIT OpenCourseWare
Computer Science
Gb Free
Course added: long ago
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance...
Free schedule
Favored by 1 person
9
Vb0pb3pzlicuivgmwpe0ji9ktgzmf4x-7ay4t6n7uqvdw720eadz8vwhx_47l8zqet_re9ghce8z-aoglgu=s0#w=436&h=268
Vb0pb3pzlicuivgmwpe0ji9ktgzmf4x-7ay4t6n7uqvdw720eadz8vwhx_47l8zqet_re9ghce8z-aoglgu=s0#w=436&h=268
Learn the basic concepts in theoretical computer science. Discover what they imply for solving tough computational challenges.
Free schedule
Favored by 2 people
10
B-teaser-0
B-teaser-0
Максим Александрович Бабенко
Яндекс
Computer Science
Ru Free
Course added: long ago
Лектор: Максим Александрович Бабенко, заместитель директора отделения computer science, ассистент кафедры математической логики и теории алгоритмов механико-математического факультета МГУ им. М. В. Ломоносова, кандидат физико-математических наук. Сложность и модели вычислений. Анализ учетных стои...
Details to be announced
Favored by 9 people
11
Cscenter
Cscenter
Станкевич Андрей Сергеевич
Computer Science Center
Computer Science
Ru Free
Course added: long ago
Часть 1. Продвинутые структуры данных Приоритетные очереди, сливаемые кучи, фибоначчиевы кучи, тонкие кучи, кучи Бродала-Окасаки Cплей-деревья, оптимальность, обобщенная модель BST, нижние границы на число операций, AS-множества, TANGO-деревья Cтруктуры для позиционирования точек на плоскости. Де...
Free schedule
Favored by 8 people
12
Cscenter
Cscenter
Куликов Александр Сергеевич, Бойкий Роман Игоревич
Computer Science Center
Computer Science
Ru Free
Course added: long ago
Splay-дерево и декартово дерево Хеширование Числовые алгоритмы: проверка чисел на простоту, криптосистема RSA, цифровая подпись Быстрое преобразование Фурье Поиск подстроки в строке: алгоритм Кнута-Морриса-Пратта, суффиксное дерево, суффиксный массив Задача линейного программирования NP-полные...
Free schedule
Favored by 6 people
13
6-854jf08
6-854jf08
Prof. Michel Goemans
MIT OpenCourseWare
Mathematics, Statistics and Data Analysis
Gb Free
Course added: long ago
This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms. It is especially designed for doctoral students interested in theoretical computer science.
Free schedule
Favored by 1 person
14
6-856jf02
6-856jf02
Prof. David R. Karger
MIT OpenCourseWare
Mathematics, Statistics and Data Analysis
Gb Free
Course added: long ago
This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum...
Free schedule
Favored by 1 person
15
Ac-logo
Ac-logo
Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for...
6 November 2015, 6 weeks
Favored by 3 people
16
Calculus1
Calculus1
Jim Fowler
The Ohio State University
Gb Free
Course added: 16 June 2014
Calculus is about the very large, the very small, and how things change. The surprise is that something seemingly so abstract ends up explaining the real world. Calculus plays a starring role in the biological, physical, and social sciences. By focusing outside of the classroom, we will see examples...
Free schedule
Favored by 2 people
17
Csc_algo
Csc_algo
Александр Куликов, Сергей Поромов
Stepik
Computer Science
Ru Free
Course added: 5 August 2014
Данный курс перезапускаться не будет. Вместо него мы подготовили улучшенную версию — курс «Алгоритмы: теория и практика. Методы». Курс знакомит слушателей с базовыми алгоритмами (метод «разделяй и властвуй», поиск в массиве, сортировка массива, алгоритмы на графах) и структурами данных (расширяющийс...
14 September 2014
Favored by 7 people
18
Csc_algorithms_igurjfv
Csc_algorithms_igurjfv
Александр Куликов, Сергей Лебедев, Алексей Левин, Павел Маврин
Stepik
Computer Science
Ru Free
Course added: 27 August 2015
В курсе будут разобраны основные алгоритмические методы: жадные алгоритмы, «разделяй и властвуй», динамическое программирование. Помимо теоретических основ, будут рассмотрены тонкости реализации рассмотренных алгоритмов на языках C++, Java и Python. Слушателям будет предложено реализовать большинств...
Coming soon, Free schedule
Favored by 2 people
19
2791_id486_mail_ru_17_algorithm_and_data_structure_icon_250_250
2791_id486_mail_ru_17_algorithm_and_data_structure_icon_250_250
Степан Мацкевич
Stepik
Computer Science
Ru Free
Course added: 10 December 2015
Курс представляет собой изучение основных алгоритмов и структур данных, необходимых программистам для качественного решения ежедневных задач. По окончанию курса у вас появится личный опыт реализации основных алгоритмов и представление о том, как оценивать эффективность по времени работы и по количес...
8 December 2015

© 2013-2019