The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gene Cooperman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  42. Fast Query Processing by Distributing an Index over CPU Caches. [Citation Graph (, )][DBLP]


  43. Adaptive Checkpointing for Master-Worker Style Parallelism. [Citation Graph (, )][DBLP]


  44. Multithreaded Geant4: Semi-automatic Transformation into Scalable Thread-Parallel Software. [Citation Graph (, )][DBLP]


  45. DMTCP: Transparent checkpointing for cluster computations and the desktop. [Citation Graph (, )][DBLP]


  46. A comparative analysis of parallel disk-based Methods for enumerating implicit graphs. [Citation Graph (, )][DBLP]


  47. Biased tadpoles: a fast algorithm for centralizers in large matrix groups. [Citation Graph (, )][DBLP]


  48. Solving Rubik's Cube: disk is the new RAM. [Citation Graph (, )][DBLP]


  49. Scalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization [Citation Graph (, )][DBLP]


  50. Temporal Debugging using URDB [Citation Graph (, )][DBLP]


Search in 0.190secs, Finished in 0.193secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002