Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gene Cooperman
2010 – today
- 2012
[c44]Vlad Slavici, Raghu Varier, Gene Cooperman, Robert J. Harrison: Adapting Irregular Computations to Large CPU-GPU Clusters in the MADNESS Framework. CLUSTER 2012: 1-9- [c43]Kurt L. Keville, Rohan Garg, David J. Yates, Kapil Arya, Gene Cooperman: Towards Fault-Tolerant Energy-Efficient High Performance Computing in the Cloud. CLUSTER 2012: 622-626
- [c42]Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton: An efficient programming model for memory-intensive recursive algorithms using parallel disks. ISSAC 2012: 327-334
- [i8]Rohan Garg, Komal Sodha, Gene Cooperman: A Generic Checkpoint-Restart Mechanism for Virtual Machines. CoRR abs/1212.1787 (2012)
- [i7]Kapil Arya, Tyler Denniston, Ana Maria Visan, Gene Cooperman: FReD: Automated Debugging via Binary Search through a Process Lifetime. CoRR abs/1212.5204 (2012)
- 2011
- [c41]Xin Dong, Gene Cooperman: A Bit-Compatible Parallelization for ILU(k) Preconditioning. Euro-Par (2) 2011: 66-77
- [i6]Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton: Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks. CoRR abs/1103.5736 (2011)
- 2010
- [c40]Daniel Kunkle, Vlad Slavici, Gene Cooperman: Parallel disk-based computation for large, monolithic binary decision diagrams. PASCO 2010: 63-72
- [c39]Xin Dong, Gene Cooperman, John Apostolakis: Multithreaded Geant4: Semi-automatic Transformation into Scalable Thread-Parallel Software. Euro-Par (2) 2010: 287-303
- [c38]Vlad Slavici, Xin Dong, Daniel Kunkle, Gene Cooperman: Fast multiplication of large permutations for disk, flash memory and RAM. ISSAC 2010: 355-362
2000 – 2009
- 2009
- [j11]Daniel Kunkle, Gene Cooperman: Harnessing parallel disks to solve Rubik's cube. J. Symb. Comput. 44(7): 872-890 (2009)
- [c37]Jason Ansel, Kapil Arya, Gene Cooperman: DMTCP: Transparent checkpointing for cluster computations and the desktop. IPDPS 2009: 1-12
- [c36]Daniel Kunkle, Gene Cooperman: Biased tadpoles: a fast algorithm for centralizers in large matrix groups. ISSAC 2009: 223-230
- [i5]Ana Maria Visan, Artem Polyakov, Praveen S. Solanki, Kapil Arya, Tyler Denniston, Gene Cooperman: Temporal Debugging using URDB. CoRR abs/0910.5046 (2009)
- 2008
- [j10]Daniel Kunkle, Gene Cooperman: Solving Rubik's Cube: disk is the new RAM. Commun. ACM 51(4): 31-33 (2008)
- [j9]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)
- [i4]Xin Dong, Gene Cooperman: Scalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization. CoRR abs/0803.0048 (2008)
- 2007
- [c35]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
- [c34]Eric Robinson, Daniel Kunkle, Gene Cooperman: A comparative analysis of parallel disk-based Methods for enumerating implicit graphs. PASCO 2007: 78-87
- [c33]
- [c32]Eric Robinson, Jürgen Müller, Gene Cooperman: A disk-based parallel implementation for direct condensation of large permutation modules. ISSAC 2007: 315-322
- [i3]Jason Ansel, Michael Rieker, Gene Cooperman: User-Level Socket-Based Checkpointing for Distributed and Parallel Computation. CoRR abs/cs/0701037 (2007)
- 2006
- [c31]Gene Cooperman, Jason Ansel, Xiaoqin Ma: Transparent Adaptive Library-Based Checkpointing for Master-Worker Style Parallelism. CCGRID 2006: 283-291
- [c30]Daniel Kunkle, Donghui Zhang, Gene Cooperman: Efficient mining of max frequent patterns in a generalized environment. CIKM 2006: 810-811
- [c29]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
- [c28]Gene Cooperman, Viet Ha Nguyen, Igor Malioutov: Parallelization of Geant4 Using TOP-C and Marshalgen. NCA 2006: 48-55
- [c27]Michael Rieker, Jason Ansel, Gene Cooperman: Transparent User-Level Checkpointing for the Native Posix Thread Library for Linux. PDPTA 2006: 492-498
- 2005
- [c26]Gene Cooperman, Jason Ansel, Xiaoqin Ma: Adaptive Checkpointing for Master-Worker Style Parallelism. CLUSTER 2005: 1-2
- [c25]Xiaoqin Ma, Gene Cooperman: Fast Query Processing by Distributing an Index over CPU Caches. CLUSTER 2005: 1-10
- [c24]Panfeng Zhou, Donghui Zhang, Betty Salzberg, Gene Cooperman, George Kollios: Close pair queries in moving object databases. GIS 2005: 2-11
- 2004
- [c23]Gene Cooperman, Viet Ha Nguyen: Marshalgen: Marshaling Objects in the Presence of Polymorphism. International Conference on Internet Computing 2004: 17-23
- [c22]Gene Cooperman, Xiaoqin Ma, Viet Ha Nguyen: Static Performance Evaluation for Memory-Bound Computing: The MBRAM Model. PDPTA 2004: 435-441
- [i2]Xiaoqin Ma, Gene Cooperman: Fast Query Processing Using Cooperative CPU Caching for Index Structures. CoRR cs.DC/0410066 (2004)
- 2003
- [j8]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)
- [c21]Gene Cooperman, Ning Ke, Huanmei Wu: Marshalgen: A Package for Semi-Automatic Marshaling of Objects. International Conference on Internet Computing 2003: 555-560
- [c20]Gene Cooperman, Eric Robinson: Memory-based and disk-based algorithms for very high degree permutation groups. ISSAC 2003: 66-73
- [i1]Gene Cooperman, Xiaoqin Ma, Viet Ha Nguyen: DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators. CoRR cs.DB/0308004 (2003)
- 2002
- [j7]Gene Cooperman, Victor Grinberg: Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall. J. Symb. Comput. 33(5): 563-585 (2002)
- [c19]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
- 2001
- [c18]Gene Cooperman, Victor Grinberg: Scalable parallel coset enumeration using bulk definition. ISSAC 2001: 77-84
1990 – 1999
- 1999
- [c17]Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas: GCD of Many Integers. COCOON 1999: 310-317
- [e1]Gene Cooperman, Eike Jessen, Gerhard O. Michler (Eds.): Workshop on Wide Area Networks and High Performance Computing, September 1-5, 1998, Essen, Germany. Lecture Notes in Control and Information Sciences 249, Springer 1999, ISBN 1-85233-642-0
- 1998
- [c16]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
- [c15]Gene Cooperman: TOP-C: Task-Oriented Parallel C for Distributed and Shared Memory. Wide Area Networks and High Performance Computing 1998: 109-117
- 1997
- [j6]Gene Cooperman, Gerhard Hiss, Klaus Lux, Jürgen Müller: The Brauer Tree of the Principal 19-Block of the Sporadic Simple Thompson Group. Experimental Mathematics 6(4): 293-300 (1997)
- [j5]Gene Cooperman, Larry Finkelstein, Michael Tselman, Bryant W. York: Constructing Permutation Representations for Matrix Groups. J. Symb. Comput. 24(3/4): 471-488 (1997)
- [c14]Gene Cooperman, Michael Tselman: Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers. SPAA 1997: 231-238
- 1996
- [c13]
- [c12]Gene Cooperman, Michael Tselman: New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras Using the Condensation Technique. ISSAC 1996: 155-160
- 1995
- [j4]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)
- [c11]Gene Cooperman: STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems. ISSAC 1995: 126-132
- [c10]Gene Cooperman, Larry Finkelstein, Michael Tselman: Computing with Matrix Groups Using Permutation Representations. ISSAC 1995: 259-264
- 1994
- [j3]Gene Cooperman, Larry Finkelstein: A Random Base Change Algorithm for Permutation Groups. J. Symb. Comput. 17(6): 513-528 (1994)
- [c9]Gene Cooperman, Larry Finkelstein, Bryant W. York, Michael Tselman: Constructing Permutation Representations for Large Matrix Groups. ISSAC 1994: 134-138
- 1992
- [j2]Gene Cooperman, Larry Finkelstein: New Methods for Using Cayley Graphs in Interconnection Networks. Discrete Applied Mathematics 37/38: 95-118 (1992)
- [c8]Gene Cooperman, Larry Finkelstein: A Fast Cyclic Base Change for Permutation Groups. ISSAC 1992: 224-232
- 1991
- [j1]Gene Cooperman, Larry Finkelstein: A Strong Generating Test and Short Presentation for Permutation Groups. J. Symb. Comput. 12(4/5): 475-498 (1991)
- [c7]László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress: Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC 1991: 200-209
- [c6]László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress: Fast Monte Carlo Algorithms for Permutation Groups. STOC 1991: 90-100
- 1990
- [c5]
- [c4]Gene Cooperman, Larry Finkelstein, N. Sarawagi: A Random Base Change Algorithm for Permutation Groups. ISSAC 1990: 161-168
1980 – 1989
- 1989
- [c3]Gene Cooperman, Larry Finkelstein, Eugene M. Luks: Reduction of Group Constructions to Point Stabilizers. ISSAC 1989: 351-356
- 1988
- [c2]Cynthia A. Brown, Gene Cooperman, Larry Finkelstein: Solving Permutation Problems Using Rewriting Systems. ISSAC 1988: 364-377
- 1986
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-22 20:46 CEST by the dblp team