Sriram Sankaranarayanan

Sriram Sankaranarayanan is an assistant professor of Computer Science at the University of Colorado, Boulder. His research interests include automatic techniques for reasoning about the behavior of computer and cyber-physical systems. Sriram obtained a PhD in 2005 from Stanford University where he was advised by Zohar Manna and Henny Sipma. Subsequently he worked as a research staff member at NEC research labs in Princeton, NJ. He has been on the faculty at CU Boulder since 2009. Sriram has been the recipient of awards including the President's Gold Medal from IIT Kharagpur (2000), Siebel Scholarship (2005), the CAREER award from NSF (2009) and the Dean's award for outstanding junior faculty for the College of Engineering at CU Boulder (2012).

More info: http://www.cs.colorado.edu/~srirams/

Sort options

Dynamic Programming, Greedy Algorithms (Coursera)

Nov 29th 2021
Dynamic Programming, Greedy Algorithms (Coursera)
Course Auditing
Categories
Effort
Languages
This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data [...]
0
No votes yet

Algorithms for Searching, Sorting, and Indexing (Coursera)

This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder’s Master of [...]
0
No votes yet

Trees and Graphs: Basics (Coursera)

Nov 29th 2021
Trees and Graphs: Basics (Coursera)
Course Auditing
Categories
Effort
Languages
Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data. Trees and Graphs: Basics can be taken for academic credit as part [...]
0
No votes yet