#### Filter Results:

- Full text PDF available (95)

#### Publication Year

1981

2017

- This year (2)
- Last 5 years (24)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

#### Organism

Learn More

- Serge Agostinelli, J. Allison, +110 authors D. Zschiesche
- 2003

Geant4 is a toolkit for simulating the passage of particles through matter. It includes a complete range of functionality including tracking, geometry, physics models and hits. The physics processes offered cover a comprehensive range, including electromagnetic, hadronic and optical processes, a large set of long-lived particles, materials and elements,… (More)

- J. Allison, Kazunobu Amako, +14 authors M E Dressel
- 2005

Geant4 is a software toolkit for the simulation of the passage of particles through matter. It is used by a large number of experiments and projects in a variety of application domains, including high energy physics, astrophysics and space science, medical physics and radiation protection. Its functionality and modeling capabilities continue to be extended,… (More)

- Jason Ansel, Kapil Arya, Gene Cooperman
- 2009 IEEE International Symposium on Parallel…
- 2009

DMTCP (distributed multithreaded checkpointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in memory that includes 540 dynamic… (More)

- Gene Cooperman, Larry Finkelstein
- Discrete Applied Mathematics
- 1992

- Michael Rieker, Jason Ansel, Gene Cooperman
- PDPTA
- 2006

Checkpointing of single-threaded applications has been long studied [3], [6], [8], [12], [15]. Much less research has been done for user-level checkpointing of multithreaded applications. Dieter and Lumpp studied the issue for LinuxThreads in Linux 2.2. However, that solution does not work on later versions of Linux. We present an updated solution for Linux… (More)

- László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress
- ISSAC
- 1991

A base of a permutation group G is a subset B of the permutation domain such that only the identity of G fixes B pointwise. The permutation representations of important classes of groups, including all finite simple groups other than the alternating groups, admit O(log n) size bases, where n is the size of the permutation domain. Groups with very small… (More)

We introduce new Monte Carlo methods to speed up and greatly simplify the manipulation of permutation groups. The methods are of a combinatorial character and use elementary group theory only. We achieve a nearly optimal 0(n3 loge n) running time for membership testing, an improvement of two orders of magnitude compared to known elementary algorithms and… (More)

- Daniel Kunkle, Gene Cooperman
- ISSAC
- 2007

The number of moves required to solve any state of Rubik's cube has been a matter of long-standing conjecture for over 25 years -- since Rubik's cube appeared. This number is sometimes called "God's number". An upper bound of 29 (in the face-turn metric) was produced in the early 1990's, followed by an upper bound of 27 in 2006.
An improved upper bound of… (More)

- Gene Cooperman, Igor Pak
- 2000

We prove that the product replacement graph on generating 3-tuples of An is connected for n ≤ 11. We employ an efficient heuristic based on [P1] which works significantly faster than brute force. The heuristic works for any group. Our tests were confined to An due to the interest in Wiegold’s Conjecture, usually stated in terms of T -systems (see [P2]). Our… (More)

- Kevin Hammond, Abdallah Al Zain, Gene Cooperman, Dana Petcu, Philip W. Trinder
- Euro-Par
- 2007

This paper introduces the design of SymGrid, a new Grid framework that will, for the first time, allow multiple invocations of symbolic computing applications to interact via the Grid. SymGrid is designed to support the specific needs of symbolic computation, including computational steering (greater interactivity), complex data structures, and… (More)