Search result for Courses taught by Alexander S. Kulikov
FollowFilter ![]()
Filter ![]()
Showing 17 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Number Theory and Cryptography
by Alexander S. Kulikov , Michael Levin , Владимир Подольский- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 19 hours to complete
We all learn numbers from the childhood. Some of us like to count, others hate it, but any person uses numbers everyday to buy things, pay for services, estimated time and necessary resources. People have been wondering about numbers’ properties for thousands of years. Famous 20th century mathematician G. H. You will even pass a cryptographic quest!...
Combinatorics and Probability
by Alexander S. Kulikov , Владимир Подольский- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 21 hours to complete
Counting is one of the basic mathematically related tasks we encounter on a day to day basis. The main question here is the following. If we need to count something, can we do anything better than just counting all objects one by one? All these questions are addressed by a mathematical field called Combinatorics....
Algorithms on Graphs
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 55 hours to complete
If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. In this course, you will first learn what a graph is and what are some of the most important properties. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project....
Algorithms on Strings
by Alexander S. Kulikov , Michael Levin , Pavel Pevzner , Neil Rhodes- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Suffix Trees...
Delivery Problem
by Alexander S. Kulikov- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
We’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly?...
Advanced Algorithms and Complexity
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
You've learned the basic algorithms now and are ready to step into the area of more complex problems and algorithms to solve them. Advanced algorithms build upon basic ones and use new ideas. We then proceed to linear programming with applications in optimizing budget allocation, portfolio optimization, finding the cheapest diet satisfying all requirements and many others....
Genome Assembly Programming Challenge
by Alexander S. Kulikov , Michael Levin , Pavel Pevzner , Neil Rhodes- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
In Spring 2011, thousands of people in Germany were hospitalized with a deadly disease that started as food poisoning with bloody diarrhea and often led to kidney failure. It was the beginning of the deadliest outbreak in recent history, caused by a mysterious bacterial strain that we will refer to as E....
Top Online Courses and Specializations | Coursera
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Find Courses and Specializations from top universities like Yale, Michigan, Stanford, and leading companies like Google and IBM. Join Coursera for free and transform your career with degrees, certificates, Specializations, & MOOCs in data science, computer science, business, and dozens of other topics....
Coursera | Online Courses & Credentials From Top Educators. Join for Free
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Learn online and earn valuable credentials from top universities like Yale, Michigan, Stanford, and leading companies like Google and IBM. Join Coursera for free and transform your career with degrees, certificates, Specializations, & MOOCs in data science, computer science, business, and dozens of other topics....
Course Definition & Meaning - Merriam-Webster
- 0.0
-
![]()
![]()
![]()
![]()
![]()
course: [noun] the act or action of moving in a path from point to point....
Free Online Courses | Stanford Online
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Free Online Courses. Our free online courses provide you with an affordable and flexible way to learn new skills and study new and emerging topics. Learn from Stanford instructors and industry experts at no cost to you....
Previous
