The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst ...

Algorithm design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic analysis, recursion equations, estimation methods, elementary combinatorial arguments.

Complexity Theory and Polynomial Time Algorithms Publication Trend The graph below shows the total number of publications each year in Complexity Theory and Polynomial Time Algorithms.

He is the author of the multi-volume work, the magnum opus, The Art of Computer Programming. He made several key contributions to the rigorous analysis of the computational complexity of algorithms.

The Annals of Statistics, Vol. 42, No. 6 (December 2014), pp. 2164-2201 (38 pages) We provide theoretical analysis of the statistical and computational properties of penalized M-estimators that can be ...

Researchers at the Sanford Burnham Prebys Medical Discovery Institute (SBP) say they have begun the first comparative analysis of a new category of algorithms that mine genetic information in ...