no code implementations • 27 Dec 2022 • Puru Sharma, Cheng-Kai Lim, Dehui Lin, Yash Pote, Djordje Jevdjic
We propose a novel and flexible DNA-storage architecture, which divides the storage space into fixed-size units (blocks) that can be independently and efficiently accessed at random for both read and write operations, and further allows efficient sequential access to consecutive data blocks.
no code implementations • 24 May 2021 • Durgesh Agrawal, Yash Pote, Kuldeep S Meel
Given the #P-hardness of computing the partition function, several techniques have been proposed over the years with varying guarantees on the quality of estimates and their runtime behavior.
1 code implementation • 22 Oct 2019 • Yash Pote, Saurabh Joshi, Kuldeep S. Meel
The runtime performance of modern SAT solvers is deeply connected to the phase transition behavior of CNF formulas.