Robert Mateescu

According to our database, Robert Mateescu authored at least 33 papers between 2002 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Garbage Collection Algorithms for Meta Data Updates in NAND Flash.

Minghai Qin, Robert Mateescu, Qingbo Wang, Cyril Guyot, Dejan Vucinic, Zvonimir Bandic

Proceedings of the 2019 IEEE International Conference on Communications, 2019

2018

Towards Robust File System Checkers.

Om Rameshwar Gatla, Mai Zheng, Muhammad Hameed, Viacheslav Dubeyko, Adam Manzanares, Filip Blagojevic, Cyril Guyot, Robert Mateescu

ACM Trans. Storage, 2018

Storage-Efficient Shared Memory Emulation.

Marwen Zorgui, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zhiying Wang

CoRR, 2018

2017

Low Read Latency Rewriting Codes for Multi-Level 3-D NAND Flash.

Minghai Qin, Robert Mateescu, Chao Sun, Zvonimir Bandic

IEEE Commun. Lett., 2017

2016

Locally Rewritable Codes for Resistive Memories.

Yongjune Kim, Abhishek A. Sharma, Robert Mateescu, Seung-Hwan Song, Zvonimir Z. Bandic, James A. Bain, B. V. K. Vijaya Kumar

IEEE J. Sel. Areas Commun., 2016

Spider Codes: Practical erasure codes for distributed storage systems.

Lluis Pamies-Juarez, Cyril Guyot, Robert Mateescu

Proceedings of the IEEE International Symposium on Information Theory, 2016

Opening the Chrysalis: On the Real Repair Performance of MSR Codes.

Lluis Pamies-Juarez, Filip Blagojevic, Robert Mateescu, Cyril Guyot, Eyal En Gad, Zvonimir Bandic

Proceedings of the 14th USENIX Conference on File and Storage Technologies, 2016

2015

Coding scheme for 3D vertical flash memory.

Yongjune Kim, Robert Mateescu, Seung-Hwan Song, Zvonimir Bandic, B. V. K. Vijaya Kumar

Proceedings of the 2015 IEEE International Conference on Communications, 2015

Balanced codes for data retention of multi-level flash memories with fast page read.

Minghai Qin, Robert Mateescu, Cyril Guyot, Zvonimir Bandic

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

DC express: shortest latency protocol for reading phase change memory over PCI express.

Dejan Vucinic, Qingbo Wang, Cyril Guyot, Robert Mateescu, Filip Blagojevic, Luiz Franca-Neto, Damien Le Moal, Trevor Bunker, Jian Xu, Steven Swanson, Zvonimir Bandic

Proceedings of the 12th USENIX conference on File and Storage Technologies, 2014

2013

Repair-optimal MDS array codes over GF(2).

Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zvonimir Bandic

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Priority IO Scheduling in the Cloud.

Filip Blagojevic, Cyril Guyot, Qingbo Wang, Timothy Tsai, Robert Mateescu, Zvonimir Bandic

Proceedings of the 5th USENIX Workshop on Hot Topics in Cloud Computing, 2013

2010

Storage coding for wear leveling in flash memories.

Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jehoshua Bruck, Paul H. Siegel, Alexander Vardy, Jack K. Wolf

IEEE Trans. Inf. Theory, 2010

Join-Graph Propagation Algorithms.

Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter

J. Artif. Intell. Res., 2010

Data movement and aggregation in flash memories.

Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Rank modulation for flash memories.

Anxiao Jiang, Robert Mateescu, Moshe Schwartz, Jehoshua Bruck

IEEE Trans. Inf. Theory, 2009

Data movement in flash memories.

Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models.

Robert Mateescu, Rina Dechter, Radu Marinescu

J. Artif. Intell. Res., 2008

Mixed deterministic and probabilistic networks.

Robert Mateescu, Rina Dechter

Ann. Math. Artif. Intell., 2008

AND/OR Multi-valued Decision Diagrams for Constraint Networks.

Robert Mateescu, Rina Dechter

Proceedings of the Concurrency, 2008

2007

AND/OR search spaces for graphical models.

Rina Dechter, Robert Mateescu

Artif. Intell., 2007

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models.

Robert Mateescu, Rina Dechter

Proceedings of the UAI 2007, 2007

A Comparison of Time-Space Schemes for Graphical Models.

Robert Mateescu, Rina Dechter

Proceedings of the IJCAI 2007, 2007

AND/OR Multi-valued Decision Diagrams for Constraint Optimization.

Robert Mateescu, Radu Marinescu, Rina Dechter

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs).

Robert Mateescu, Rina Dechter

Proceedings of the Principles and Practice of Constraint Programming, 2006

2005

The Relationship Between AND/OR Search and Variable Elimination.

Robert Mateescu, Rina Dechter

Proceedings of the UAI '05, 2005

AND/OR Cutset Conditioning.

Robert Mateescu, Rina Dechter

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

AND/OR Search Spaces and the Semantic Width of Constraint Networks.

Robert Mateescu, Rina Dechter

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space.

Rina Dechter, Robert Mateescu

Proceedings of the UAI '04, 2004

The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting.

Rina Dechter, Robert Mateescu

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

A Simple Insight into Iterative Belief Propagation's Success.

Rina Dechter, Robert Mateescu

Proceedings of the UAI '03, 2003

2002

Iterative Join-Graph Propagation.

Rina Dechter, Kalev Kask, Robert Mateescu

Proceedings of the UAI '02, 2002

Tree Approximation for Belief Updating.

Robert Mateescu, Rina Dechter, Kalev Kask

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002