{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:46:40Z","timestamp":1733982400760,"version":"3.30.2"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00436-x","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T17:35:20Z","timestamp":1045071320000},"page":"117-144","source":"Crossref","is-referenced-by-count":5,"title":["Log-space constructible universal traversal sequences for cycles of length O(n4.03)"],"prefix":"10.1016","volume":"296","author":[{"given":"Michal","family":"Kouck\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"unstructured":"R. Aleliunas, A simple graph traversing problem, Master's Thesis, University of Toronto, 1978 (Technical Report 20).","key":"10.1016\/S0304-3975(02)00436-X_BIB1"},{"doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lov\u00e1sz, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annu. Symp. on Foundations of Computer Science, 1979, pp. 218\u2013223.","key":"10.1016\/S0304-3975(02)00436-X_BIB2","DOI":"10.1109\/SFCS.1979.34"},{"doi-asserted-by":"crossref","unstructured":"R. Armoni, A. Ta-Shma, A. Wigderson, S. Zhou, SL\u2286 L4\/3, in: Proc. 29th Annu. ACM Symp. on Theory of Computing, 1997, pp. 230\u2013239.","key":"10.1016\/S0304-3975(02)00436-X_BIB3","DOI":"10.1145\/258533.258593"},{"issue":"2","key":"10.1016\/S0304-3975(02)00436-X_BIB4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0218018","article-title":"Bounds on universal sequences","volume":"18","author":"Bar-Noy","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(02)00436-X_BIB5","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"},{"doi-asserted-by":"crossref","unstructured":"H.K. Dai, Optimizing a computational method for length lower bounds for reflecting sequences, in: Proc. 7th Annu. Internat. Computing and Combinatorics Conf., Lecture Notes in Computer Science, vol. 2108, 2001, pp. 228\u2013236.","key":"10.1016\/S0304-3975(02)00436-X_BIB6","DOI":"10.1007\/3-540-44679-6_25"},{"issue":"2","key":"10.1016\/S0304-3975(02)00436-X_BIB7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(93)90199-J","article-title":"Universal traversal sequences for expander graphs","volume":"46","author":"Hoory","year":"1993","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"S. Istrail, Polynomial universal traversing sequences for cycles are constructible (extended abstract), in: Proc. 20th Annu. ACM Symp. on Theory of Computing, 1988, pp. 491\u2013503.","key":"10.1016\/S0304-3975(02)00436-X_BIB8","DOI":"10.1145\/62212.62260"},{"issue":"5","key":"10.1016\/S0304-3975(02)00436-X_BIB9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(88)90197-4","article-title":"Universal traversal sequences of length nO(logn) for cliques","volume":"28","author":"Karloff","year":"1988","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"M. Kouck\u00fd, Universal traversal sequences with backtracking, in: Proc. 16th Annu. IEEE Conf. on Computational Complexity, 2001, pp. 21\u201327.","key":"10.1016\/S0304-3975(02)00436-X_BIB10","DOI":"10.1109\/CCC.2001.933868"},{"issue":"4","key":"10.1016\/S0304-3975(02)00436-X_BIB11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01305237","article-title":"Pseudorandom generators for space-bounded computation","volume":"12","author":"Nisan","year":"1992","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"N. Nisan, E. Szemer\u00e9di, A. Wigderson, Undirected connectivity in O (log1.5n) space, in: Proc. 33rd Annu. Symp. on Foundations of Computer Science, 1992, pp. 24\u201329.","key":"10.1016\/S0304-3975(02)00436-X_BIB12","DOI":"10.1109\/SFCS.1992.267822"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200436X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200436X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:20:50Z","timestamp":1733941250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750200436X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S030439750200436X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00436-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}