{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:54:39Z","timestamp":1778025279678,"version":"3.51.4"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> A new priority queue is introduced, for which the cost to insert a new item is constant and the cost to delete the item x with the minimum value is O( log k<jats:sub>x<\/jats:sub>), where k<jats:sub>x<\/jats:sub>, is the number of items that are inserted after x and are still in the heap when x is deleted. We achieve the above bounds in both the amortized case and the worst case. <\/jats:p>","DOI":"10.1142\/s0129054106004510","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T07:02:04Z","timestamp":1165993324000},"page":"1455-1465","source":"Crossref","is-referenced-by-count":14,"title":["A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY"],"prefix":"10.1142","volume":"17","author":[{"given":"AMR","family":"ELMASRY","sequence":"first","affiliation":[{"name":"Department of Computer Engineering and Systems, Alexandria University, Alexandria, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/0207026"},{"key":"rf5","first-page":"245","volume":"17","author":"Doberkat E.","journal-title":"Acta Informatica"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01990520"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840439"},{"key":"rf14","first-page":"318","volume":"34","author":"Mannila H.","journal-title":"IEEE Transactions on Computers C"},{"key":"rf15","volume-title":"The design of dynamic data structures","author":"Overmars M.","year":"1983"},{"key":"rf16","first-page":"292","volume":"1","author":"Porter Th.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359478"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:27:46Z","timestamp":1565177266000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":10,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129054106004510"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004510","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}