{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:05:13Z","timestamp":1648832713758},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1993,3]]},"abstract":"<jats:p> We show that the Largest Empty Rectangle problem can be solved by reducing it, in a natural way, to the All Nearest Smaller Values problem. We provide two classes of algorithms: the first one assumes that the input points are available sorted by x (resp. y) coordinate. Our algorithm corresponding to this case runs in O(log log n) time using [Formula: see text] processors in the Common-CRCW-PRAM model. For unsorted input, we present algorithms that run in [Formula: see text] time using [Formula: see text] processors in the Common-CRCW-PRAM, or in O( log n) time using [Formula: see text] processors in the EREW-PRAM model. No sub-logarithmic time parallel algorithms have been previously reported for this problem. <\/jats:p>","DOI":"10.1142\/s0129626493000113","type":"journal-article","created":{"date-parts":[[2004,11,22]],"date-time":"2004-11-22T22:29:30Z","timestamp":1101162570000},"page":"79-85","source":"Crossref","is-referenced-by-count":0,"title":["SUB-LOGARITHMIC ALGORITHMS FOR THE LARGEST EMPTY RECTANGLE PROBLEM"],"prefix":"10.1142","volume":"03","author":[{"given":"STEPHAN","family":"OLARIU","sequence":"first","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WENHUI","family":"SHEN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LARRY","family":"WILSON","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626493000113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:24:36Z","timestamp":1565094276000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626493000113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1993,3]]}},"alternative-id":["10.1142\/S0129626493000113"],"URL":"https:\/\/doi.org\/10.1142\/s0129626493000113","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}