Greetings! I am currently a Software Engineer at Google. Prior to joining Google I worked at Microsoft Research and before that I worked at IBM. I received my PhD in Computer Science from UNH in 2014 where I worked with Professor Wheeler Ruml in the area of Combinatorial Search. My research focus was in scaling combinatorial search algorithms with parallel processing, external memory, and techniques that achieve linear space complexity. I am interested in problems where advanced algorithmic ideas can contribute to bringing previously intractable problems within reach.
Matthew Hatem, Ethan Burns and Wheeler Ruml, Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search, Journal of Artificial Intelligence Research, 2018 PDF
Matthew Hatem, Scott Kiesel and Wheeler Ruml, Recursive Best-First Search with Bounded Overhead, Proceedings of the Twenty-ninth AAAI Conference on Artificial Intelligence, 2015 PDF
Matthew Hatem and Wheeler Ruml, Simpler Bounded Suboptimal Search, Proceedings of the Twenty-eigth AAAI Conference on Artificial Intelligence, 2014 PDF
Matthew Hatem and Wheeler Ruml, External Memory Best-First Search for Multiple Sequence Alignment, Proceedings of the Twenty-seventh AAAI Conference on Artificial Intelligence, 2013 PDF
Matthew Hatem, Ethan Burns, and Wheeler Ruml, Heuristic Search for Large Problems With Real Costs, Proceedings of the Twenty-fifth AAAI Conference on Artificial Intelligence, 2011 PDF