{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:24:42Z","timestamp":1757312682728,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875120","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"1682-1686","source":"Crossref","is-referenced-by-count":6,"title":["Sorting with adversarial comparators and application to density estimation"],"prefix":"10.1109","author":[{"given":"Jayadev","family":"Acharya","sequence":"first","affiliation":[]},{"given":"Ashkan","family":"Jafarpour","sequence":"additional","affiliation":[]},{"given":"Alon","family":"Orlitsky","sequence":"additional","affiliation":[]},{"given":"Ananda Theertha","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0055"},{"key":"13","article-title":"Faster and sample near-optimal algorithms for proper learning mixtures of gaussians","author":"daskalakis","year":"2013","journal-title":"CoRR"},{"key":"14","article-title":"Nearoptimal- sample estimators for spherical gaussian mixtures","author":"acharya","year":"2014","journal-title":"CoRR"},{"key":"11","first-page":"503","article-title":"Density estimation in linear time","author":"mahalanabis","year":"2008","journal-title":"COLT"},{"key":"12","first-page":"1371","article-title":"Learning k-modal distributions via testing","author":"daskalakis","year":"2012","journal-title":"SODA"},{"key":"3","first-page":"564","article-title":"Selection in the presence of noise: The design of playoff systems","author":"adler","year":"1994","journal-title":"SODA"},{"key":"2","first-page":"268","article-title":"Noisy sorting without resampling","author":"braverman","year":"2008","journal-title":"SODA"},{"key":"1","first-page":"881","article-title":"Noisy binary search and its applications","author":"karp","year":"2007","journal-title":"SODA"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0125-7","author":"devroye","year":"2001","journal-title":"Combinatorial Methods in Density Estimation"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/050623905"},{"key":"5","first-page":"137","article-title":"An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity","volume":"13","author":"ailon","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"4","first-page":"2483","article-title":"Iterative ranking from pair-wise comparisons","author":"negahban","year":"2012","journal-title":"NIPS"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730390"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1798596.1798608"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875120.pdf?arnumber=6875120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:23:08Z","timestamp":1602688988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875120","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}