{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:34Z","timestamp":1775097034100,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540730002","type":"print"},{"value":"9783540730019","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_3","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"25-27","source":"Crossref","is-referenced-by-count":12,"title":["Reachability Problems: An Update"],"prefix":"10.1007","author":[{"given":"Eric","family":"Allender","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"299","volume-title":"IEEE Conference on Computational Complexity","author":"E. Allender","year":"2006","unstructured":"Allender, E., Mix Barrington, D., Chakraborty, T., Datta, S., Roy, S.: Grid graph reachability problems. In: IEEE Conference on Computational Complexity, pp. 299\u2013313. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/11590156_19","volume-title":"Proc. 25th annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS)","author":"E. Allender","year":"2005","unstructured":"Allender, E., Datta, S., Roy, S.: The directed planar reachability problem. In: Proc. 25th annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS). LNCS, vol.\u00a01373, pp. 238\u2013249. Springer, Heidelberg (2005)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C. \u00c0lvarez","year":"1993","unstructured":"\u00c0lvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science\u00a0107, 3\u201330 (1993)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s002240000102","volume":"31","author":"E. Allender","year":"1998","unstructured":"Allender, E., Lange, K.-J.: RUSPACE(logn) is contained in DSPACE(log2\n                        n \/ loglogn). Theory of Computing Systems\u00a031, 539\u2013550 (1998)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jcss.1999.1646","volume":"59","author":"E. Allender","year":"1999","unstructured":"Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. Journal of Computer and System Sciences\u00a059(2), 164\u2013181 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-54458-5_61","volume-title":"Fundamentals of Computation Theory (FCT \u201991)","author":"G. Buntrock","year":"1991","unstructured":"Buntrock, G., Jenner, B., Lange, K.-J., Rossmanith, P.: Unambiguity and fewness for logarithmic space. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 168\u2013179. Springer, Heidelberg (1991)"},{"key":"3_CR7","volume-title":"IEEE Conference on Computational Complexity (to appear","author":"C. Bourke","year":"2007","unstructured":"Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous logspace. In: IEEE Conference on Computational Complexity (to appear, IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N.D. Jones","year":"1975","unstructured":"Jones, N.D.: Space bounded reducibility among combinatorial problems. Journal of Computer and System Sciences\u00a011, 68\u201385 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BFb0023471","volume-title":"14th International Symposium on Theoretical Aspects of Computer Science (STACS)","author":"K.-J. Lange","year":"1997","unstructured":"Lange, K.-J.: An unambiguous class possessing a complete set. In: 14th International Symposium on Theoretical Aspects of Computer Science (STACS). LNCS, vol.\u00a01200, pp. 339\u2013350. Springer, Heidelberg (1997)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1137\/S0097539798339041","volume":"29","author":"K. Reinhardt","year":"2000","unstructured":"Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM Journal of Computing\u00a029, 1118\u20131131 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"3_CR11","first-page":"376","volume-title":"Proceedings 37th Symposium on Foundations of Computer Science","author":"O. Reingold","year":"2005","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. In: Proceedings 37th Symposium on Foundations of Computer Science, pp. 376\u2013385. IEEE Computer Society Press, Washington, DC, USA (2005)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-55808-X_10","volume-title":"Symposium on Mathematical Foundations of Computer Science","author":"A. Wigderson","year":"1992","unstructured":"Wigderson, A.: The complexity of graph connectivity. In: Havel, I.M., Koubek, V. (eds.) Symposium on Mathematical Foundations of Computer Science. LNCS, vol.\u00a0629, pp. 112\u2013132. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T03:07:41Z","timestamp":1550459261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}