Computational overhead of locality reduction in binary optimization problems. - Elisabetta Valiante; Maritza Hernandez; Amin Barzegar; Helmut G. Katzgraber (Comput. Phys. Commun., 2021)

Distributed Binary Optimization with In-Memory Computing: An Application for the SAT Problem. - Xiangyi Zhang; Ignacio Rozada; Fabian Böhm; Elisabetta Valiante; Moslem Noori; Thomas Van Vaerenbergh; Chan-Woo Yang; Giacomo Pedretti; Masoud Mohseni; Raymond G. Beausoleil (CoRR, 2024)

Solving Boolean satisfiability problems with resistive content addressable memories. - Giacomo Pedretti; Fabian Böhm; Tinish Bhattacharya; Arne Heittmann; Xiangyi Zhang; Mohammad Hizzani; George Higgins Hutchinson; Dongseok Kwon; John Moon; Elisabetta Valiante; Ignacio Rozada; Catherine E. Graves; et al. (CoRR, 2025)

Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem. - Haesol Im; Chan-Woo Yang; Moslem Noori; Dmitrii Dobrynin; Elisabetta Valiante; Giacomo Pedretti; Arne Heittmann; Thomas Van Vaerenbergh; Masoud Mohseni; John Paul Strachan; Dmitri B. Strukov; Raymond G. Beausoleil; et al. (CoRR, 2025)

A Statistical Analysis for Per-Instance Evaluation of Stochastic Optimizers: How Many Repeats Are Enough? - Moslem Noori; Elisabetta Valiante; Thomas Van Vaerenbergh; Masoud Mohseni; Ignacio Rozada (CoRR, 2025)

Accelerating Hybrid XOR-CNF SAT Problems Natively with In-Memory Computing. - Haesol Im; Fabian Böhm; Giacomo Pedretti; Noriyuki Kushida; Moslem Noori; Elisabetta Valiante; Xiangyi Zhang; Chan-Woo Yang; Tinish Bhattacharya; Xia Sheng; Jim Ignowski; Arne Heittmann; et al. (CoRR, 2025)