{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:16:49Z","timestamp":1759331809324},"publisher-location":"Philadelphia, PA","reference-count":0,"publisher":"Society for Industrial and Applied Mathematics","isbn-type":[{"value":"9781611975482","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1137\/1.9781611975482.148","type":"book-chapter","created":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T17:48:06Z","timestamp":1546451286000},"page":"2419-2438","source":"Crossref","is-referenced-by-count":9,"title":["Can We Overcome the <i>n<\/i> log <i>n<\/i> Barrier for Oblivious Sorting?"],"prefix":"10.1137","author":[{"given":"Wei-Kai","family":"Lin","sequence":"first","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Tiancheng","family":"Xie","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2019,1,2]]},"container-title":["Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975482.148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T17:48:26Z","timestamp":1546451306000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9781611975482.148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"ISBN":["9781611975482"],"references-count":0,"alternative-id":["10.1137\/1.9781611975482.148","10.1137\/1.9781611975482"],"URL":"https:\/\/doi.org\/10.1137\/1.9781611975482.148","relation":{},"subject":[],"published":{"date-parts":[[2019,1]]}}}