Current students

Anna Lubiw
David R. Cheriton School of Computer Science

In this talk I will look at geometric graph representations from the perspective of three issues: the algorithmic complexity of finding a representation; the bit complexity of the representation; and whether there is a morph between any two combinatorially equivalent representations.

Wednesday, October 31, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

DLS: Donald Knuth — All Questions Answered

Donald E. Knuth
Professor Emeritus of The Art of Computer Programming
Stanford University

Abstract: The speaker will answer any question on any subject.