default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Groups and Computation 1995
- 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 - Foreward. Groups and Computation 1995: ix-
- Preface. Groups and Computation 1995: xi-
- Workshop Program. Groups and Computation 1995: xiii-
- Participants. Groups and Computation 1995: xv-
- László Babai:
Randomization in group algorithms: Conceptual questions. 1-17 - Gilbert Baumslag, Charles F. Miller III:
Experimenting and computing with infinite groups. 19-30 - Robert Beals:
Towards polynomial time algorithms for matrix groups. 31-54 - Frank Celler, Charles R. Leedham-Green:
Calculating the order of an invertible matrix. 55-60 - Frank Celler, Charles R. Leedham-Green:
A non-constructive recognition algorithm for the special linear and other classical groups. 61-67 - Gene Cooperman:
GAP/MPI: Facilitating parallelism. 69-83 - Gene Cooperman, Larry Finkelstein, Steve Linton:
Constructive recognition of a black box group isomorphic to GL(n,2). 85-100 - Bettina Eick:
Special presentations for finite soluble groups and computing(pre-) Frattini subgroups. 101-112 - Thomas Grüner, Reinhard Laue, Markus Meringer
:
Algorithms for group actions applied to graph generation. 113-122 - Jeffrey S. Leon:
Partitions, refinements, and permutation group computation. 123-158 - Eddie H. Lo:
A polycyclic quotient algorithm. 159-167 - Eugene M. Luks, Ákos Seress:
Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. 169-181 - David Keith Maslen, Daniel N. Rockmore:
Generalized FFT's- A survey of some recent results. 183-237 - Takunari Miyazaki:
The complexity of McKay's canonical labeling algorithm. 239-256 - Prabhav Morje:
On nearly linear time algorithms for Sylow subgroups of small basepermutation groups. 257-272 - Alice C. Niemeyer, Cheryl E. Praeger:
Implementing a recognition algorithm for classical groups. 273-296 - Gretchen Ostheimer:
Algorithms for polycyclic-by-finite matrix groups. 297-308 - László Pyber:
Asymptotic results for simple groups and some applications. 309-327 - Daniel N. Rockmore:
Some applications of generalized FFT's. 329-369 - Michael Tselman:
Constructing permutation representations for matrix groups in parallel environments. 371-382
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.
last updated on 2024-11-15 19:19 CET 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:
