Monday, November 4, 2013 - 4:00pm - 4:50pm
KEC 1001
Glencora Borradaile
Assistant Professor
School of EECS
Oregon State University
Abstract:
This pair of seminars will introduce the basics of computational complexity
(first talk) and algorithm design (second talk). These seminars are most
appropriate to those without a background in computer science but with a
certain mathematical maturity. In particular, I recommend it to our EE
compatriots who may wish to learn more about what their CS colleagues do.
In the first talk, I will cover what computation is, what NP and P mean, and
how we measure efficiency. In the second talk, I will cover some basic
techniques for designing algorithms: enumeration, divide and conquer, and
dynamic programming.
Speaker Biography:
Glencora Borradaile is an Assistant Professor in Computer Science at Oregon State University. Her research in algorithms started with traditional network flow and design problems in planar graphs. She still pursues these avenues, inspired by potential applications to problems in road networks, image processing and telecommunication networks. More broadly she is interested in discrete optimization problems but is likely to be drawn into any problem by her collaborators.
Glencora has a B.Sc. in Applied Mathematics from the University of Western
Ontario (2002) and a Ph.D. in Computer Science from Brown University (2008).
She rides her bike, walks, takes public transit and thinks you should too.
_______________________________________________
Colloquium mailing list
[email protected]
https://secure.engr.oregonstate.edu/mailman/listinfo/colloquium
