| 2008 |
|---|
| 48 | EE | Xin Dong,
Gene Cooperman:
Scalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization
CoRR abs/0803.0048: (2008) |
| 47 | EE | Daniel Kunkle,
Gene Cooperman:
Solving Rubik's Cube: disk is the new RAM.
Commun. ACM 51(4): 31-33 (2008) |
| 46 | EE | Daniel Kunkle,
Donghui Zhang,
Gene Cooperman:
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy.
J. Comput. Sci. Technol. 23(1): 77-102 (2008) |
| 2007 |
|---|
| 45 | EE | Kevin Hammond,
Abdallah Al Zain,
Gene Cooperman,
Dana Petcu,
Philip W. Trinder:
SymGrid: A Framework for Symbolic Computation on the Grid.
Euro-Par 2007: 457-466 |
| 44 | EE | Daniel Kunkle,
Gene Cooperman:
Twenty-six moves suffice for Rubik's cube.
ISSAC 2007: 235-242 |
| 43 | EE | Eric Robinson,
Jürgen Müller,
Gene Cooperman:
A disk-based parallel implementation for direct condensation of large permutation modules.
ISSAC 2007: 315-322 |
| 42 | EE | Eric Robinson,
Daniel Kunkle,
Gene Cooperman:
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs.
PASCO 2007: 78-87 |
| 41 | EE | Jason Ansel,
Michael Rieker,
Gene Cooperman:
User-Level Socket-Based Checkpointing for Distributed and Parallel Computation
CoRR abs/cs/0701037: (2007) |
| 2006 |
|---|
| 40 | EE | Gene Cooperman,
Jason Ansel,
Xiaoqin Ma:
Transparent Adaptive Library-Based Checkpointing for Master-Worker Style Parallelism.
CCGRID 2006: 283-291 |
| 39 | EE | Daniel Kunkle,
Donghui Zhang,
Gene Cooperman:
Efficient mining of max frequent patterns in a generalized environment.
CIKM 2006: 810-811 |
| 38 | EE | Eric Robinson,
Gene Cooperman:
A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups.
ISSAC 2006: 298-305 |
| 37 | EE | Gene Cooperman,
Viet Ha Nguyen,
Igor Malioutov:
Parallelization of Geant4 Using TOP-C and Marshalgen.
NCA 2006: 48-55 |
| 36 | | Michael Rieker,
Jason Ansel,
Gene Cooperman:
Transparent User-Level Checkpointing for the Native Posix Thread Library for Linux.
PDPTA 2006: 492-498 |
| 2005 |
|---|
| 35 | EE | Xiaoqin Ma,
Gene Cooperman:
Fast Query Processing by Distributing an Index over CPU Caches.
CLUSTER 2005: 1-10 |
| 34 | EE | Gene Cooperman,
Jason Ansel,
Xiaoqin Ma:
Adaptive Checkpointing for Master-Worker Style Parallelism.
CLUSTER 2005: 1-2 |
| 33 | EE | Panfeng Zhou,
Donghui Zhang,
Betty Salzberg,
Gene Cooperman,
George Kollios:
Close pair queries in moving object databases.
GIS 2005: 2-11 |
| 2004 |
|---|
| 32 | | Gene Cooperman,
Viet Ha Nguyen:
Marshalgen: Marshaling Objects in the Presence of Polymorphism.
International Conference on Internet Computing 2004: 17-23 |
| 31 | | Gene Cooperman,
Xiaoqin Ma,
Viet Ha Nguyen:
Static Performance Evaluation for Memory-Bound Computing: The MBRAM Model.
PDPTA 2004: 435-441 |
| 30 | EE | Xiaoqin Ma,
Gene Cooperman:
Fast Query Processing Using Cooperative CPU Caching for Index Structures
CoRR cs.DC/0410066: (2004) |
| 2003 |
|---|
| 29 | EE | Gene Cooperman,
Eric Robinson:
Memory-based and disk-based algorithms for very high degree permutation groups.
ISSAC 2003: 66-73 |
| 28 | | Gene Cooperman,
Ning Ke,
Huanmei Wu:
Marshalgen: A Package for Semi-Automatic Marshaling of Objects.
International Conference on Internet Computing 2003: 555-560 |
| 27 | EE | Gene Cooperman,
Xiaoqin Ma,
Viet Ha Nguyen:
DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators
CoRR cs.DB/0308004: (2003) |
| 26 | EE | Gene Cooperman,
Henri Casanova,
Jim Hayes,
Thomas Witzel:
Using TOP-C and AMPIC to port large parallel applications to the Computational Grid.
Future Generation Comp. Syst. 19(4): 587-596 (2003) |
| 2002 |
|---|
| 25 | EE | Gene Cooperman,
Henri Casanova,
Jim Hayes,
Thomas Witzel:
Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational Grid.
CCGRID 2002: 120-127 |
| 24 | EE | Gene Cooperman,
Victor Grinberg:
Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall.
J. Symb. Comput. 33(5): 563-585 (2002) |
| 2001 |
|---|
| 23 | EE | Gene Cooperman,
Victor Grinberg:
Scalable parallel coset enumeration using bulk definition.
ISSAC 2001: 77-84 |
| 1999 |
|---|
| 22 | | Gene Cooperman,
Eike Jessen,
Gerhard O. Michler:
Workshop on Wide Area Networks and High Performance Computing, September 1-5, 1998, Essen, Germany
Springer 1999 |
| 21 | EE | Gene Cooperman,
Sandra Feisel,
Joachim von zur Gathen,
George Havas:
GCD of Many Integers.
COCOON 1999: 310-317 |
| 1998 |
|---|
| 20 | | Gene Cooperman,
Eike Jessen,
Gerhard O. Michler:
Introduction: Distributed High Performance Computing and Gigabit Wide Area Networks.
Wide Area Networks and High Performance Computing 1998: 1-4 |
| 19 | | Gene Cooperman:
TOP-C: Task-Oriented Parallel C for Distributed and Shared Memory.
Wide Area Networks and High Performance Computing 1998: 109-117 |
| 1997 |
|---|
| 18 | EE | Gene Cooperman,
Michael Tselman:
Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers.
SPAA 1997: 231-238 |
| 17 | | 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 |
|---|
| 16 | EE | Gene Cooperman:
TOP-C: A Task-Oriented Parallel C Interface.
HPDC 1996: 141-150 |
| 15 | EE | Gene Cooperman,
Michael Tselman:
New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras Using the Condensation Technique.
ISSAC 1996: 155-160 |
| 1995 |
|---|
| 14 | EE | Gene Cooperman:
STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems.
ISSAC 1995: 126-132 |
| 13 | EE | Gene Cooperman,
Larry Finkelstein,
Michael Tselman:
Computing with Matrix Groups Using Permutation Representations.
ISSAC 1995: 259-264 |
| 12 | | 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) |
| 1994 |
|---|
| 11 | EE | Gene Cooperman,
Larry Finkelstein,
Bryant W. York,
Michael Tselman:
Constructing Permutation Representations for Large Matrix Groups.
ISSAC 1994: 134-138 |
| 10 | | Gene Cooperman,
Larry Finkelstein:
A Random Base Change Algorithm for Permutation Groups.
J. Symb. Comput. 17(6): 513-528 (1994) |
| 1992 |
|---|
| 9 | EE | Gene Cooperman,
Larry Finkelstein:
A Fast Cyclic Base Change for Permutation Groups.
ISSAC 1992: 224-232 |
| 8 | EE | Gene Cooperman,
Larry Finkelstein:
New Methods for Using Cayley Graphs in Interconnection Networks.
Discrete Applied Mathematics 37/38: 95-118 (1992) |
| 1991 |
|---|
| 7 | EE | László Babai,
Gene Cooperman,
Larry Finkelstein,
Ákos Seress:
Nearly Linear Time Algorithms for Permutation Groups with a Small Base.
ISSAC 1991: 200-209 |
| 6 | | László Babai,
Gene Cooperman,
Larry Finkelstein,
Eugene M. Luks,
Ákos Seress:
Fast Monte Carlo Algorithms for Permutation Groups
STOC 1991: 90-100 |
| 5 | | Gene Cooperman,
Larry Finkelstein:
A Strong Generating Test and Short Presentation for Permutation Groups.
J. Symb. Comput. 12(4/5): 475-498 (1991) |
| 1990 |
|---|
| 4 | | Gene Cooperman,
Larry Finkelstein,
N. Sarawagi:
Applications of Cayley Graphs.
AAECC 1990: 367-378 |
| 3 | EE | Gene Cooperman,
Larry Finkelstein,
N. Sarawagi:
A Random Base Change Algorithm for Permutation Groups.
ISSAC 1990: 161-168 |
| 1989 |
|---|
| 2 | EE | Gene Cooperman,
Larry Finkelstein,
Eugene M. Luks:
Reduction of Group Constructions to Point Stabilizers.
ISSAC 1989: 351-356 |
| 1988 |
|---|
| 1 | | Cynthia A. Brown,
Gene Cooperman,
Larry Finkelstein:
Solving Permutation Problems Using Rewriting Systems.
ISSAC 1988: 364-377 |
