![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Gene Cooperman Gene Cooperman, Jason Ansel , Xiaoqin Ma : Transparent Adaptive Library-Based Checkpointing for Master-Worker Style Parallelism. CCGRID 2006 : 283-291 Panfeng Zhou , Donghui Zhang , Betty Salzberg , Gene Cooperman, George Kollios : Close pair queries in moving object databases. GIS 2005 : 2-11 Gene Cooperman, Viet Ha Nguyen : Marshalgen: Marshaling Objects in the Presence of Polymorphism. International Conference on Internet Computing 2004 : 17-23 Gene Cooperman, Xiaoqin Ma , Viet Ha Nguyen : Static Performance Evaluation for Memory-Bound Computing: The MBRAM Model. PDPTA 2004 : 435-441 Xiaoqin Ma , Gene Cooperman: Fast Query Processing Using Cooperative CPU Caching for Index Structures CoRR cs.DC/0410066 : (2004) Gene Cooperman, Eric Robinson : Memory-based and disk-based algorithms for very high degree permutation groups. ISSAC 2003 : 66-73 Gene Cooperman, Ning Ke , Huanmei Wu : Marshalgen: A Package for Semi-Automatic Marshaling of Objects. International Conference on Internet Computing 2003 : 555-560 Gene Cooperman, Xiaoqin Ma , Viet Ha Nguyen : DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators CoRR cs.DB/0308004 : (2003) 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) 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 Gene Cooperman, Victor Grinberg : Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall. J. Symb. Comput. 33 (5): 563-585 (2002) Gene Cooperman, Victor Grinberg : Scalable parallel coset enumeration using bulk definition. ISSAC 2001 : 77-84 Gene Cooperman, Eike Jessen , Gerhard O. Michler : Workshop on Wide Area Networks and High Performance Computing, September 1-5, 1998, Essen, Germany Springer 1999 Gene Cooperman, Sandra Feisel , Joachim von zur Gathen , George Havas : GCD of Many Integers. COCOON 1999 : 310-317 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 Gene Cooperman: TOP-C: Task-Oriented Parallel C for Distributed and Shared Memory. Wide Area Networks and High Performance Computing 1998 : 109-117 Gene Cooperman, Michael Tselman : Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers. SPAA 1997 : 231-238 Gene Cooperman, Larry Finkelstein , Michael Tselman , Bryant W. York : Constructing Permutation Representations for Matrix Groups. J. Symb. Comput. 24 (3/4): 471-488 (1997) Gene Cooperman: TOP-C: A Task-Oriented Parallel C Interface. HPDC 1996 : 141-150 Gene Cooperman, Michael Tselman : New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras Using the Condensation Technique. ISSAC 1996 : 155-160 Gene Cooperman: STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems. ISSAC 1995 : 126-132 Gene Cooperman, Larry Finkelstein , Michael Tselman : Computing with Matrix Groups Using Permutation Representations. ISSAC 1995 : 259-264 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) Gene Cooperman, Larry Finkelstein , Bryant W. York , Michael Tselman : Constructing Permutation Representations for Large Matrix Groups. ISSAC 1994 : 134-138 Gene Cooperman, Larry Finkelstein : A Random Base Change Algorithm for Permutation Groups. J. Symb. Comput. 17 (6): 513-528 (1994) Gene Cooperman, Larry Finkelstein : A Fast Cyclic Base Change for Permutation Groups. ISSAC 1992 : 224-232 Gene Cooperman, Larry Finkelstein : New Methods for Using Cayley Graphs in Interconnection Networks. Discrete Applied Mathematics 37/38 : 95-118 (1992) László Babai , Gene Cooperman, Larry Finkelstein , Ákos Seress : Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC 1991 : 200-209 László Babai , Gene Cooperman, Larry Finkelstein , Eugene M. Luks , Ákos Seress : Fast Monte Carlo Algorithms for Permutation Groups STOC 1991 : 90-100 Gene Cooperman, Larry Finkelstein : A Strong Generating Test and Short Presentation for Permutation Groups. J. Symb. Comput. 12 (4/5): 475-498 (1991) Gene Cooperman, Larry Finkelstein , N. Sarawagi : Applications of Cayley Graphs. AAECC 1990 : 367-378 Gene Cooperman, Larry Finkelstein , N. Sarawagi : A Random Base Change Algorithm for Permutation Groups. ISSAC 1990 : 161-168 Gene Cooperman, Larry Finkelstein , Eugene M. Luks : Reduction of Group Constructions to Point Stabilizers. ISSAC 1989 : 351-356 Cynthia A. Brown , Gene Cooperman, Larry Finkelstein : Solving Permutation Problems Using Rewriting Systems. ISSAC 1988 : 364-377 1 [ 34 ] 2 [ 6 ] [ 7 ] [ 12 ] 3 [ 1 ] 4 [ 25 ] [ 26 ] 5 [ 21 ] 6 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 17 ] 7 [ 21 ] 8 [ 23 ] [ 24 ] 9 [ 21 ] 10 [ 25 ] [ 26 ] 11 [ 20 ] [ 22 ] 12 [ 28 ] 13 [ 33 ] 14 [ 2 ] [ 6 ] [ 12 ] 15 [ 27 ] [ 30 ] [ 31 ] [ 34 ] 16 [ 20 ] [ 22 ] 17 [ 27 ] [ 31 ] [ 32 ] 18 [ 29 ] 19 [ 33 ] 20 [ 3 ] [ 4 ] 21 [ 6 ] [ 7 ] [ 12 ] 22 [ 11 ] [ 13 ] [ 15 ] [ 17 ] [ 18 ] 23 [ 25 ] [ 26 ] 24 [ 28 ] 25 [ 11 ] [ 17 ] 26 [ 33 ] 27 [ 33 ] ![]() ©2006 Association for Computing Machinery |