SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 37-38, Issue C, 1992, Pages 95-118

New methods for using Cayley graphs in interconnection networks

(2) Cooperman, Gene a Finkelstein, Larry a

a NORTHEASTERN UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249012602 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/0166-218X(92)90127-V Document Type: Article

Times cited : (47)

References (18)

1
- 0025445531
- Group action graphs and parallel architectures
- (1990) SIAM J. Comput. , vol.19 , pp. 544-569
- Annexstein¹ Baumslag² Rosenberg³

2
- 0003361081
- Systems of Reductions
- Springer, Berlin
- (1987) Lecture Notes in Computer Science , vol.277
- Benninghofen¹ Kemmerich² Richter³

3
- 0000173448
- Strategies for interconnection networks: Some methods from graph theory
- (1986) J. Parallel Distribut. Comput. , vol.3 , pp. 433-449
- Bermond¹ Delome² Quisquater³

4
- 84915373414
- Solving permutation problems using rewriting rules
- Proceedings of International Symposium ISSAC '88, Rome, 1988, Lecture Notes in Computer Science, Springer, Berlin
- (1988) Symbolic and Algebraic Computation , vol.358 , pp. 364-377
- Brown¹ Cooperman² Finkelstein³

5
- 0024748610
- A new base change algorithm for permutation groups
- (1989) SIAM J. Comput. , vol.18 , pp. 1037-1047
- Brown¹ Finkelstein² Purdom³

6
- 84966235179
- Computing in permutation and matrix groups II: Backtrack algorithm
- (1982) Math. Comput. , vol.39 , pp. 671-680
- Butler¹

7
- 84915373413
- L. Campbell, G.E. Carlsson, V. Faber, M.R. Fellows, M.A. Langstone, J.W. Moore, A.P. Mullhaulpt and H.B. Sexton, Dense symmetric networks from linear groups, Preprint.

8
- 0001723938
- Construction of defining relators for finite groups
- (1973) Discrete Math. , vol.5 , pp. 105-129
- Cannon¹

9
- 0022106968
- Interconnection networks based on a generalization of cube-connected cycles
- (1985) IEEE Transactions on Computers , vol.34 , pp. 769-777
- Carlson¹ Cruthirds² Sexton³ Wright⁴

10
- 77957120491
- Regular graphs with small diameter as models for interconnection networks
- Boston, MA
- (1988) 3rd International Conference on Supercomputing , pp. 232-239
- Chudnovsky¹ Chudnovsky² Denneau³

11
- 84915405570
- A strong generating test and short presentations for permutation groups
- (1991) Journal of Symbolic Computation , vol.12 , pp. 475-497
- Cooperman¹ Finkelstein²

12
- 0009358691
- Fast group membership using a strong generating test for permutation groups
- E. Kaltofen, S.M. Watt, Springer, New York
- (1989) Computers and Mathematics , pp. 27-36
- Cooperman¹ Finkelstein² Purdom³

13
- 0025545828
- A random base change algorithm for permutation groups
- ACM, New York, Addison-Wesley, Reading, MA
- (1990) Proceedings of 1990 International Symposium on Symbolic and Algebraic Computation, Tokyo , pp. 161-168
- Cooperman¹ Finkelstein² Sarawagi³

14
- 0041046589
- A compact representation for permutation groups
- (1986) J. Algorithms , vol.7 , pp. 60-78
- Jerrum¹

15
- 0002896422
- Simple word problems in universal algebras
- J. Leech, Pergamon, Oxford
- (1970) Computational Problems in Abstract Algebras , pp. 263-297
- Knuth¹ Bendix²

16
- 0003746203
- Pitman, London, Wiley, New York
- (1986) Canonical Forms in Finitely Presented Algebras
- Le Chenadec¹

17
- 84915373412
- GROUP: A computer system for group-theoretical calculations
- University of Sydney
- (1973) M.Sc. Thesis
- Richardson¹

18
- 84949270483
- Computation with permutation groups
- S.R. Petrick, ACM, New York
- (1971) Proceedings Second Symposium on Symbolic and Algebraic Manipulation , pp. 23-28
- Sims¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.