{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:51Z","timestamp":1750307271056,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1145\/195058.195241","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T16:40:52Z","timestamp":1069778452000},"page":"497-506","source":"Crossref","is-referenced-by-count":3,"title":["Derandomization through approximation"],"prefix":"10.1145","author":[{"given":"David R.","family":"Karger","sequence":"first","affiliation":[]},{"given":"Rajeev","family":"Motwani","sequence":"additional","affiliation":[]}],"member":"320","event":{"number":"26","sponsor":["SIGACT, ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '94","name":"the twenty-sixth annual ACM symposium","start":{"date-parts":[[1994,5,23]]},"location":"Montreal, Quebec, Canada","end":{"date-parts":[[1994,5,25]]}},"container-title":["Proceedings of the twenty-sixth annual ACM symposium on Theory of computing  - STOC '94"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/195058.195241","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=195241&amp;ftid=50225&amp;dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:58Z","timestamp":1750243978000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=195058.195241"}},"subtitle":["an <i>NC<\/i> algorithm for minimum cuts"],"proceedings-subject":"Theory of computing","short-title":[],"issued":{"date-parts":[[1994]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/195058.195241","relation":{},"subject":[],"published":{"date-parts":[[1994]]}}}