{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:52:48Z","timestamp":1672343568775},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"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,8]]},"DOI":"10.1016\/0020-0190(88)90197-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"241-243","source":"Crossref","is-referenced-by-count":18,"title":["Universal traversal sequences of length nO(log n) for cliques"],"prefix":"10.1016","volume":"28","author":[{"given":"Howard","family":"J. Karloff","sequence":"first","affiliation":[]},{"given":"Ramamohan","family":"Paturi","sequence":"additional","affiliation":[]},{"given":"Janos","family":"Simon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90197-4_BIB1","first-page":"218","article-title":"Random walks, universal traversal sequences, and the complexity of maze problems","author":"Aleliunas","year":"1979","journal-title":"Proc. 20th IEEE Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0020-0190(88)90197-4_BIB2","series-title":"Tech. Rept. No. CS-86-9","article-title":"Bounds on Universal Sequences","author":"Bar-Noy","year":"1986"},{"key":"10.1016\/0020-0190(88)90197-4_BIB3","series-title":"Tech. Rept. 87-10-01","article-title":"Two Applications of Complementation via Inductive Counting","author":"Borodin","year":"1987"},{"key":"10.1016\/0020-0190(88)90197-4_BIB4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0196-6774(87)90019-8","article-title":"Universal traversal sequences for paths and cycles","volume":"8","author":"Bridgland","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(88)90197-4_BIB5","first-page":"349","article-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(88)90197-4_BIB6","article-title":"Polynomial universal traversing sequences for cycles are constructible","author":"Istrail","year":"1988","journal-title":"Proc. Symp. on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901974?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901974?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:53:30Z","timestamp":1555059210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0020019088901974"],"URL":"http:\/\/dx.doi.org\/10.1016\/0020-0190(88)90197-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}
