activity
20232026
most citedSolving Boolean satisfiability problems with resistive content addressable memories

16 citations · 29 across the 14 of their papers we have counts for

collaborators
Showing 2025Show all

6 papers · 1 filter

cs.AR2025

NL-DPE: An Analog In-memory Non-Linear Dot Product Engine for Efficient CNN and LLM Inference

Lei Zhao, Luca Buonanno, Archit Gajjar +9

Resistive Random Access Memory (RRAM) based in-memory computing (IMC) accelerators offer significant performance and energy advantages for deep neural networks (DNNs), but face thr…

cs.ET2025

Fault-Free Analog Computing with Imperfect Hardware

Zhicheng Xu, Jiawei Liu, Sitao Huang +9

The growing demand for edge computing and AI drives research into analog in-memory computing using memristors, which overcome data movement bottlenecks by computing directly within…

cs.LG2025

Hardware-Adaptive and Superlinear-Capacity Memristor-based Associative Memory

Chengping He, Mingrui Jiang, Keyi Shan +6

Brain-inspired computing aims to mimic cognitive functions like associative memory, the ability to recall complete patterns from partial cues. Memristor technology offers promising…

cs.ET2025

Real-time raw signal genomic analysis using fully integrated memristor hardware

Peiyi He, Shengbo Wang, Ruibin Mao +6

Advances in third-generation sequencing have enabled portable and real-time genomic sequencing, but real-time data processing remains a bottleneck, hampering on-site genomic analys…

cs.ET2025

Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing

Haesol Im, Fabian Böhm, Giacomo Pedretti +14

The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…

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…