CSE 5401
Advanced Algorithms
Provides a broad coverage of fundamental algorithm design techniques with the focus on developing efficient algorithms for solving combinatorial and optimization problems. The topics covered include: review of greedy algorithms, dynamic programming, NP-completeness, approximation algorithms, use of linear and convex programming for approximation, and on-line algorithms. Throughout this course there is an emphasis on correctness proofs and the ability to apply the techniques taught to design efficient algorithms for problems from a wide variety of application areas. Prerequisites: CSE 347 Revised: 2019-02-21
Instructors
Reviews
Professor Baruah was chill. His class is extremely difficult, but you'll likely struggle with everyone else so it's fine. Just study and you'll survive
5/8/2025
Very smart and great communicator of complex ideas. He would walk through concepts step by step to ensure understanding. Made me actually understand algorithms
2/1/2025
Really cares what students get out of the course. He has clear objectives about what to teach, and we achieved them by the end of the course. Could improve communication of some definitions and relies on you doing a lot of "recommended" reading which is not optional in order to well. Better than other algorithms courses at conveying deep material.
1/16/2022
This semester's Prof. Buhler is perfect in 541T and last semester on 347. During COVID, he is very accommodating and caring, holds very interactive class sessions, gives very nice feedbacks, and gives very interesting lecture videos. His only con was poor handwriting, which gets avoided from this semester. You learn a lot from him, a thinker.
5/8/2021
Baruah was fantastic at explaining complex concepts. Many of the early WashU classes (247 in particular) are very deficient in what they teach. Baruah was great at figuring out exactly what Cytron missed in 247 and explaining it clearly.
10/5/2019
You'll learn the core material of nonlinear optimization pretty solidly, as that's the part Dr. Chen covers himself. The modern stuff is, unfortunately, left to students (who are all assigned to groups, each group giving one lecture on modern techniques). Some of the student lectures were excellent, but others left quite a bit to be desired.
1/10/2018
You really need to be on top of your game throughout to really ace this class. To rephrase, it is a matter of time, as to when you start feeling lost. Easier material tough exams and homework Tough material pretty straightforward (but still tough) Extra credit is up to 4 points on 100 where you need to correct around 25 solutions/point
5/9/2017
Buhler is a basic professor who is out to prove a point. If you really want to learn the concepts, take an online Algorithms course, or just read CLRS by yourself. You'll learn more and get your money's worth. 541T is not worth the tuition cost or time. If you do take it, be sure to cheat on HW. Everyone else does.
12/21/2016
Get the core knowledge of nonlinear optimization from a series of insightful lectures, notes, and examples. No deep theories or hard maths, suitable for those who want to apply optimization in their research or practical problems.
5/10/2016
Buhler will work you to death but in the end you realize that you learned more from him than everything else you did with your undergraduate career. Almost everything that makes me a strong computer scientist I learned from this guy. And his stories are great.
2/7/2008
If you can tolerate a jolly man giving 1.5 hour long proofs on the chalkboard, this is the class for you. The course material is interesting, but I would recommend bringing a crossword puzzle to class.
12/5/2007
As a rising star in computational biology algorithms, Jeremy simply oozes intellegence. Naturally, many problems deemed reasonable by him are often more challenging to the average student. Bright and upbeat in class, resourceful out of class, and always ready to discuss theory, Jeremy is indeed a gem of CSE.
12/25/2005
Prof. Buhler is one of the smartest guys you will ever meet. His classes are hard but he will teach you what you ened to know.
12/17/2005