Michael M. Hoffmann

Papers

Total Citations

H-Index

About

Michael M. Hoffmann is a theoretical computer scientist whose work explores the fundamental limits of algorithmic problem-solving, with a particular focus on computational geometry and motion planning. His most-cited paper, "Pushing blocks is hard" (2003, 31 citations), is a landmark contribution that rigorously demonstrates the computational complexity of seemingly simple physical tasks—specifically, the problem of pushing blocks to achieve a goal configuration. This work not only formalizes a classic puzzle into a hard complexity class but also provides deep insights into the interplay between physics and computation, influencing subsequent research in robotics, automated planning, and puzzle design. While his citation count reflects a focused, high-impact niche, Hoffmann's contributions are notable for their clarity and elegance, often bridging theoretical abstraction with tangible, intuitive problems. His research continues to inspire students and researchers interested in the boundaries of what computers can efficiently solve, making him a respected voice in the study of algorithmic hardness and geometric reasoning.