{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T05:46:27Z","timestamp":1772343987321,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3917,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0022-0000(02)00023-5","type":"journal-article","created":{"date-parts":[[2002,12,27]],"date-time":"2002-12-27T18:04:53Z","timestamp":1041012293000},"page":"717-726","source":"Crossref","is-referenced-by-count":42,"title":["Universal traversal sequences with backtracking"],"prefix":"10.1016","volume":"65","author":[{"given":"Michal","family":"Kouck\u00fd","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00023-5_BIBA","unstructured":"R. Aleliunas, A simple graph traversing problem, Master's Thesis, University of Toronto, 1978 (Technical Report 20)."},{"key":"10.1016\/S0022-0000(02)00023-5_BIBAKLLR","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: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1979, pp. 218\u2013223.","DOI":"10.1109\/SFCS.1979.34"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBAAR","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(90)90125-V","article-title":"Universal sequences for complete graphs","volume":"27","author":"Alon","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0022-0000(02)00023-5_BIBATWZ","doi-asserted-by":"crossref","unstructured":"R. Armoni, A. Ta-Shma, A. Wigderson, S. Zhou, SL\u2286 L4\/3, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1997, pp. 230\u2013239.","DOI":"10.1145\/258533.258593"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBBNS","doi-asserted-by":"crossref","unstructured":"L. Babai, N. Nisan, M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences (extended abstract), in: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1989, pp. 1\u201311.","DOI":"10.1145\/73007.73008"},{"issue":"2","key":"10.1016\/S0022-0000(02)00023-5_BIBBBKLW","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":"2","key":"10.1016\/S0022-0000(02)00023-5_BIBBRT","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0022-0000(92)90046-L","article-title":"Lower bounds on the length of traversal sequences","volume":"45","author":"Borodin","year":"1992","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/S0022-0000(02)00023-5_BIBB","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"},{"issue":"2","key":"10.1016\/S0022-0000(02)00023-5_BIBBT","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1006\/inco.1995.1117","article-title":"Lower bounds on universal traversal sequences based on chains of length five","volume":"120","author":"Buss","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0022-0000(02)00023-5_BIBCRRST","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, P. Tiwari, The electrical resistance of a graph captures its commute and cover times, in: Proceedings of the 21st Annual ACMSymposium on Theory of Computing, ACM, New York, NY, 1989, pp. 574\u2013586.","DOI":"10.1145\/73007.73062"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBD","doi-asserted-by":"crossref","unstructured":"H.K. Dai, Optimizing a computational method for length lower bounds for reflecting sequences, in: Proceedings of \u201cThe 7th Annual International Computing and Combinatorics Conference,\u201d Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 228\u2013236.","DOI":"10.1007\/3-540-44679-6_25"},{"issue":"2","key":"10.1016\/S0022-0000(02)00023-5_BIBHW","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."},{"key":"10.1016\/S0022-0000(02)00023-5_BIBINW","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, N. Nisan, A. Wigderson, Pseudorandomness for network algorithms, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, New York, NY, 1994, pp. 356\u2013364.","DOI":"10.1145\/195058.195190"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBIM","series-title":"Markov Chains, Theory and Applications","author":"Isaacson","year":"1976"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBI","doi-asserted-by":"crossref","unstructured":"S. Istrail, Polynomial universal traversing sequences for cycles are constructible (extended abstract), in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1988, pp. 491\u2013503.","DOI":"10.1145\/62212.62260"},{"issue":"1","key":"10.1016\/S0022-0000(02)00023-5_BIBKLNS","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01048274","article-title":"On the cover time of random walks on graphs","volume":"2","author":"Kahn","year":"1989","journal-title":"J. Theor. Probab."},{"issue":"5","key":"10.1016\/S0022-0000(02)00023-5_BIBKPS","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."},{"key":"10.1016\/S0022-0000(02)00023-5_BIBK","doi-asserted-by":"crossref","unstructured":"M. Kouck\u00fd, Log-space constructible universal traversal sequences for cycles of length O(n4.03), Theoret. Comput. Sci., to appear. (Extended abstract appeared in proceedings of \u201cThe 7th Annual International Computing and Combinatorics Conference,\u201d Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 11\u201320.)","DOI":"10.1007\/3-540-44679-6_2"},{"issue":"4","key":"10.1016\/S0022-0000(02)00023-5_BIBN","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"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBNSW","doi-asserted-by":"crossref","unstructured":"N. Nisan, E. Szemer\u00e9di, A. Wigderson, Undirected connectivity in O(log1.5n) space, in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 24\u201329.","DOI":"10.1109\/SFCS.1992.267822"},{"key":"10.1016\/S0022-0000(02)00023-5_BIBSZ","unstructured":"M. Saks, S. Zhou, RSPACE(S)\u2286 DSPACE(S3\/2), in: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 344\u2013353."},{"issue":"6","key":"10.1016\/S0022-0000(02)00023-5_BIBT","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1137\/0221067","article-title":"Lower bounds on universal traversal sequences for cycles and other low degree graphs","volume":"21","author":"Tompa","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000235?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000235?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T23:20:42Z","timestamp":1583968842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0022000002000235"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00023-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}