neal young / research

I work on the design and analysis of efficient approximation algorithms for computing near-optimum solutions to combinatorial optimization problems, including problems related to linear programming and online algorithms for paging and caching.

For explanations of these terms, see this glossary.

Here are copies of publications I've authored or coauthored.

publications by area

graduate students


More Information

Footer