Daniel M Kane

aniel Kane is an associate professor at UCSD with a joint appointment between the Department of Computer Science and Engineering and the Department of Mathematics. He has diverse research interests in mathematics and theoretical computer science, though most of his work fits into the broad categories of number theory, complexity theory or combinatorics.

Sort options

Advanced Algorithms and Complexity (Coursera)

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 will start with networks flows which are used in more typical applications such as optimal [...]
Average: 7 ( 4 votes )

Algorithms on Graphs (Coursera)

If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get [...]
Average: 8 ( 3 votes )

Data Structures (Coursera)

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different [...]
Average: 6 ( 4 votes )

Algorithmic Toolbox (Coursera)

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem [...]
Average: 7 ( 3 votes )