{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:45Z","timestamp":1725600465592},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_23","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:54:39Z","timestamp":1312952079000},"page":"252-258","source":"Crossref","is-referenced-by-count":1,"title":["ReachFewL = ReachUL"],"prefix":"10.1007","author":[{"given":"Brady","family":"Garvin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derrick","family":"Stolee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghunath","family":"Tewari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. V.","family":"Vinodchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","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. Theoret. Comput. Sci.\u00a0107, 3\u201330 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR2","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)\u2009\u2286\u2009DSPACE(log2\n                n\/loglogn). Theory of Computing Systems\u00a031, 539\u2013550 (1998)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2006.01.005","volume":"355","author":"E. Allender","year":"2006","unstructured":"Allender, E.: NL-printable sets and nondeterministic Kolmogorov complexity. Theor. Comput. Sci.\u00a0355(2), 127\u2013138 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"23_CR4","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"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01374526","volume":"25","author":"G. Buntrock","year":"1992","unstructured":"Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-mod class. Mathematical Systems Theory\u00a025(3), 223\u2013237 (1992)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/inco.1993.1004","volume":"102","author":"G. Buntrock","year":"1993","unstructured":"Buntrock, G., Hemachandra, L.A., Siefkes, D.: Using inductive counting to simulate nondeterministic computation. Information and Computation\u00a0102(1), 102\u2013117 (1993)","journal-title":"Information and Computation"},{"key":"23_CR7","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","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)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1490270.1490274","volume":"1","author":"C. Bourke","year":"2009","unstructured":"Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. ACM Transactions on Computation Theory\u00a01(1), 1\u201317 (2009)","journal-title":"ACM Transactions on Computation Theory"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. J. ACM\u00a031(3), 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BFb0023471","volume-title":"STACS 97","author":"K.-J. Lange","year":"1997","unstructured":"Lange, K.-J.: An unambiguous class possessing a complete set. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 339\u2013350. Springer, Heidelberg (1997)"},{"key":"#cr-split#-23_CR11.1","unstructured":"Pavan, A., Tewari, R., Vinodchandran, N.V.: On the power of unambiguity in logspace (2010);"},{"key":"#cr-split#-23_CR11.2","unstructured":"To appear in Computational Complexity"},{"issue":"4","key":"23_CR12","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(4), 1118\u20131131 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-03409-1_29","volume-title":"Fundamentals of Computation Theory","author":"T. Thierauf","year":"2009","unstructured":"Thierauf, T., Wagner, F.: Reachability in K\n                3, 3-free graphs and K\n                5-free graphs is in unambiguous log-space. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 323\u2013334. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T05:06:17Z","timestamp":1554008777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}