The SCEAS System
Navigation Menu

Journals in DBLP

J. Symb. Comput.
1991, volume: 12, number: 4/5

  1. David Bernard Alper Epstein, Derek F. Holt, Sarah Rees
    The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:397-414 [Journal]
  2. Steve Linton
    Double Coset Enumeration. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:415-426 [Journal]
  3. Steve Linton
    Constructing Matrix Representations of Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:427-438 [Journal]
  4. Charles C. Sims
    The Knuth-Bendix Procedure for Strings as a Substitute for Coset Enumeration. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:439-442 [Journal]
  5. Gregory Butler, John J. Cannon
    Computing Sylow Subgroups of Permutation Groups Using Homomorphic Images of Centralizers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:443-458 [Journal]
  6. Peter J. Cameron, John J. Cannon
    Fast Recognition of Doubly Transitive Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:459-474 [Journal]
  7. Gene Cooperman, Larry Finkelstein
    A Strong Generating Test and Short Presentation for Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:475-498 [Journal]
  8. Derek F. Holt
    The Computation of Normalizers in Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:499-516 [Journal]
  9. William M. Kantor
    Finding Composition Factors of Permutation Groups of Degree n < 10^6. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:517-526 [Journal]
  10. Charles R. Leedham-Green, Cheryl E. Praeger, Leonard H. Soicher
    Computing with Group Homomorphisms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:527-532 [Journal]
  11. J. S. Leon
    Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:533-583 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002