{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:13:37Z","timestamp":1742933617340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_24","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"286-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear-Time In-Place DFS and BFS on\u00a0the\u00a0Word\u00a0RAM"],"prefix":"10.1007","author":[{"given":"Frank","family":"Kammer","sequence":"first","affiliation":[]},{"given":"Andrej","family":"Sajenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"(3, Part B)","key":"24_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.comgeo.2013.11.004","volume":"47","author":"T Asano","year":"2014","unstructured":"Asano, T., et al.: Reprint of: memory-constrained algorithms for simple polygons. Comput. Geom. Theory Appl. 47((3, Part B)), 469\u2013479 (2014). https:\/\/doi.org\/10.1016\/j.comgeo.2013.11.004","journal-title":"Comput. Geom. Theory Appl."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-13075-0_44","volume-title":"Algorithms and Computation","author":"T Asano","year":"2014","unstructured":"Asano, T., et al.: Depth-first search using $$O(n)$$ bits. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 553\u2013564. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_44"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Barba, L., Korman, M., Langerman, S., Silveira, R.I., Sadakane, K.: Space-time trade-offs for stack-based algorithms. In Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). LIPIcs, vol. 20, pp. 281\u2013292. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2013.281","DOI":"10.4230\/LIPIcs.STACS.2013.281"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0220017","volume":"20","author":"P Beame","year":"1991","unstructured":"Beame, P.: A general sequential time-space tradeoff for finding unique elements. SIAM J. Comput. 20(2), 270\u2013277 (1991). https:\/\/doi.org\/10.1137\/0220017","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2003.05.004","volume":"321","author":"H Br\u00f6nnimann","year":"2004","unstructured":"Br\u00f6nnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.: Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1), 25\u201340 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.05.004","journal-title":"Theor. Comput. Sci."},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Mukherjee, A., Raman, V., Satti, S.R.: A framework for in-place graph algorithms. In: Proceedings 26th Annual European Symposium on Algorithms (ESA 2018), LNCS, pp. 13:1\u201313:16. Springer (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.13","DOI":"10.4230\/LIPIcs.ESA.2018.13"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Raman, V., Satti, S.R.: Biconnectivity, chain decomposition and st-numbering using $${O}(n)$$ bits. In: Proceedings 27th International Symposium on Algorithms and Computation (ISAAC 2016). LIPIcs, vol. 64, pp. 22:1\u201322:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2016.22","DOI":"10.4230\/LIPIcs.ISAAC.2016.22"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Timothy, M.C., Munro, J.I., Raman, V.: Selection and sorting in the \u201crestore\" model. In: Proceedings 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 995\u20131004. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.74","DOI":"10.1137\/1.9781611973402.74"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/3168005","volume":"14","author":"MC Timothy","year":"2018","unstructured":"Timothy, M.C., Munro, J.I., Raman, V.: Selection and sorting in the restore model. ACM Trans. Algorithms 14(2), 11:1\u201311:18 (2018). https:\/\/doi.org\/10.1145\/3168005","journal-title":"ACM Trans. Algorithms"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Datta, S., Kulkarni, R., Mukherjee, A.: Space-efficient approximation scheme for maximum matching in sparse graphs. In: Proceedings 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). LIPIcs, vol. 58, pp. 28:1\u201328:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.28","DOI":"10.4230\/LIPIcs.MFCS.2016.28"},{"issue":"6","key":"24_CR11","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1137\/S0097539795295948","volume":"28","author":"J Edmonds","year":"1999","unstructured":"Edmonds, J., Poon, C.K., Achlioptas, D.: Tight lower bounds for $$st$$-connectivity on the NNJAG model. SIAM J. Comput. 28(6), 2257\u20132284 (1999). https:\/\/doi.org\/10.1137\/S0097539795295948","journal-title":"SIAM J. Comput."},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Elmasry, A., Hagerup, T., Kammer, F.: Space-efficient basic graph algorithms. In: Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). LIPIcs, vol. 30, pp. 288\u2013301. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.288","DOI":"10.4230\/LIPIcs.STACS.2015.288"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2013.09.031","volume":"513","author":"A Farzan","year":"2013","unstructured":"Farzan, A., Munro, J.I.: Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513, 38\u201352 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.09.031","journal-title":"Theor. Comput. Sci."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-75520-3_19","volume-title":"Algorithms \u2013 ESA 2007","author":"G Franceschini","year":"2007","unstructured":"Franceschini, G., Muthukrishnan, S., P\u01cetra\u015fcu, M.: Radix sorting with no extra space. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 194\u2013205. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_19"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Upper bounds for time-space trade-offs in sorting and selection. J. Comput. Syst. Sci. 34(1), 19\u201326 (1987). http:\/\/dl.acm.org\/citation.cfm?id=762350.762354","DOI":"10.1016\/0022-0000(87)90002-X"},{"key":"24_CR16","unstructured":"Hagerup, T.: Small uncolored and colored choice dictionaries. Computing Research Repository (CoRR), abs\/1809.07661 (2018)"},{"key":"24_CR17","unstructured":"Hagerup, T., Kammer, F.: Succinct choice dictionaries. Computing Research Repository (CoRR), abs\/1604.06058 (2016)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Kammer, F., Sajenko, A.: Linear-time in-place DFS and BFS on the word RAM. Computing Research Repository (CoRR), abs\/1803.04282 (2018)","DOI":"10.1007\/978-3-030-17402-6_24"},{"key":"24_CR19","doi-asserted-by":"publisher","unstructured":"Kammer, F., Sajenko, A.: Simple $$2^f$$-color choice dictionaries. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018). LIPIcs, vol. 123, pp, 66:1\u201366:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.66","DOI":"10.4230\/LIPIcs.ISAAC.2018.66"},{"key":"24_CR20","unstructured":"Kammer, F., Sajenko, A.: Space efficient (graph) algorithms (2018). https:\/\/github.com\/thm-mni-ii\/sea"},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"JI Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. Theor. Comput. Sci. 12(3), 315\u2013323 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90061-4","journal-title":"Theor. Comput. Sci."},{"key":"24_CR22","doi-asserted-by":"publisher","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: Proceedings 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 264\u2013268. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743455","DOI":"10.1109\/SFCS.1998.743455"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:57:11Z","timestamp":1710334631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"30","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":"32% - 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":"14","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)"}}]}}