{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:22:59Z","timestamp":1781072579121,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806719","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"201-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":178,"title":["Detecting high log-densities"],"prefix":"10.1145","author":[{"given":"Aditya","family":"Bhaskara","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eden","family":"Chlamtac","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aravindan","family":"Vijayaraghavan","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4%3C457::AID-RSA14%3E3.0.CO;2-W"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2008","unstructured":"N. Alon and J. Spencer . The Probabilistic Method . Wiley-Interscience , third edition, 2008 . N.Alon and J.Spencer. The Probabilistic Method. Wiley-Interscience, third edition, 2008."},{"key":"e_1_3_2_1_3_1","volume-title":"Public key cryptography from different assumptions. Preliminary version as cryptology eprint report 2008\/335 by Barak and Wigderson","author":"Applebaum B.","year":"2008","unstructured":"B. Applebaum , B. Barak , and A. Wigderson . Public key cryptography from different assumptions. Preliminary version as cryptology eprint report 2008\/335 by Barak and Wigderson , 2008 . B.Applebaum, B.Barak, and A.Wigderson. Public key cryptography from different assumptions. Preliminary version as cryptology eprint report 2008\/335 by Barak and Wigderson, 2008."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the First Symposium on Innovations in Computer Science (ICS)","author":"Arora S.","year":"2010","unstructured":"S. Arora , B. Barak , M. Brunnermeier , and R. Ge . Computational complexity and information asymmetry in financial products . In Proceedings of the First Symposium on Innovations in Computer Science (ICS) , 2010 . S.Arora, B.Barak, M.Brunnermeier, and R.Ge. Computational complexity and information asymmetry in financial products. In Proceedings of the First Symposium on Innovations in Computer Science (ICS), 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00243-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9142-2"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-642-04128-0_3","volume-title":"ESA","author":"Charikar M.","year":"2009","unstructured":"M. Charikar , M. Hajiaghayi , and H.J. Karloff . Improved approximation algorithms for label cover problems . In ESA , volume 5757 of Lecture Notes in Computer Science , pages 23 -- 34 . Springer , 2009 . M.Charikar, M.Hajiaghayi, and H.J. Karloff. Improved approximation algorithms for label cover problems. In ESA, volume 5757 of Lecture Notes in Computer Science, pages 23--34. Springer, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509985"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1183"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.59"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646687.702946"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806719","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806719"}},"subtitle":["an\n            <i>O<\/i>\n            (\n            <i>n<\/i>\n            <sup>\u00bc<\/sup>\n            ) approximation for densest\n            <i>k<\/i>\n            -subgraph"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":15,"alternative-id":["10.1145\/1806689.1806719","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806719","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}