Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	H. Anand,V.C. Dumlr and H. Gupta, "A CombinatoriM Distribution Problem," Duke Math. J. 33, 757-769 (1966)
	2	W. Brown ed., Reviews in Graph Theory, Vol.l-2, Amer. Math. Soc., Providence, R.I., 1980
	3	R.G. Busacker and T.L. Saaty, Finite Graphs and Networks, McGraw-Hill, N.Y., N.Y. 1965
	4	H. Cam and J. Fortes, "Rearrangeabitity of Shuffle-Exchange Networks," 1990 Conf. on Frontiers of Massively Parallel Computation.
	5	Solomon W. Golomb , Soloman Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, 1981
	6	Hall, Combinatorial Theory, John Wiley & Sons, 1986
	7	Harary and Palmer, Graphical Enumeration, Acad. Press, N.Y., N.Y., 1973
	8	D.H. Lawrie, "Access and alignment of data in an array processor," IEEE Trans. Comp., Vol. C-25, 1145-1155, Dec. 1976
	9	H. Mine, Nonnegative Matrices, Wiley, N.Y., N.Y. 1987
	10	D.S. Parker, "Notes on shuffle/exchange type networks," IEEE Trans. Comp., Vol. C-29, 213-222, Mar. 1980
	11	M.C. Pease, "The Indirect Binary n-Cube Microprocessor Array," IEEE Trans. Comp., Vol. C-26, No. 5,458-473, May 1977
	12	George Pólya , R. C. H Read, Combinatorial enumeration of groups, graphs, and chemical compounds, Springer-Verlag New York, Inc., New York, NY, 1987
	13	C.S. Raghavendra and A. Varma, "Rearrangeability of the 5-Stage Shuffle/Exchange Network for N=8," 1986 IEEE International Conf. on Parallel Processing, 119-122
	14	R.C. Read, "The Enumeration of Locally Restricted Graphs," I and II, J. London Math. Soc. 34, 417-436 (1959); 35, 344-351 (1960)
	15	R.C. Read, "The Use of S-Functions in Combinatorial Analysis," Canad. J. Math.20, 808-841 (1968)
	16	J.H. Redfield, "The theory of group-reduced distributions," Amer. J. Math. 49, 433-455 (1927).
	17	Howard Jay Siegel, The universality of various types of SIMD machine interconnection networks, Proceedings of the 4th annual symposium on Computer architecture, p.70-79, March 23-25, 1977
	18	Steven Skiena, Implementing discrete mathematics: combinatorics and graph theory with Mathematica, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1991
	19	František Soviš, On rearrangeable networks of the shuffle-exchange type, Computers and Artificial Intelligence, v.7 n.4, p.359-373, 1988
	20	D. Steinberg, "Invarlartt Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network," IEEE Trans. Comput., Vo}. C-32, No. 5,444-450, May 1983
	21	H.S. Stone, "Parallel processing with the perfect shuffle," IEEE Trans. Comp., Vol. C-20,153-161, Feb.1971
	22	Abraham Waksman, A Permutation Network, Journal of the ACM (JACM), v.15 n.1, p.159-163, Jan. 1968  [doi>10.1145/321439.321449]
	23	H.S. Wiff, Generating}unctionoIogy, Academic Press, San Diego, 1990
	24	Stephen Wolfram, Mathematica: a system for doing mathematics by computer, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988
	25	C.L. Wu and T.Y. Feng, "The UniversMity of the Shuffle- Exchange Network," IEEE Trans. Comp., Vol. C-30, No. 5, 324-332, May 1981

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski