Designing Algorithms

Speaker:  Ricardo Baeza-Yates – Palo Alto, CA, United States
Topic(s):  Computational Theory, Algorithms and Mathematics

Abstract

This presentation is a tour of different paradigms to design algorithms using one of the most classical algorithmic problems: searching. Starting from sequential search and adding either resources or constraints, the tour explores finite resources, infinite spaces, parallel processing, non-atomic objects, etc. The paradigms covered include divide and conquer, balancing, dynamic programming, among others. Together with the algorithmic solution, the complexity of each one is also obtained.

About this Lecture

Number of Slides:  60
Duration:  45 - 120 minutes
Languages Available:  English, Portuguese, Spanish
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.