Larry Finkelstein

According to our database1, Larry Finkelstein authored at least 23 papers between 1986 and 2004.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Software Offshoring ?^(a) Risks and Opportunities for Software Engineering Programs.
Proceedings of the 17th Conference on Software Engineering Education and Training (CSEE&T 2004), 2004

1997
Constructing Permutation Representations for Matrix Groups.
J. Symb. Comput., 1997

1996
Backtrack Searching in the Presence of Symmetry.
Nord. J. Comput., 1996

1995
Fast Monte Carlo Algorithms for Permutation Groups.
J. Comput. Syst. Sci., 1995

Computing with Matrix Groups Using Permutation Representations.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

Constructive recognition of a black box group isomorphic to GL(n,2).
Proceedings of the Groups and Computation, 1995

1994
A Random Base Change Algorithm for Permutation Groups.
J. Symb. Comput., 1994

Constructing Permutation Representations for Large Matrix Groups.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

Permutation routing via Cayley graphs with an example for bus interconnection networks.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1992
New Methods for Using Cayley Graphs in Interconnection Networks.
Discret. Appl. Math., 1992

A Fast Cyclic Base Change for Permutation Groups.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
A Strong Generating Test and Short Presentation for Permutation Groups.
J. Symb. Comput., 1991

Nearly Linear Time Algorithms for Permutation Groups with a Small Base.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

Group Membership for Groups with Primitive Orbits Namita Sarawagi, Gene Cooperman, and 253.
Proceedings of the Groups And Computation, 1991

Combinatorial Tools for Computational Group Theory.
Proceedings of the Groups And Computation, 1991

1990
A Random Base Change Algorithm for Permutation Groups.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

Applications of Cayley Graphs.
Proceedings of the Applied Algebra, 1990

1989
A New Base Change Algorithm for Permutation Groups.
SIAM J. Comput., 1989

Reduction of Group Constructions to Point Stabilizers.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

Fast Group Membership Using a Strong Generating Test for Permutation Groups.
Proceedings of the Computers and Mathematics, 1989

1988
Solving Permutation Problems Using Rewriting Systems.
Proceedings of the Symbolic and Algebraic Computation, 1988

Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1986
Intelligent Backtracking Using Symmetry.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986


  Loading...