70 citations · 187 across the 12 of their papers we have counts for
12 papers
Storage-Efficient Shared Memory Emulation
Marwen Zorgui, Robert Mateescu, Filip Blagojevic +2
We study the design of storage-efficient algorithms for emulating atomic shared memory over an asynchronous, distributed message-passing system. Our first algorithm is an atomic si…
Locally rewritable codes for resistive memories
Yongjune Kim, Abhishek A. Sharma, Robert Mateescu +4
We propose locally rewritable codes (LWC) for resistive memories inspired by locally repairable codes (LRC) for distributed storage systems. Small values of repair locality of LRC…
Coding scheme for 3D vertical flash memory
Yongjune Kim, Robert Mateescu, Seung-Hwan Song +2
Recently introduced 3D vertical flash memory is expected to be a disruptive technology since it overcomes scaling challenges of conventional 2D planar flash memory by stacking up c…
Join-Graph Propagation Algorithms
Robert Mateescu, Kalev Kask, Vibhav Gogate +1
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start…
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Robert Mateescu, Rina Dechter, Radu Marinescu
Inspired by the recently introduced framework of AND/OR search spaces for graphical models, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to c…
Repair-Optimal MDS Array Codes over GF(2)
Eyal En Gad, Robert Mateescu, Filip Blagojevic +2
Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, wh…