activity
19922026
most citedSimulated Tempering: A New Monte Carlo Scheme

1.8k citations · 6.4k across the 131 of their papers we have counts for

collaborators
Showing 2007Show all

6 papers · 1 filter

cond-mat.dis-nn2007★ 53 cited

Finite size corrections in the Sherrington-Kirkpatrick model

T. Aspelmeier, A. Billoire, E. Marinari +1

We argue that when the number of spins in the SK model is finite, the Parisi scheme can be terminated after replica-symmetry breaking steps, where . W…

cond-mat.dis-nn2007★ 13 cited

Critical properties of the four-state Commutative Random Permutation Glassy Potts model in three and four dimensions

L. A. Fernandez, A. Maiorano, E. Marinari +5

We investigate the critical properties of the four-state commutative random permutation glassy Potts model in three and four dimensions by means of Monte Carlo simulation and of a…

cs.AR2007★ 93 cited

JANUS: an FPGA-based System for High Performance Scientific Computing

F. Belletti, M. Cotallo, A. Cruz +18

This paper describes JANUS, a modular massively parallel and reconfigurable FPGA-based computing system. Each JANUS module has a computational core and a host. The computational co…

cond-mat.dis-nn2007★ 13 cited

Zero-temperature behavior of the random-anisotropy model in the strong-anisotropy limit

Frauke Liers, Jovanka Lukic, Enzo Marinari +2

We consider the random-anisotropy model on the square and on the cubic lattice in the strong-anisotropy limit. We compute exact ground-state configurations, and we use them to dete…

cond-mat.dis-nn2007★ 66 cited

Simulating spin systems on IANUS, an FPGA-based computer

F. Belletti, M. Cotallo, A. Cruz +15

We describe the hardwired implementation of algorithms for Monte Carlo simulations of a large class of spin models. We have implemented these algorithms as VHDL codes and we have m…

cond-mat.stat-mech2007★ 19 cited

Finding long cycles in graphs

Enzo Marinari, Guilhem Semerjian, Valery Van Kerrebroeck

We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechani…