activity
20012005
most citedEfficient Parallel Simulations of Asynchronous Cellular Arrays

56 citations · 56 across the 8 of their papers we have counts for

collaborators

10 papers

cs.DC200556 cited

Efficient Parallel Simulations of Asynchronous Cellular Arrays

Boris D. Lubachevsky

A definition for a class of asynchronous cellular arrays is proposed. An example of such asynchrony would be independent Poisson arrivals of cell iterations. The Ising model in the…

math.MG2004

Repeated Patterns of Dense Packings of Equal Disks in a Square

Ronald L. Graham, Boris D. Lubachevsky

We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n…

math.MG2004

Dense Packings of Equal Disks in an Equilateral Triangle: From 22 to 34 and Beyond

R. L. Graham B. D. Lubachevsky

Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 disks. We use a new discrete-event simulation algorithm to produce packings for up…

math.MG2004

Curved Hexagonal Packings of Equal Disks in a Circle

B. D. Lubachevsky, R. L. Graham

For each k >= 1 and corresponding hexagonal number h(k) = 3k(k+1)+1, we introduce m(k) = max[(k-1)!/ 2, 1] packings of h(k) equal disks inside a circle which we call "the curved he…

math.MG2004

Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio

Boris D. Lubachevsky, Ronald Graham

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the…

cs.DC2004

Synchronous Relaxation for Parallel Ising Spin Simulations

Boris Lubachevsky, Alan Weiss

A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, which is efficient but is hard to paralle…