{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T18:04:48Z","timestamp":1726164288097},"publisher-location":"Boca Raton","edition-number":"1","reference-count":0,"publisher":"Chapman and Hall\/CRC","isbn-type":[{"type":"electronic","value":"9781003033707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,26]]},"DOI":"10.1201\/9781003033707-2","type":"book-chapter","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T13:06:26Z","timestamp":1653570386000},"page":"3-33","source":"Crossref","is-referenced-by-count":0,"title":["A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers)"],"prefix":"10.1201","author":[{"given":"Charles E.","family":"Leiserson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","container-title":["Massive Graph Analytics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T13:06:29Z","timestamp":1653570389000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.taylorfrancis.com\/books\/9781003033707\/chapters\/10.1201\/9781003033707-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,26]]},"ISBN":["9781003033707"],"references-count":0,"URL":"https:\/\/doi.org\/10.1201\/9781003033707-2","relation":{},"subject":[],"published":{"date-parts":[[2022,5,26]]}}}