{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:36:49Z","timestamp":1648665409516},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0020-0190(98)00141-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"71-78","source":"Crossref","is-referenced-by-count":0,"title":["Efficient algorithms for the temporal precedence problem"],"prefix":"10.1016","volume":"68","author":[{"given":"D.","family":"Ranjan","sequence":"first","affiliation":[]},{"given":"E.","family":"Pontelli","sequence":"additional","affiliation":[]},{"given":"G.","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00141-0_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/202840.202846","article-title":"What is a Pointer Machine?","author":"Ben-Amram","year":"1995"},{"issue":"4","key":"10.1016\/S0020-0190(98)00141-0_BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/0215072","article-title":"On the single-operation worst-case time complexity of the disjoint set union problem","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0020-0190(98)00141-0_BIB3","doi-asserted-by":"crossref","DOI":"10.1137\/0217026","article-title":"A functional approach to data structures and its use in multidimensional searching","volume":"17","author":"Chazelle","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00141-0_BIB4","series-title":"Proc. 19th ACM Symp. on Theory of Computing","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB5","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB6","article-title":"On the definition of an algorithm","volume":"13","author":"Kolmogorov","year":"1958","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB7","article-title":"Dynamic fractional cascading","volume":"5","author":"Menlhorn","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB8","series-title":"Proc. International Conference on Logic Programming","article-title":"Implementation mechanisms for dependent and-parallelism","author":"Pontelli","year":"1997"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB9","series-title":"Proc. International Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"123","article-title":"On the complexity of parallel implementation of logic programs","author":"Pontelli","year":"1997"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB10","article-title":"On the complexity of the insertion\/precedes problem","author":"Pontelli","year":"1997"},{"key":"10.1016\/S0020-0190(98)00141-0_BIB11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcss.1996.0008","article-title":"Lower bounds for the union-find and the split-find problem on pointer machines","volume":"52","author":"La Poutr\u00e9","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00141-0_BIB12","article-title":"The temporal precedence problem","author":"Ranjan","year":"1998"},{"issue":"3","key":"10.1016\/S0020-0190(98)00141-0_BIB13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","article-title":"Storage modification machines","volume":"9","author":"Sch\u00f6nhage","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"18","key":"10.1016\/S0020-0190(98)00141-0_BIB14","article-title":"A class of algorithms which require nonlinear time to mantain disjoint sets","volume":"2","author":"Tarjan","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00141-0_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/BF00289142","article-title":"Maintining order in a generalized linked list","volume":"21","author":"Tsakalidis","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00141-0_BIB16","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:28:41Z","timestamp":1556058521000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0020019098001410"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00141-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}