{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:49:53Z","timestamp":1730296193238,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979,10]]},"DOI":"10.1109\/sfcs.1979.4","type":"proceedings-article","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T11:46:42Z","timestamp":1217504802000},"page":"319-327","source":"Crossref","is-referenced-by-count":9,"title":["A time-space tradeoff for sorting on non-oblivious machines"],"prefix":"10.1109","author":[{"given":"Allan","family":"Borodin","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"David G.","family":"Kirkpatrick","sequence":"additional","affiliation":[]},{"given":"Nancy A.","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Tompa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08342-1_28"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322091"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321730"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.19"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055938"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804348"},{"journal-title":"Time-space tradeoffs for straight-line and branching programs","year":"1978","author":"tompa","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1966.30"},{"key":"ref6","volume":"3","author":"knuth","year":"1973","journal-title":"The art of computer programming"},{"key":"ref5","first-page":"38","volume":"60","author":"grigoryev","year":"1976","journal-title":"Notes of Scientific Seminars"},{"journal-title":"A fast algorithm for the string editing problem and decision graph complexity","year":"1976","author":"masek","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804420"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90027-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.32"}],"event":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","start":{"date-parts":[[1979,10,29]]},"location":"San Juan, Puerto Rico","end":{"date-parts":[[1979,10,31]]}},"container-title":["20th Annual Symposium on Foundations of Computer Science (sfcs 1979)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4567990\/4567991\/04568027.pdf?arnumber=4568027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T15:43:47Z","timestamp":1489679027000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4568027\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/sfcs.1979.4","relation":{},"subject":[],"published":{"date-parts":[[1979,10]]}}}