Kruskal, C.P., and M. Snir (1986), A unified theory of interconnection network structure, Theor. Comput. Sci. 48, 75-94.

Leighton, F.T. (1985), Tight bounds on the complexity of parallel sorting, IEEE Trans. Comput. C-34, 344-354.

Leighton, T., and B. Maggs (1989), Expanders might be practical: Fast algorithms for routing around faults in multibutterflies, in Proc. 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, Calif, 384-389.

Leighton, T., and G. Plaxton (1990), A (fairly) simple circuit that (usually) sorts, in Proc. 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, Calif., 264-274.

Leighton, T., C.L. Leiserson, and M. Klugerman (1991), Theory of parallel and VLSI computation, Research Seminar Series Report MIT/LCS/RSS 10, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge.

Lisinski, D., T. Leighton, and B. Maggs (1990), Empirical evaluation of randomly-wired multistage networks, in Proc. 1990 International Conference on Computer Design, IEEE Computer Society Press, Los Alamitos, Calif., 380-385.

Lubotzky, A., R. Phillips, and P. Sarnak (1988), Ramanujan graphs, Combinatorica 8, 261-277.


Rettberg, R.D., W.R. Crowther, P.P. Carvey, and R.S. Tomlinson (1990), The monarch parallel processor hardware design, Computer 23, 18-30.


Upfal, E. (1989), An O(log N) deterministic packet routing scheme, in Proc. 21st Annual ACM Symposium on Theory of Computing, ACM Press, New York, 241-250.



The National Academies | 500 Fifth St. N.W. | Washington, D.C. 20001
Copyright © National Academy of Sciences. All rights reserved.
Terms of Use and Privacy Statement