Name Last modified Size Description
Parent Directory - README 1995-07-30 02:00 1.4K acorn.ps 1995-07-30 02:00 236K dynamic-routing.ps 1995-07-03 02:00 195K expansion.ps 1995-07-25 02:00 1.3M isoperimetric.ps 1995-07-25 02:00 580K markov.ps 1995-07-25 02:00 564K multicut.ps 1995-07-25 02:00 291K rand-color.ps 1995-07-25 02:00 969K thesis.ps 1995-06-23 02:00 3.2M
dynamic-routing.ps Nabil Kahale and Tom Leighton. Greedy Dynamic Routing on Arrays. A preliminary version appeared in the Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 558-566. SIAM, 1995. markov.ps Nabil Kahale. Large deviation bounds for Markov chains. DIMACS Tech Report 94-39, 1994. rand-color.ps Noga Alon and Nabil Kahale. A spectral technique for coloring random 3-colorable graphs. DIMACS Tech Report 94-35, 1994. A preliminary version appeared in the Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 346-355. ACM Press, 1994. isoperimetric.ps Nabil Kahale. Isoperimetric Inequalities and Eigenvalues. DIMACS Tech Report 93-83R, 1993. multicut.ps Nabil Kahale. On reducing the cut ratio to the multicut problem, DIMACS Tech Report 93-78, 1993. acorn.ps Nabil Kahale and Leonard Schulman. Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. August 1993. Modified June 1995. Accepted for publication in Combinatorica. expansion.ps Nabil Kahale. Eigenvalues and Expansion of Regular Graphs. DIMACS Tech Report 93-70R, 1993. Shorter version accepted for publication in the Journal of the ACM. thesis.ps Nabil Kahale. Expander Graphs. PHD Thesis, Massachusetts Institute of Technology. MIT Laboratory for Computer Science, Technical Report MIT/LCS/TR-591.