16 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.ET2025★ 16 cited
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…
cs.AR2024
FPIA: Field-Programmable Ising Arrays with In-Memory Computing
George Higgins Hutchinson, Ethan Sifferman, Tinish Bhattacharya +1
Ising Machine is a promising computing approach for solving combinatorial optimization problems. It is naturally suited for energy-saving and compact in-memory computing implementa…