Bibliography

1

Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, and Amit Kumar.
Approximation algorithms for the unsplittable flow problem.
Algorithmica, 2005.
To appear.

2

Amit Chakrabarti, Subhash Khot, and Xiaodong Sun.
Near-optimal lower bounds on the multi-party communication complexity of set disjointness.
In Proc. 18th Annual IEEE Conference on Computational Complexity, pages 107-117, 2003.

3

Amit Chakrabarti and Oded Regev.
An optimal randomised cell probe lower bound for approximate nearest neighbour searching.
In Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
to appear.

4

Amit Chakrabarti.
Lower Bounds in Computer Science: course plan, homeworks and solutions.
http:// www.cs.dartmouth.edu/~ ac/Teach/CS85-Fall03/, December 2003.

5

Amit Chakrabarti.
Dartmouth Theory Seminars: current and previous terms.
http://www.cs.dartmouth.edu/ ~ ac/DTS/, regularly updated.