Author:
Cooperman G.,Finkelstein L.,Sarawagi N.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. F. Annexstein, M. Baumslag, A.L. Rosenberg, “Group Action Graphs and Parallel Architectures”, COINS Technical Report 87–133, Computer and Information Science Department, University of Massachusetts (1987).
2. L. Babai, W.M. Kantor and A. Lubotsky, “Small diameter Cayley graphs for finite simple groups”, European Journal of Combinatorics 10 (1989), pp. 507–522.
3. J-C. Bermond, C. Delome, and J-J. Quisquater, “Strategies for interconnection networks: Some methods from graph theory”, Journal of Parallel and Distributed Computing 3 (1986), pp. 433–449.
4. C.A. Brown, G. Cooperman, and L. Finkelstein, “Solving Permutation Problems Using Rewriting Rules”, Symbolic and Algebraic Computation (Proc. of International Symposium ISSAC '88, Rome, 1988), Springer Verlag Lecture Notes in Computer Science 358, 364–377.
5. L. Campbell, G.E. Carlsson, V. Faber, M.R. Fellows, M.A. Langston, J.W. Moore, A.P. Mullhaupt, and H.B. Sexton, “Dense Symmetric Networks from Linear Groups”, preprint.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献