{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T12:10:08Z","timestamp":1751803808337,"version":"3.41.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437599","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"2301-2305","source":"Crossref","is-referenced-by-count":3,"title":["Sublinear- Time Algorithms for Compressive Phase Retrieval"],"prefix":"10.1109","author":[{"given":"Yi","family":"Li","sequence":"first","affiliation":[]},{"given":"Vasileios","family":"Nakos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/15M1053761"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.16"},{"journal-title":"Sublinear-time algorithms for compressive phase retrieval","year":"2017","author":"li","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006707"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693287"},{"key":"ref15","first-page":"24","article-title":"Essai éxperimental et analytique: sur les lois de la dilatabilité de fluides élastique et sur celles de la force expansive de la vapeur de l'alkool, à différentes températures","author":"prony","year":"1795","journal-title":"Journal de l'Ecole Polytechnique Floréal et"},{"journal-title":"Fundamentals of speech recognition","year":"1993","author":"rabiner","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2352673"},{"journal-title":"Predicting positive and negative links with noisy queries Theory & practice","year":"2017","author":"tsourakakis","key":"ref18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.09.004"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"ref5","first-page":"1190","article-title":"Lower bounds for sparse recovery","author":"do ba","year":"2010","journal-title":"Proc 21st SODA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.06.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-015-9434-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875185"},{"journal-title":"Phase retrieval from local measurements Improved robustness via eigenvector-based angular synchronization","year":"2016","author":"iwen","key":"ref9"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437599.pdf?arnumber=8437599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T11:46:37Z","timestamp":1751802397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437599","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}