default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Mateescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c27]Minghai Qin, Robert Mateescu, Qingbo Wang, Cyril Guyot, Dejan Vucinic, Zvonimir Bandic:
Garbage Collection Algorithms for Meta Data Updates in NAND Flash. ICC 2019: 1-5- 2018
- [j9]Om Rameshwar Gatla, Mai Zheng
, Muhammad Hameed, Viacheslav Dubeyko, Adam Manzanares, Filip Blagojevic, Cyril Guyot, Robert Mateescu:
Towards Robust File System Checkers. ACM Trans. Storage 14(4): 35:1-35:25 (2018) - [c26]Om Rameshwar Gatla, Muhammad Hameed, Mai Zheng, Viacheslav Dubeyko, Adam Manzanares, Filip Blagojevic, Cyril Guyot, Robert Mateescu:
Towards Robust File System Checkers. FAST 2018: 105-122 - [i12]Marwen Zorgui, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zhiying Wang:
Storage-Efficient Shared Memory Emulation. CoRR abs/1803.01098 (2018) - 2017
- [j8]Minghai Qin, Robert Mateescu, Chao Sun, Zvonimir Bandic:
Low Read Latency Rewriting Codes for Multi-Level 3-D NAND Flash. IEEE Commun. Lett. 21(7): 1477-1480 (2017) - 2016
- [j7]Yongjune Kim, Abhishek A. Sharma, Robert Mateescu, Seung-Hwan Song, Zvonimir Z. Bandic, James A. Bain, B. V. K. Vijaya Kumar:
Locally Rewritable Codes for Resistive Memories. IEEE J. Sel. Areas Commun. 34(9): 2470-2485 (2016) - [c25]Lluis Pamies-Juarez, Filip Blagojevic, Robert Mateescu, Cyril Guyot, Eyal En Gad, Zvonimir Bandic:
Opening the Chrysalis: On the Real Repair Performance of MSR Codes. FAST 2016: 81-94 - [c24]Yongjune Kim, Abhishek A. Sharma, Robert Mateescu, Seung-Hwan Song, Zvonimir Z. Bandic, James A. Bain, B. V. K. Vijaya Kumar:
Locally rewritable codes for resistive memories. ICC 2016: 1-7 - [c23]Lluis Pamies-Juarez, Cyril Guyot, Robert Mateescu:
Spider Codes: Practical erasure codes for distributed storage systems. ISIT 2016: 1207-1211 - [i11]Yongjune Kim, Abhishek A. Sharma, Robert Mateescu, Seung-Hwan Song, Zvonimir Z. Bandic, James A. Bain, B. V. K. Vijaya Kumar:
Locally rewritable codes for resistive memories. CoRR abs/1602.01202 (2016) - 2015
- [c22]Minghai Qin, Robert Mateescu, Cyril Guyot, Zvonimir Bandic:
Balanced codes for data retention of multi-level flash memories with fast page read. Allerton 2015: 704-711 - [c21]Yongjune Kim, Robert Mateescu, Seung-Hwan Song, Zvonimir Bandic, B. V. K. Vijaya Kumar:
Coding scheme for 3D vertical flash memory. ICC 2015: 264-270 - 2014
- [c20]Dejan Vucinic, Qingbo Wang, Cyril Guyot, Robert Mateescu, Filip Blagojevic, Luiz Franca-Neto, Damien Le Moal, Trevor Bunker, Jian Xu, Steven Swanson, Zvonimir Bandic:
DC express: shortest latency protocol for reading phase change memory over PCI express. FAST 2014: 309-315 - [i10]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR abs/1401.3448 (2014) - [i9]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. CoRR abs/1401.3489 (2014) - [i8]Yongjune Kim, Robert Mateescu, Seung-Hwan Song, Zvonimir Bandic, B. V. K. Vijaya Kumar:
Coding scheme for 3D vertical flash memory. CoRR abs/1410.8541 (2014) - 2013
- [c19]Filip Blagojevic, Cyril Guyot, Qingbo Wang, Timothy Tsai, Robert Mateescu, Zvonimir Bandic:
Priority IO Scheduling in the Cloud. HotCloud 2013 - [c18]Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zvonimir Bandic:
Repair-optimal MDS array codes over GF(2). ISIT 2013: 887-891 - [i7]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. CoRR abs/1301.0564 (2013) - [i6]Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zvonimir Bandic:
Repair-Optimal MDS Array Codes over GF(2). CoRR abs/1302.4129 (2013) - 2012
- [i5]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. CoRR abs/1206.5266 (2012) - [i4]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. CoRR abs/1207.1407 (2012) - [i3]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. CoRR abs/1207.4119 (2012) - [i2]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. CoRR abs/1212.2463 (2012) - 2010
- [j6]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. J. Artif. Intell. Res. 37: 279-328 (2010) - [j5]Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jehoshua Bruck, Paul H. Siegel, Alexander Vardy, Jack K. Wolf:
Storage coding for wear leveling in flash memories. IEEE Trans. Inf. Theory 56(10): 5290-5299 (2010) - [c17]Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck:
Data movement and aggregation in flash memories. ISIT 2010: 1918-1922
2000 – 2009
- 2009
- [j4]Anxiao Jiang, Robert Mateescu, Moshe Schwartz, Jehoshua Bruck:
Rank modulation for flash memories. IEEE Trans. Inf. Theory 55(6): 2659-2673 (2009) - [c16]Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck:
Data movement in flash memories. Allerton 2009: 1031-1038 - [c15]Jehoshua Bruck, Alexander Vardy, Anxiao Andrew Jiang, Eitan Yaakobi, Jack K. Wolf, Robert Mateescu, Paul H. Siegel:
Storage coding for wear leveling in flash memories. ISIT 2009: 1229-1233 - [i1]Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jehoshua Bruck, Paul H. Siegel, Alexander Vardy, Jack K. Wolf:
Storage Coding for Wear Leveling in Flash Memories. CoRR abs/0911.3992 (2009) - 2008
- [j3]Robert Mateescu, Rina Dechter:
Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008) - [j2]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. 33: 465-519 (2008) - [c14]Robert Mateescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models 2008: 238-257 - [c13]Anxiao Jiang, Robert Mateescu, Moshe Schwartz, Jehoshua Bruck:
Rank modulation for flash memories. ISIT 2008: 1731-1735 - 2007
- [j1]Rina Dechter, Robert Mateescu:
AND/OR search spaces for graphical models. Artif. Intell. 171(2-3): 73-106 (2007) - [c12]Robert Mateescu, Radu Marinescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513 - [c11]Robert Mateescu, Rina Dechter:
A Comparison of Time-Space Schemes for Graphical Models. IJCAI 2007: 2346-2352 - [c10]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. UAI 2007: 276-284 - 2006
- [c9]Robert Mateescu, Rina Dechter:
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). CP 2006: 329-343 - 2005
- [c8]Robert Mateescu, Rina Dechter:
AND/OR Search Spaces and the Semantic Width of Constraint Networks. CP 2005: 860 - [c7]Robert Mateescu, Rina Dechter:
AND/OR Cutset Conditioning. IJCAI 2005: 230-235 - [c6]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. UAI 2005: 380-387 - 2004
- [c5]Rina Dechter, Robert Mateescu:
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. CP 2004: 731-736 - [c4]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. UAI 2004: 120-129 - 2003
- [c3]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. UAI 2003: 175-183 - 2002
- [c2]Robert Mateescu, Rina Dechter, Kalev Kask:
Tree Approximation for Belief Updating. AAAI/IAAI 2002: 553-559 - [c1]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. UAI 2002: 128-136
Coauthor Index
aka: Zvonimir Z. Bandic
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
