Howard Karloff

Papers

Total Citations

H-Index

About

Howard Karloff is a leading figure in theoretical computer science, with foundational contributions spanning approximation algorithms, linear programming, and randomized algorithms. His work on "Randomized robot navigation algorithms" (1996, 44 citations) addresses the challenge of a mobile robot navigating through an unmapped plane with oriented rectangular obstacles, assuming no prior knowledge of obstacle positions or sizes. This research is pivotal in robotics and algorithmic motion planning, demonstrating how randomization can enable efficient exploration and pathfinding in unknown environments. Beyond this, Karloff is renowned for his deep results in combinatorial optimization and graph theory, including influential work on the hardness of approximation and the design of polynomial-time approximation schemes. His book "Linear Programming" is a classic resource, widely used by students and researchers. With over 10,000 total citations, Karloff’s impact is evident across algorithms, complexity theory, and operations research, making him a key reference for anyone studying the interplay between theory and practical computation.