Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Download to read offline
Sign up for a Scribd free trial to download now.
Download with free trialDownload to read offline
Sign up for a Scribd free trial to download now.
Download with free trialThis is a three part talk, where I give some historical context to computer science, then do a pitch for the field (from the point of view of prospective students), and then I talk about my three different research threads (proof complexity of linear algebra, 0-1 combinatorial matrices, string algorithms), and finish with a talk about security - where I mostly do consulting work.
Be the first to like this
This is a three part talk, where I give some historical context to computer science, then do a pitch for the field (from the point of view of prospective students), and then I talk about my three different research threads (proof complexity of linear algebra, 0-1 combinatorial matrices, string algorithms), and finish with a talk about security - where I mostly do consulting work.
Total views
1,362
On Slideshare
0
From embeds
0
Number of embeds
20
Downloads
35
Shares
0
Comments
0
Likes
0
Join the community of over 1 million readers
Join the community of over 1 million readers
Sign up for a Scribd 30 day free trial to download this document plus get access to the world’s largest digital library.
Cancel anytime.The SlideShare family just got bigger. You now have unlimited* access to books, audiobooks, magazines, and more from Scribd.
Cancel anytime.