The link to old hws and mid-terms is given below.
In what follows I use HS, GJ, AHU(DS), [G] etc. These refer to the books
listed in the class WEB page (first handout). I also make reference to A.#
and these refer to some papers. There are two copies of these
papers in GSL (mailbox 159).
As pointed out below, some of those papers are available electronically
through this page (these are the one that you have access through the
library electronic journals). In the botom part of this page I list
where the material label A-1 -- A-117 is taken from. Some of it is available
electronically (see below).
As for the GSL papers, you may borrow them and copy them as LONG AS IT
IS FOR A SHORT PERIOD OF TIME. TRY NOT TO TAKE THEM FOR MORE THAN 10 - 15
MINUTES. Note that in the slides I have expanded on the material in the
papers. Also, the notation is not always the same in the slides and the papers
(it is better in the slides).
[AHU(DS): 16 - 30], [HS: 24 - 32], [G: Chapter 1 and 2 (A-97 - A117)] O notation is
from HS. The material also appears in other data structures and
algorithms textbooks.
A-1 -- A-7:
A-28 -- A-35:
A-51 -- A-59:
A-60 -- A-68:
A-87 -- A-95:
A-96 -- A-96:
A-97 -- A-115: This is from [G: Chapters 1 and 2]. Copies
of thise chapters are available in GSL. The book is on
reserve in the library.
SLIDES
The material in the slides was partially derived from the
following sources:
This notation is form [HS: 559 -562]. Similar notation appears
in [GJ: Section 6.1]. More information appears in [G: Chapter 1 (A-97 -
A117)].
Part of this material originates in A-16 and A-17 (see gsl pages).
Part of this material originates in [A.1 and A.7].
Grahams original paper are listed in [A.1 and A.7 (see below)].
Also in [G: Chapter 2: A-97 - A-117)].
Part of this material originates in [A.1 and A.7]
The slides were derived from the papers in GSL
A-25 - A-27. Note that the treatment in the slides
is simpler than in A-25 - A-27. But also note that the
treatement in A-25 - A-27 is much simpler than in other papers.
The slides were derived from the papers in GSL
A-19 - A-24. This is also discussed in [GJ].
See the paper and book in the papers in GSL A-97 - A104.
The slides were derived from the papers in GSL
A-28 - A-35.
The slides were derived from [HS] and
Graham's original Paper.
The slides were derived from chapter 10 in Handbook [G].
The slides were derived from A-35 to A-50. Note that I updated that
paper on the web on 4/18/2005.
This material is from [GJ]. It also includes some of the slides
in the introduction.
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from [GJ].
This material is from A-8 to A-18 below.
This comes from A-51 - A-59 below.
Sleator and Tarjan, Self-Adjusting Heaps, SIAM J. Comput., Vol 15 #1,
Feb. 1986.
M. Fredman and R. E. Tarjan,
Fibonacci Heaps and Their Uses ..., JACM, Vol 34, No, 3m
1987.
M. Fredman and R. E. Tarjan,
Fibonacci Heaps and Their Uses ..., JACM, Vol 34, No, 3m
1987.
Taken from Handbook.
This comes from A-96 - A-96 below.
This comes from A-87 - A-95 below.
PAPERS IN GSL (A-# Papers)
Pages taken from: Operating Systems Theory, Coffman and Denning,
Prentice Hall (197?)
Original Sources: Graham's List schedules original Paper
Graham's LPT original Paper
P-Complete Approximation Problems, Sahni and Gonzalez, JACM, Vol.
23, No. 3, 1976.
Original Paper
Gonzalez, TSP, Summary of
papers.
Gonzalez, LP Free Approximation Algorithm, IPL, 54, 1995.
T. Gonzalez, Clustering to Minimize the Minimum
intercluster distance, Theorectical Computer Science, 38, pp 293 -
306, 1985
A-36 -- A-50 (this paper will be updated)
Gonzalez, Min Edge length rectangular Partitions, Summary of
papers.
Flows in Networks, Ford and Fulkerson, Princeton
Press (196?)
Sleator and Tarjan, Self-Adjusting Heaps, SIAM J. Comput., Vol 15 #1,
Feb. 1986.
M. Fredman and R. E. Tarjan,
Fibonacci Heaps and Their Uses ..., JACM, Vol 34, No, 3m
1987.
From [H].
From Preparata and Shamos Computational Geometry
Book.
ktmm.pdf.pdf part.pdf.pdf part.pdf.pdf fptas.pdf.pdf fptas.pdf.pdf npcmisc.pdf.pdf mis.pdf.pdf hw1.pdf hw1.pdf hw1.pdf hw1.pdf hw1.pdf hw2.pdf hw2.pdf npccook.pdf.pdf npccook.pdf.pdf npccook.pdf.pdf npccook.pdf.pdf npccook.pdf.pdf npccook.pdf.pdf twosat.pdf.pdf hw3.pdf hw3.pdf hw3.pdf hw3.pdf npcapp.pdf.pdf npcapp.pdf.pdf npcapp.pdf.pdf npcapp.pdf.pdf