Bibliography

1

Jaikumar Radhakrishnan and Pranab Sen, ``Notes on Entropy and Graph Entropy'', lecture notes for the MTTCS00 workshop. (contact jaikumar@tcs,tifr.res.in for a copy.)

2

V.I. Arnold, M. Atiyah, P. lax and B. Mazur (eds): Mathematics, Frontiers and Perspectives, American Mathematical Society, 1999.

3

T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley 1991.

4

K. Denbigh, ``How subjective is entropy?'', in Maxwell's Demon, Entropy, Infromation, Computing, H.S. Leff and A.F. rex (eds), A. Hilger, Bristol 1990.

5

U. Feige, ``Approximating the bandwidth via volume respecting embeddings'', J. Comp. and Systems Sciences 60(3) 510-539, 2000.

6

G. Gamov, Mr. Tomkins in Paperback, Cambridge University Press, Cambride 1965.

7

M. Tribus, Boelter Anniversary Volume, McGraw Hill, New York 1963.

8

Graham R. Brightwell, Balanced Pairs in Partial Orders, Technical report LSE-CDAM-98-14 http://www.cdam.lse.ac.uk/
Reports/reports98.html.

9

Lá'szlo Babai, The Forbidden Sidetrip, in People and Ideas in theoretical Computer Science, Springer 1999 (editor C. S. Calude): 1-31.

10

Borgs, C., Chayes, J. T. and Randall, D., The Van den Berg-Kesten-Reimer inequality. in Perplexing Problems in Probability: Festschrift in honor of Harry Kesten, Birkhauser 1999 (M. Bramson and R. Durrett, editors): 159-173.

11

Johnson-Lindenstrauss Embedding, Lecture notes for course on Randomized Algorithms, Fall 1999, lecture 4, at http://www.cc.gatech.edu/
people/home/schulman/ra99.html.

12

Linial, London, and Rabinovich, ``The Geometry of Graphs and Some of its Algorithmic Applications'', Combinatorica, 15, 1995.

13

Nathan Linial, Yishay Mansour, Noam Nisan: ``Constant Depth Circuits, Fourier Transform, and Learnability''. J.ACM 40(3): 607-620 (1993).

14

Jeff Kahn, Jeong Han Kim, ``Entropy and Sorting''. JCSS 51(3): 390-399 (1995).

15

Jeff Kahn, Gil Kalai, Nathan Linial, ``The Influence of Variables on Boolean Functions (Extended Abstract)''. FOCS 1988: 68-80.

16

Nathan Linial, ``The Information-Theoretic Bound is Good for Merging''. SIAM J. Comput. 13(4): 795-801 (1984).

17

Eugene M. Luks, "Isomorphism of Graphs of Bounded Valance Can Be Tested in Polynomial Time", Journal of Computer and System Sciences 25(1) (1982) 42-65.