default search action
Larry Finkelstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
- [c18]Stephen B. Seidman, Larry Finkelstein:
Software Offshoring ?^(a) Risks and Opportunities for Software Engineering Programs. CSEE&T 2004: 153
1990 – 1999
- 1997
- [j7]Gene Cooperman, Larry Finkelstein, Michael Tselman, Bryant W. York:
Constructing Permutation Representations for Matrix Groups. J. Symb. Comput. 24(3/4): 471-488 (1997) - 1996
- [j6]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry. Nord. J. Comput. 3(3): 203-219 (1996) - [e2]Larry Finkelstein, William M. Kantor:
Groups and Computation, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, June 7-10, 1995. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 28, DIMACS/AMS 1996, ISBN 978-0-8218-0516-9 [contents] - 1995
- [j5]László Babai
, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress:
Fast Monte Carlo Algorithms for Permutation Groups. J. Comput. Syst. Sci. 50(2): 296-308 (1995) - [c17]Gene Cooperman, Larry Finkelstein, Steve Linton:
Constructive recognition of a black box group isomorphic to GL(n,2). Groups and Computation 1995: 85-100 - [c16]Gene Cooperman, Larry Finkelstein, Michael Tselman:
Computing with Matrix Groups Using Permutation Representations. ISSAC 1995: 259-264 - 1994
- [j4]Gene Cooperman, Larry Finkelstein:
A Random Base Change Algorithm for Permutation Groups. J. Symb. Comput. 17(6): 513-528 (1994) - [c15]Gene Cooperman, Larry Finkelstein:
Permutation routing via Cayley graphs with an example for bus interconnection networks. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 47-56 - [c14]Gene Cooperman, Larry Finkelstein, Bryant W. York, Michael Tselman:
Constructing Permutation Representations for Large Matrix Groups. ISSAC 1994: 134-138 - 1993
- [e1]Larry Finkelstein, William M. Kantor:
Groups And Computation, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 7-10, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, DIMACS/AMS 1993, ISBN 978-0-8218-6599-6 [contents] - 1992
- [j3]Gene Cooperman, Larry Finkelstein:
New Methods for Using Cayley Graphs in Interconnection Networks. Discret. Appl. Math. 37/38: 95-118 (1992) - [c13]Gene Cooperman, Larry Finkelstein:
A Fast Cyclic Base Change for Permutation Groups. ISSAC 1992: 224-232 - 1991
- [j2]Gene Cooperman, Larry Finkelstein:
A Strong Generating Test and Short Presentation for Permutation Groups. J. Symb. Comput. 12(4/5): 475-498 (1991) - [c12]Gene Cooperman, Larry Finkelstein:
Combinatorial Tools for Computational Group Theory. Groups And Computation 1991: 53-86 - [c11]Larry Finkelstein:
Group Membership for Groups with Primitive Orbits Namita Sarawagi, Gene Cooperman, and 253. Groups And Computation 1991: 253-268 - [c10]László Babai
Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC 1991: 200-209 - [c9]László Babai
Fast Monte Carlo Algorithms for Permutation Groups. STOC 1991: 90-100 - 1990
- [c8]Gene Cooperman, Larry Finkelstein, N. Sarawagi:
Applications of Cayley Graphs. AAECC 1990: 367-378 - [c7]Gene Cooperman, Larry Finkelstein, N. Sarawagi:
A Random Base Change Algorithm for Permutation Groups. ISSAC 1990: 161-168
1980 – 1989
- 1989
- [j1]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
A New Base Change Algorithm for Permutation Groups. SIAM J. Comput. 18(5): 1037-1047 (1989) - [c6]Gene Cooperman, Larry Finkelstein, Paul Walton Purdom Jr.:
Fast Group Membership Using a Strong Generating Test for Permutation Groups. Computers and Mathematics 1989: 27-36 - [c5]Gene Cooperman, Larry Finkelstein, Eugene M. Luks:
Reduction of Group Constructions to Point Stabilizers. ISSAC 1989: 351-356 - 1988
- [c4]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry. AAECC 1988: 99-110 - [c3]Larry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton:
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. AWOC 1988: 247-256 - [c2]Cynthia A. Brown, Gene Cooperman, Larry Finkelstein:
Solving Permutation Problems Using Rewriting Systems. ISSAC 1988: 364-377 - 1986
- [c1]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Intelligent Backtracking Using Symmetry. FJCC 1986: 576-584
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: