teaching - Neal E. Young

Breadcrumbs

Search

teaching

graduate courses

fall 2009 cs218, design and analysis of algorithms (TR 12:40-2:00pm, ENGR2 142)
winter 2009 cs270, research seminar
spring 2008 cs260, approximation algorithms
winter 2008 cs215, theory of computation
spring 2007 cs260, approximation algorithms
winter 2006 cs260, approximation algorithms
fall 2004 cs215, theory of computation
winter 2004 cs260, approximation algorithms

undergraduate courses

spring 2009 cs141, intermediate data structures and algorithms
fall 2007 cs141, intermediate data structures and algorithms
spring 2007 cs145, combinatorial optimization algorithms
fall 2006 cs141, intermediate data structures and algorithms
spring 2006 cs141, intermediate data structures and algorithms
winter 2006 cs141, intermediate data structures and algorithms
fall 2005 cs141, intermediate data structures and algorithms
winter 2005 cs141, intermediate data structures and algorithms
spring 2004 cs141, intermediate data structures and algorithms
Dartmouth, 1997 Advanced undergraduate algorithms
Dartmouth, 1996 Novel frameworks in theoretical CS

more at UCR

more elsewhere

Footer