Understanding recurrences and its algorithmic analysis.

Abstract

Demo Lecture:

Recursion is a widely used concept in software development. Therefore, understanding the analysis of recurrences has a crucial role in algorithmic design. In this lecture, we will be discussing recurrences via divide and conquer algorithms, and working on how to solve recursion equations from various aspects and methods including recursion tree analysis and substitution method.

Bio:

Ozan Erat is a Ph. D. candidate and a visiting lecturer at Mount Holyoke College located in western Massachusetts. He currently teaches Data Structures and Algorithms classes. His research interests include digital image processing and computer vision applications. He uses artificial intelligence tools and frameworks to conduct his research in several topics such as underwater color correction algorithms, skin cancer detection.

Please join meeting in Halligan 102 or via Zoom.

Join Zoom Meeting: https://tufts.zoom.us/j/97183120811

Meeting ID: 971 8312 0811

Password: See colloquium email

Dial by your location: +1 646 558 8656 US (New York)

Meeting ID: 971 8312 0811

Passcode: See colloquium email