{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:52:11Z","timestamp":1649073131750},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":["Computer Languages"],"published-print":{"date-parts":[[1978,1]]},"DOI":"10.1016\/0096-0551(78)90028-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"115-126","source":"Crossref","is-referenced-by-count":2,"title":["Three simple node list algorithms"],"prefix":"10.1016","volume":"3","author":[{"suffix":"Jr.","given":"Henry S.","family":"Warren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(78)90028-0_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(74)90116-2","article-title":"Short permutation strings","volume":"10","author":"Adleman","year":"1974","journal-title":"Discrete Mathematics"},{"key":"10.1016\/0096-0551(78)90028-0_BIB2","series-title":"Proc. 7th ACM Symp. on the Theory of Computing","first-page":"177","article-title":"Node listings for reducible flow graphs","author":"Aho","year":"1975"},{"key":"10.1016\/0096-0551(78)90028-0_BIB3","article-title":"Graph-theoretic constructs for program control flow analysis","author":"Allen","year":"1972"},{"key":"10.1016\/0096-0551(78)90028-0_BIB4","article-title":"Selected combinatorial research problems","author":"Chvatal","year":"1972"},{"key":"10.1016\/0096-0551(78)90028-0_BIB5","series-title":"Conference Record of the 2nd ACM Symp. on the Principles of Programming Languages","first-page":"22","article-title":"A fast and usually linear algorithm for global flow analysis","author":"Graham","year":"1975"},{"key":"10.1016\/0096-0551(78)90028-0_BIB6","series-title":"Conference Record of the 2nd ACM Conf. on Principles of Programming Languages","first-page":"10","article-title":"Node listings applied to data flow analysis","author":"Kennedy","year":"1975"},{"key":"10.1016\/0096-0551(78)90028-0_BIB7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(76)90057-1","article-title":"A lower bound on the length of a sequence containing all permutations as subsequences","volume":"A21","author":"Kleitman","year":"1976","journal-title":"J. Comb. Theory"},{"key":"10.1016\/0096-0551(78)90028-0_BIB8","author":"Knuth","year":"1968"},{"key":"10.1016\/0096-0551(78)90028-0_BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(75)90004-7","article-title":"Shortest string containing all permutations","volume":"11","author":"Koutas","year":"1975","journal-title":"Discrete Mathematics"},{"key":"10.1016\/0096-0551(78)90028-0_BIB10","article-title":"Lower bounds on the lengths of node sequences in directed graphs","author":"Markowsky","year":"1975"},{"key":"10.1016\/0096-0551(78)90028-0_BIB11","article-title":"Notes on a problem involving permutations as Subsequences","author":"Newey","year":"1973"},{"key":"10.1016\/0096-0551(78)90028-0_BIB12","unstructured":"C. J. Tan and J. D. Rutledge, Personal communication."},{"key":"10.1016\/0096-0551(78)90028-0_BIB13","series-title":"2nd USA-Japan Computer Conf. Proc.","first-page":"335","article-title":"A survey of data flow analysis techniques","author":"Ullman","year":"1975"},{"key":"10.1016\/0096-0551(78)90028-0_BIB14","unstructured":"A. B. Wadia, Personal communication."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055178900280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055178900280?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T09:20:03Z","timestamp":1552641603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055178900280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["0096055178900280"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(78)90028-0","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}