scispace - formally typeset
G

Gene Cooperman

Researcher at Northeastern University

Publications -  164
Citations -  29130

Gene Cooperman is an academic researcher from Northeastern University. The author has contributed to research in topics: Debugging & Shared memory. The author has an hindex of 23, co-authored 160 publications receiving 24769 citations. Previous affiliations of Gene Cooperman include Hoffmann-La Roche & Brown University.

Papers
More filters
Journal ArticleDOI

Geant4—a simulation toolkit

S. Agostinelli, +126 more
TL;DR: The Gelfant 4 toolkit as discussed by the authors is a toolkit for simulating the passage of particles through matter, including a complete range of functionality including tracking, geometry, physics models and hits.
Journal ArticleDOI

Geant4 developments and applications

TL;DR: GeGeant4 as mentioned in this paper 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.
Journal ArticleDOI

Recent developments in GEANT4

John Allison, +102 more
TL;DR: Geant4 as discussed by the authors is a software toolkit for the simulation of the passage of particles through matter, which 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.
Journal ArticleDOI

Self‐pulsing and chaos in distributed feedback bistable optical devices

TL;DR: In this article, the authors show that the light transmitted by a nonlinear distributed feedback structure can be steady (time independent), periodic, or chaotic depending on the intensity of the input cw beam.
Proceedings ArticleDOI

Fast Monte Carlo algorithms for permutation groups

TL;DR: New, elementary Monte Carlo methods to speed up and greatly simplify the manipulation of permutation groups (given by a list of generators) using only elementary group theory, with a nearly optimal asymptotic running time for membership testing.