Computer Scientist Finds Small-Memory Algorithm for Fundamental Graph Problem
January 1, 2005
Sara Robinson
Important connections are often made serendipitously, by researchers attempting to prove something else. Such was the case in the 1970s when Leslie Valiant, now a professor of computer science at Harvard University, discovered that a type of graph defined by researchers in information theory had important implications for computer science, implications that continue to be explored to this day.