{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T18:51:44Z","timestamp":1761418304050},"reference-count":1,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1137\/0215065","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T11:28:10Z","timestamp":1109244490000},"page":"932-947","source":"Crossref","is-referenced-by-count":23,"title":["Communication Complexity of Computing the Hamming Distance"],"prefix":"10.1137","volume":"15","author":[{"given":"King F.","family":"Pang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abbas","family":"El Gamal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90144-4"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0215065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:18:46Z","timestamp":1485710326000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0215065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":1,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["10.1137\/0215065"],"URL":"https:\/\/doi.org\/10.1137\/0215065","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}