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 ...

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Development of more sophisticated ideas in data type and structure, with an introduction to the connection between data structures and the algorithms they support. Data abstraction. Controlled access ...

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.

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 ...

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 ...