Larry Finkelstein
Larry Finkelstein
Dirección de correo verificada de ccs.neu.edu
Título
Citado por
Citado por
Año
Fast Monte Carlo algorithms for permutation groups
L Babai, G Cooperman, L Finkelstein, E Luks, A Seress
Journal of Computer and System Sciences 50 (2), 296-308, 1995
1081995
Backtrack searching in the presence of symmetry
CA Brown, L Finkelstein, PW Purdom
International Conference on Applied Algebra, Algebraic Algorithms, and Error …, 1988
1041988
Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
J Cozzens, L Finkelstein
IEEE Transactions on Information Theory 31 (5), 580-588, 1985
931985
The maximal subgroups of Conway's group C3 and McLaughlin's group
L Finkelstein
Journal of Algebra 25 (1), 58-89, 1973
861973
New methods for using Cayley graphs in interconnection networks
G Cooperman, L Finkelstein
Discrete Applied Mathematics 37, 95-118, 1992
731992
Maximal subgroups of the Hall-Janko-Wales group
L Finkelstein, A Rudvalis
Journal of Algebra 24 (3), 486-493, 1973
661973
Nearly linear time algorithms for permutation groups with a small base
L Babai, G Cooperman, L Finkelstein, Á Seress
Proceedings of the 1991 international symposium on Symbolic and algebraic …, 1991
581991
Constructing permutation representations for matrix groups
G Cooperman, L Finkelstein, M Tselman, B York
Journal of Symbolic Computation 24 (3-4), 471-488, 1997
561997
Applications of cayley graphs
G Cooperman, L Finkelstein, N Sarawagi
International symposium on applied algebra, algebraic algorithms, and error …, 1990
521990
The maximal subgroups of Janko's simple group of order 50, 232, 960
L Finkelstein, A Rudvalis
Journal of Algebra 30 (1-3), 122-143, 1974
421974
A new base change algorithm for permutation groups
CA Brown, L Finkelstein, PW Purdom, Jr
SIAM Journal on Computing 18 (5), 1037-1047, 1989
341989
Combinatorial tools for computational group theory
G Cooperman, L Finkelstein
Groups and Computation 11, 53-86, 1993
331993
Backtrack searching in the presence of symmetry
CA Brown, L Finkelstein, PW Purdom Jr
Nordic Journal of Computing 3 (3), 203-219, 1996
271996
A random base change algorithm for permutation groups
G Cooperman, L Finkelstein, N Sarawagi
Proceedings of the international symposium on Symbolic and algebraic …, 1990
231990
Range and error analysis for a fast Fourier transform computed over
J Cozzens, L Finkelstein
IEEE transactions on information theory 33 (4), 582-590, 1987
211987
Constructive recognition of a black box group isomorphic to GL (n, 2).
G Cooperman, L Finkelstein, S Linton
Groups and Computation, 85-100, 1995
201995
Groups and Computation: Workshop on Groups and Computation, October 7-10, 1991
L Finkelstein, WM Kantor
American Mathematical Soc., 1993
181993
Applying the classification theorem for finite simple groups to minimize pin count in uniform permutation architectures
L Finkelstein, D Kleitman, T Leighton
Aegean Workshop on Computing, 247-256, 1988
171988
A random base change algorithm for permutation groups
G Cooperman, L Finkelstein
Journal of Symbolic Computation 17 (6), 513-528, 1994
141994
A strong generating test and short presentations for permutation groups
G Cooperman, L Finkelstein
Journal of symbolic computation 12 (4-5), 475-497, 1991
141991
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20