activity
20002004
most citedTowards a practical, theoretically sound algorithm for random generation in finite groups

9 citations · 9 across the 3 of their papers we have counts for

collaborators

5 papers

cs.DC2004

Fast Query Processing by Distributing an Index over CPU Caches

Xiaoqin Ma, Gene Cooperman

Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree stru…

cs.DB2003

DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators

Gene Cooperman, Xiaoqin Ma, Viet Ha Nguyen

We present a new algorithm for fast record retrieval, distribute-probe-gather, or DPG. DPG has important applications both in sorting and in joins. Current main memory sorting algo…

math.PR20029 cited

Towards a practical, theoretically sound algorithm for random generation in finite groups

Gene Cooperman

This work presents a new, simple O(log^2|G|) algorithm, the Fibonacci cube algorithm, for producing random group elements in black box groups. After the initial O(log^2|G|) group o…

astro-ph2000

Air shower simulation using {\sc geant4} and commodity parallel computing

L. A. Anchordoqui, G. Cooperman, V. Grinberg +5

We present an evaluation of a simulated cosmic ray shower, based on {\sc geant4} and {\sc top-c}, which tracks all the particles in the shower. {\sc top-c} (Task Oriented Parallel…

hep-ph2000

Scalable Parallel Implementation of Geant4 Using Commodity Hardware and Task Oriented Parallel C

Gene Cooperman, Luis Anchordoqui, Victor Grinberg +3

We describe a scalable parallelization of Geant4 using commodity hardware in a collaborative effort between the College of Computer Science and the Department of Physics at Northea…