{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:29:08Z","timestamp":1750109348421},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"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":[[1988,9]]},"DOI":"10.1016\/0020-0190(88)90132-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"43-51","source":"Crossref","is-referenced-by-count":3,"title":["Time-optimal short-circuit evaluation of boolean expressions"],"prefix":"10.1016","volume":"29","author":[{"given":"Masataka","family":"Sassa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ikuo","family":"Nakata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90132-9_BIB1","series-title":"Compilers\u2014Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0020-0190(88)90132-9_BIB2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00288743","article-title":"Algorithms for fast evaluation of boolean expressions","volume":"4","author":"Breitbart","year":"1975","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(88)90132-9_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/spe.4380030406","article-title":"On evaluating boolean expressions","volume":"3","author":"Gudes","year":"1973","journal-title":"Softw. Pract. Exper."},{"key":"10.1016\/0020-0190(88)90132-9_BIB4","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1002\/spe.4380111104","article-title":"Compiling short-circuit boolean expressions in one pass","volume":"11","author":"Logothetis","year":"1981","journal-title":"Softw. Pract. Exper."},{"issue":"3","key":"10.1016\/0020-0190(88)90132-9_BIB5","first-page":"186","article-title":"Compiling algorithms for logical expressions","volume":"16","author":"Nakata","year":"1975","journal-title":"Trans. IPS Japan (Johoshori)"},{"key":"10.1016\/0020-0190(88)90132-9_BIB6","series-title":"Tech. Rept. No. ISE-TR-84-43","article-title":"Time-Optimal Short-Circuit Evaluation of Boolean Expressions","author":"Sassa","year":"1984"},{"issue":"3","key":"10.1016\/0020-0190(88)90132-9_BIB7","first-page":"383","article-title":"A theorem of short-circuit evaluation of boolean expressions","volume":"27","author":"Sassa","year":"1986","journal-title":"Trans. IPS Japan"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:22:00Z","timestamp":1555075320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0020019088901329"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90132-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}