How far has computer science moved past Knuth's TAoCP, if at all? The seminal book The Art of Computer Programming got its start in 1968. I have been finding references to it in many literature reviews, apparently there are many problems for which a review by Knuth done in the 1970s has remained state-of-the-art up until today. It is amazing to me that so many of the theoretical developments of the time have survived decades of the obsolescence cycles that have eliminated all of their original implementations.

What fraction of the content of TAoCP have been eclipsed by later research? If an algorithm is found in TAoCP, what are the odds that a better one is out there in today's literature?
Matrix multiplication exponent has been improved and integer multiplication has recently reached speculated optimal complexity.

Perhaps Han`s sorting applies if correct (on which there was a post here).

Note Knuth`s book is his view. 

Modern view is richer. For example I doubt Knuth has spent much time on $NC$ algorithms for perfect matching or derandomization of primality or linear programming or counting algorithms.

So perhaps the algorithms he studies probably on whole not much more progress. However the analogy to mathematics that mathematics problems open in classical view does not mean mathematics has not moved forward holds in algorithms.