- J. Symbolic Computation (2003) 17, 513{528 A Random Base Change Algorithm
- Efficient Mining of Max Frequent Patterns in a Generalized Environment
- SymGrid: a Framework for Symbolic Computation on the Grid
- Task Oriented Parallel C/C++: A Tutorial (Version 0.92) Gene Cooperman
- Proc. of Int. Symposium on Symbolic and Algebraic Manipulation (ISSAC-94), ACM Press, 1994 1 Constructing Permutation Representations
- Parallel GAP Gene Cooperman
- Marshalgen: A Package for SemiAutomatic Marshaling of Objects
- MemoryBased and DiskBased Algorithms for Very High Degree Permutation Groups
- Appl. Algebra, Alg. Algo. and Error-Correcting Codes (AAECC-8, 1990) Springer-Verlag Lecture Notes in Comp. Sci. 508 APPLICATIONS OF CAYLEY GRAPHS
- J. Symbolic Computation (2004) 11, 1--000 Constructing Permutation Representations
- Static Performance Evaluation for Memory-Bound Computing: the MBRAM Model
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras
- isk-based computation rep-resents a major new use of
- SymGrid: A Framework for Symbolic Computation on the Grid
- Fast Multiplication of Large Permutations for Disk, Flash Memory and RAM
- Parallel Disk-Based Computation for Large, Monolithic Binary Decision Diagrams
- DMTCP: Transparent Checkpointing for Cluster Computations and the Desktop Jason Ansel
- A Disk-Based Parallel Implementation for Direct Condensation of Large Permutation Modules
- A Comparative Analysis of Parallel Disk-Based Methods for Enumerating Implicit Graphs
- Parallelization of Geant4 Using TOP-C and Marshalgen Gene Cooperman Viet Ha Nguyen
- Adaptive Checkpointing for Master-Worker Style Parallelism (Extended Abstract)
- Marshalgen: Marshaling Objects in the Presence of Polymorphism
- Memory-Based and Disk-Based Algorithms for Very High Degree Permutation Groups
- Marshalgen: A Package for Semi-Automatic Marshaling of Objects
- Overcoming the Memory Wall in Symbolic Algebra: A Faster Permutation Multiplication
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- PERMUTATION ROUTING VIA CAYLEY GRAPHS WITH AN EXAMPLE FOR
- A Strong Generating Test and Short Presentations for Permutation Groups
- Faculty Handbook 1999 -2000 edition page i Northeastern University
- Progress Report Toward a Thread-Parallel Geant4 Gene Cooperman and Xin Dong
- TOP-C (Task Oriented Parallel C/C++) A Package for Easily Writing Parallel Applications
- Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational
- Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational Grid
- Transparent Adaptive Library-Based Checkpointing for Master-Worker Style Parallelism
- Journal of Symbolic Computation 33, pp. 563{585 Scalable Parallel Coset Enumeration: Bulk
- Fast Monte Carlo Algorithms for Permutation Groups L aszl o Babai 1;2 , Gene Cooperman 3 , Larry Finkelstein 3 , Eugene Luks 4 , and
- A Parallel Architecture for Disk-Based Computing over the Baby Monster and Other Large Finite Simple Groups
- TOP-WEB: Task-Oriented Metacomputing on the Gene Cooperman 3 and Victor Grinberg 3
- Biased Tadpoles: a Fast Algorithm for Centralizers in Large Matrix Groups
- Stroke Tissue Outcome Prediction Using A Spatially-Correlated Model Viet Ha Nguyen(1,3)
- GCD of Many Integers (Extended Abstract)
- ARTICLE IN PRESS Journal of Symbolic Computation ( )
- Parallel GAP: Mature Interactive Parallel Gene Cooperman \Lambda
- Static Performance Evaluation for MemoryBound Computing: the MBRAM Model
- STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems
- Computing with Matrix Groups using Permutation Representations Gene Cooperman 1 Larry Finkelstein 1
- Overcoming the Memory Wall in Symbolic Algebra: A Faster Permutation Multiplication
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- 236tI1 1 NS II"HrNS (ON IND)t Si ,Y \S.V(O \1INS. \ l. I,\-\17, NO. 2. M AR(H/APRI L1981 A New Current-Voltage Relation for Duct Precipitators
- Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational
- Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers
- A NEW EXISTENCE PROOF OF JANKO'S SIMPLE GROUP J4 G. D. COOPERMAN, W. LEMPKEN, G. O. MICHLER, AND M. WELLER
- Twenty-Six Moves Suffice for Rubik's Cube Daniel Kunkle
- Kunkle D, Zhang DH, Cooperman G. Mining frequent generalized itemsets and generalized association rules without redundancy. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 23(1): 77102 Jan. 2008
- A DiskBased Parallel Implementation for Direct Condensation of Large Permutation Modules
- TOPC: Mature Parallel Computing Gene Cooperman
- Elementary Algebra Revisited: Randomized Algorithms Gene Cooperman and George Havas
- Fast Query Processing by Distributing an Index over CPU Caches Xiaoqin Ma
- Including Parallelism in Geant4 Gene Cooperman
- Task Oriented Parallel C/C++: A Tutorial (Version 0.92) Gene Cooperman
- TOPC (Task Oriented Parallel C/C++) A Package for Easily Writing Parallel Applications
- Practical Task-Oriented Parallelism for Gaussian Elimination in Distributed Memory
- Transparent User-Level Checkpointing for the Native POSIX Thread Library for Linux
- Efficient Mining of Max Frequent Patterns in a Generalized Environment
- Parallel GAP: Mature Interactive Parallel Computing
- DIMACSaSeriesnindDiscreteTMathematicsheoretical Computer Science Volume 11, 1993
- Biased Tadpoles: a Fast Algorithm for Centralizers in Large Matrix Groups
- Static Performance Evaluation for Memory-Bound Computing: the MBRAM Model
- Overcoming the Memory Wall in Symbolic Algebra: A Faster Permutation Multiplication
- Fast Monte Carlo Algorithms for Permutation Groups L'aszl'o Babai1,2, Gene Cooperman3, Larry Finkelstein3, Eugene Luks4, and *
- New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras
- Parallel GAP Gene Cooperman
- A Strong Generating Test and Short Presentations for Permutation Groups
- A Parallel Architecture for Disk-Based Computing over the Baby Monster and Other Large Finite Simple Groups
- Proc. of Int. Symposium on Symbolic and Algebraic Manipulation (ISSAC-94)* *, ACM Press, 1994 1
- (Parallel GAP) A GAP4 Package
- Nearly Linear Time Algorithms for Permutation Groups with a Small Base
- New Methods for Using Cayley Graphs in Interconnection Networks
- Multithreaded Geant4: Semi-Automatic Transformation into Scalable Thread-Parallel Software
- STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems
- Proc. 23rdACM Annual Symp. on Theory of Comp. (ACM STOC-23) (1991) Fast Monte Carlo Algorithms for Permutation Groups
- Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers
- Parallelization of Geant4 Using TOP-C and Marshalgen Gene Cooperman Viet Ha Nguyen Igor Maliout*
- Appl. Algebra, Alg. Algo. and Error-Correcting Codes (AAECC-8, 1990) Springer-V* *erlag Lecture Notes in Comp. Sci. 508
- Practical Task-Oriented Parallelism for Gaussian Elimination in Distributed Memory
- Journal of Symbolic Computation 33, pp. 563-585 Scalable Parallel Coset Enumeration: Bulk
- A NEW EXISTENCE PROOF OF JANKO'S SIMPLE GROUP J4 G. D. COOPERMAN, W. LEMPKEN, G. O. MICHLER, AND M. WELLER
- J. Symbolic Computation (2004) 11, 1-000 Constructing Permutation Representations
- Elementary Algebra Revisited: Randomized Algorithms Gene Cooperman and George Havas
- Marshalgen: Marshaling Objects in the Presence of Polymorphism
- Applications Version 1.0
- A Fast Cyclic Base Change for Permutation Groups Gene Cooperman* and Larry Finkelstein"
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Memory-Based and Disk-Based Algorithms for Very High Degree Permutation Groups
- J. Symbolic Computation (2003) 17, 513-528 A Random Base Change Algorithm
- New Methods for Using Cayley Graphs in Interconnection Networks
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Computing with Matrix Groups using Permutation Representations Gene Cooperman1 Larry Finkelstein1 Michael Tselman1
- TOP-C: Mature Parallel Computing Gene Cooperman
- DIMACS Series in Discrete Mathematics andVTheoreticaloComputerlScienceume 00, 0000
- PERMUTATION ROUTING VIA CAYLEY GRAPHS WITH AN EXAMPLE FOR
- TOP-C (Task Oriented Parallel C/C++) A Package for Easily Writing Parallel Applicat*
- URDB: A Universal Reversible Debugger Based on Decomposing Debugging Histories
- A Bit-Compatible Parallelization for ILU(k) Preconditioning
