{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:31:10Z","timestamp":1771486270041,"version":"3.50.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030500252","type":"print"},{"value":"9783030500269","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_15","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"211-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Randomized and Symmetric Catalytic Computation"],"prefix":"10.1007","author":[{"given":"Samir","family":"Datta","sequence":"first","affiliation":[]},{"given":"Chetan","family":"Gupta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8567-9475","authenticated-orcid":false,"given":"Rahul","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Vimal Raj","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Raghunath","family":"Tewari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Buhrman, H., Cleve, R., Kouck\u00fd, M., Loff, B., Speelman, F.: Computing with a full memory: catalytic space. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 857\u2013866. ACM, New York (2014). \nhttps:\/\/doi.org\/10.1145\/2591796.2591874","DOI":"10.1145\/2591796.2591874"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00224-017-9784-7","volume":"62","author":"H Buhrman","year":"2018","unstructured":"Buhrman, H., Kouck\u00fd, M., Loff, B., Speelman, F.: Catalytic space: non-determinism and hierarchy. Theory Comput. Syst. 62(1), 116\u2013135 (2018). \nhttps:\/\/doi.org\/10.1007\/s00224-017-9784-7","journal-title":"Theory Comput. Syst."},{"key":"15_CR3","unstructured":"Girard, V., Kouck\u00fd, M., McKenzie, P.: Nonuniform catalytic space and the direct sum for space. Electron. Colloq. Comput. Complex. (ECCC) 22, 138 (2015). \nhttp:\/\/eccc.hpi-web.de\/report\/2015\/138"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Gupta, C., Jain, R., Sharma, V.R., Tewari, R.: Unambiguous catalytic computation. In: FSTTCS 2019. Leibniz International Proceedings in Informatics (LIPIcs), vol. 150, pp. 16:1\u201316:13 (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2019.16\n\n. \nhttps:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11578","DOI":"10.4230\/LIPIcs.FSTTCS.2019.16"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 220\u2013229. ACM, New York (1997). \nhttps:\/\/doi.org\/10.1145\/258533.258590","DOI":"10.1145\/258533.258590"},{"issue":"5","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"AR Klivans","year":"2002","unstructured":"Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31(5), 1501\u20131526 (2002). \nhttps:\/\/doi.org\/10.1137\/S0097539700389652","journal-title":"SIAM J. Comput."},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M Kouck\u00fd","year":"2002","unstructured":"Kouck\u00fd, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65(4), 717\u2013726 (2002). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000002000235","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","volume":"19","author":"HR Lewis","year":"1982","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Symmetric space-bounded computation. Theoret. Comput. Sci. 19(2), 161\u2013187 (1982). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397582900585","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4) (2008). \nhttps:\/\/doi.org\/10.1145\/1391289.1391291","DOI":"10.1145\/1391289.1391291"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:06:54Z","timestamp":1592780814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":">= 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}