{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:35Z","timestamp":1725747215669},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397172"},{"type":"electronic","value":"9783642397189"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39718-9_8","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T03:01:54Z","timestamp":1377831714000},"page":"122-140","source":"Crossref","is-referenced-by-count":0,"title":["Random Walks on Some Basic Classes of Digraphs"],"prefix":"10.1007","author":[{"given":"Wen-Ju","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Jim","family":"Cox","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: 20th IEEE Symp. on Found. of Computer Science (FOCS 1979), pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/333979.333984","volume":"47","author":"R. Armoni","year":"2000","unstructured":"Armoni, R., Ta-Shma, A., Wigderson, A., Zhou, S.: An O(log(n)4\/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM\u00a047(2), 294\u2013311 (2000)","journal-title":"J. ACM"},{"key":"8_CR3","unstructured":"Chaves, L.M., de Souza, D.J.: Waiting Time for a Run of N Success in Bernoulli Sequences. Rev. Bras. Biom (2007)"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F.R.K. Chung","year":"2005","unstructured":"Chung, F.R.K.: Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics 9, 1\u201319 (2005)","journal-title":"Annals of Combinatorics"},{"issue":"3","key":"8_CR5","first-page":"30","volume":"7","author":"K.-M. Chung","year":"2011","unstructured":"Chung, K.-M., Reingold, O., Vadhan, S.: S-T Connectivity on Digraphs with a Known Stationary Distribution. ACM Transactions on Algorithms\u00a07(3), Article 30 (2011)","journal-title":"ACM Transactions on Algorithms"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms\u00a06, 51\u201354 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"8_CR7","first-page":"60","volume":"18","author":"B. Garvin","year":"2011","unstructured":"Garvin, B., Stolee, D., Tewari, R., Vinodchandran, N.V.: ReachFewL = ReachUL. \u00a0Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 60 (2011)","journal-title":"\u00a0Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Immerman, N., Mahaney, S.: One-way Log-tape Reductions. In: Proc. IEEE FOCS, pp. 65\u201371 (1978)","DOI":"10.1109\/SFCS.1978.31"},{"key":"8_CR9","volume-title":"Analytic inequalities","author":"N.D. Kazarinoff","year":"1961","unstructured":"Kazarinoff, N.D.: Analytic inequalities. Holt, Rinehart and Winston, New York (1961)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Symmetric space-bounded computation. Theoretical Computer Science. pp.161-187 (1982)","DOI":"10.1016\/0304-3975(82)90058-5"},{"key":"8_CR11","unstructured":"Li, Y., Zhang, Z.-L.: Digraph Laplacian and the Degree of Asymmetry. Invited for submission\u00a0to a Special Issue of Internet Mathematics (2011)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Nisan, N., Szemeredi, E., Wigderson, A.: Undirected connectivity in O(log1.5n) space. In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pa, October 1992. IEEE (1992)","DOI":"10.1109\/SFCS.1992.267822"},{"key":"8_CR13","unstructured":"Pavan, A., Tewari, R., Vinodchandran, N.V.: On the Power of Unambiguity in Logspace. Technical Report TR10-009, Electronic Colloquium on Computational Complexity, To appear in Computational Complexity (2010)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected ST-connectivity in log-space. In: STOC 2005, pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Pseudorandom walks on regular digraphs and the RL vs. L Problem. In: STOC 2006, pp. 457\u2013466 (2006)","DOI":"10.1145\/1132516.1132583"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/11538462_37","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E. Rozenman","year":"2005","unstructured":"Rozenman, E., Vadhan, S.: Derandomized Squaring of Graphs. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX and RANDOM 2005. LNCS, vol.\u00a03624, pp. 436\u2013447. Springer, Heidelberg (2005)"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships Between Nondeterministic and Deterministic Tape Complexityies. J. Comput. Syst. Sci.\u00a04(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1006\/jcss.1998.1616","volume":"58","author":"M.E. Saks","year":"1999","unstructured":"Saks, M.E., Zhou, S.: BPHSpace(S) \u2286 DSPace(S3\/2). J. Comput. Syst. Sci.\u00a058(2), 36\u2013403 (1999)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39718-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:55:27Z","timestamp":1558317327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39718-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397172","9783642397189"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39718-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}