Princeton University / Brown University / University of Rochester / Dam Fellow / /
IndustryTerm
software transactional memory / road networks / Linear-time algorithms / planar graph algorithms / software transactional mem / Random road networks / linear-time algorithm / population protocol / population protocols / /
NaturalFeature
Steiner forest / /
Organization
Graduate School / Applied Science / School of Engineering and Applied Science / National Science Foundation / Brown University / Department of Computer Science / Princeton University / Computing Research Association / University of Rochester / Computer Science Department / /
Person
Stephen Soltesz / Jennifer Feder / Philip N. Klein / Sandhya Dwarkadas / Michael L. Scott / Amanda Redlich / James Aspnes / Eric Ruppert / Claire Mathieu / Marc Fiuczynski / Goran Konjevod / Gary Gordon / Dana Angluin / Lev Reyzin / William N. Scherer III / David Elliot Eisenstat / Leonid (Aryeh) Kontorovich / Greg Francos / Soner Sevinc / Rida A. Bazzi / Michael F. Spear / Larry Peterson / Christopher Heriot / Jiang Chen / Athul Acharya / Yitong Yin / /
Position
Advisors / Dean / /
ProvinceOrState
Rhode Island / Connecticut / /
PublishedMedium
Journal of Machine Learning Research / Theory of Computing / /
Technology
Linear-time algorithms / population protocol / planar graph algorithms / Machine Learning / population protocols / linear-time algorithm / /
Abstract of “ Toward Practical Planar Graph Algorithms ” by David Elliot Eisenstat, Ph.D., Brown University, May 2014 Many optimization problems involving graphs naturally feature road networks, grids, or other large