Graduate classes of E.L. Lloyd
-
CIS621 - Algorithm Design and Analysis
An introductory graduate level course. Topics include: basic and advanced data structures including heaps, 2-3 trees,
binomial and fibonacci heaps and union/find algorithms; sorting and searching including lower bounds; minimum spanning trees
and shortest path algorithms; dynamic programming; matrix multiplication; FFT and NP-completeness. Offered every Fall semester, usually Tue/Thur at 8AM.
-
CIS829 - Advanced Algorithms
A course examining a range of advanced algorithmic topics. In the most recent offering, the following topics were
covered: approximation algorithms for NP-hard optimization problems (this was a major emphasis); string matching;
additional data structures beyond those in 621; computational geometry; and some advanced
parallel algorithms. Offered every second or third year.
-
CIS829 - Computational Geometry
A course studying fundamental data structures and algorithms from computational geometry with an
emphasis on their applications to computer graphics and computer vision. This course is team taught
with Professor Jingyi Yu.
Offered for the first time in 2008.
-
CIS829 - Parallel Algorithms
This is a course on the design and analysis of parallel algorithms.
Emphasis will be given both to specific parallel algorithms and to
general techniques used in the design of parallel algorithms. Among the
topics to be covered are: lists, trees, searching, sorting, several graph
problems, convex hulls, and string problems. Offered sporadically.
-
SIGNEWGRAD
This one credit course gives 1st year graduate students in the Computer Science department
an introduction to graduate school and to the research of the CIS faculty. Topics covered
include: Why graduate school? What grad school is all about; What about research? PhD preliminary
exam discussion; the UD library; Latex; academic careers; industrial careers; professional networking;
life balance; survival skills and issues. There is also a 25 minute talk by each CIS faculty member
on their research.
Offered each Fall semester.
"In this country, Sir, there are two kinds of roads - the hard road
for the common people and the easy road for royalty. Unfortunately,
there is no royal road to geometry"
Said by Euclid to King Ptolemy I of Egypt in approximtely 300BC.