{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:56Z","timestamp":1742913116800,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_30","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"356-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism"],"prefix":"10.1007","author":[{"given":"Frank","family":"Kammer","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Meintrup","sequence":"additional","affiliation":[]},{"given":"Andrej","family":"Sajenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"30_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-38236-9_4","volume-title":"Theory and Applications of Models of Computation","author":"T Asano","year":"2013","unstructured":"Asano, T., Elmasry, A., Katajainen, J.: Priority queues and sorting for read-only data. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 32\u201341. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38236-9_4"},{"key":"30_CR3","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":"30_CR4","unstructured":"Baird, H.S., Cho, Y.E.: An artwork design verification system. In: Proc. 12th Conference on Design (DAC 1975), pp. 414\u2013420. IEEE (1975)"},{"issue":"8","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1007\/s00224-017-9841-2","volume":"62","author":"N Banerjee","year":"2018","unstructured":"Banerjee, N., Chakraborty, S., Raman, V., Satti, S.R.: Space efficient linear time algorithms for BFS, DFS and applications. Theory Comput. Syst. 62(8), 1736\u20131762 (2018). https:\/\/doi.org\/10.1007\/s00224-017-9841-2","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-010-9452-7","volume":"62","author":"J Barbay","year":"2012","unstructured":"Barbay, J., Aleardi, L.C., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica 62(1), 224\u2013257 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9452-7","journal-title":"Algorithmica"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-24766-9_7","volume-title":"Algorithms and Data Structures","author":"T Baumann","year":"2019","unstructured":"Baumann, T., Hagerup, T.: Rank-select indices without tears. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 85\u201398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_7"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0211022","volume":"11","author":"A Borodin","year":"1982","unstructured":"Borodin, A., Cook, S.A.: A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput. 11(2), 287\u2013297 (1982). https:\/\/doi.org\/10.1137\/0211022","journal-title":"SIAM J. Comput."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-63385-5_30","volume-title":"Computational Logic and Proof Theory","author":"SR Buss","year":"1997","unstructured":"Buss, S.R.: Alogtime algorithms for tree isomorphism, comparison, and canonization. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol. 1289, pp. 18\u201333. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63385-5_30"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721842","volume":"6","author":"TM Chan","year":"2010","unstructured":"Chan, T.M.: Comparison-based time-space lower bounds for selection. ACM Trans. Algorithms 6(2), 1\u201316 (2010). https:\/\/doi.org\/10.1145\/1721837.1721842","journal-title":"ACM Trans. Algorithms"},{"key":"30_CR11","unstructured":"Choudhari, J., Gupta, M., Sharma, S.: Nearly optimal space efficient algorithm for depth first search. arXiv preprint arXiv:1810.07259 (2018)"},{"key":"30_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246\u2013260 (1974). https:\/\/doi.org\/10.1145\/321812.321820","journal-title":"J. ACM"},{"key":"30_CR14","doi-asserted-by":"publisher","unstructured":"Elmasry, A., Hagerup, T., Kammer, F.: Space-efficient basic graph algorithms. In: Proc. 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"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-012-9664-0","volume":"68","author":"A Farzan","year":"2012","unstructured":"Farzan, A., Munro, J.I.: A uniform paradigm to succinctly encode various families of trees. Algorithmica 68(1), 16\u201340 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9664-0","journal-title":"Algorithmica"},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Upper bounds for time-space trade-offs in sorting and selection. J. Comput. Syst. Sci. 34(1), 19\u201326 (1987). https:\/\/doi.org\/10.1016\/0022-0000(87)90002-X","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 366\u2013398. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028575"},{"key":"30_CR18","doi-asserted-by":"publisher","unstructured":"Hagerup, T.: A constant-time colored choice dictionary with almost robust iteration. In: Proc. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). LIPIcs, vol. 138, pp. 64:1\u201364:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.64","DOI":"10.4230\/LIPIcs.MFCS.2019.64"},{"issue":"4","key":"30_CR19","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s00453-019-00629-x","volume":"82","author":"T Hagerup","year":"2019","unstructured":"Hagerup, T.: Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster. Algorithmica 82(4), 1033\u20131056 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00629-x","journal-title":"Algorithmica"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2018.01.008","volume":"754","author":"T Hagerup","year":"2019","unstructured":"Hagerup, T., Kammer, F., Laudahn, M.: Space-efficient Euler partition and bipartite edge coloring. Theor. Comput. Sci. 754, 16\u201334 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.01.008","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"30_CR21","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1007\/s00453-019-00626-0","volume":"82","author":"Y Han","year":"2019","unstructured":"Han, Y.: Sorting real numbers in $$O\\big (n\\sqrt{\\log n}\\big )$$ time and linear space. Algorithmica 82(4), 966\u2013978 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00626-0","journal-title":"Algorithmica"},{"key":"30_CR22","doi-asserted-by":"publisher","unstructured":"He, M., Munro, J.I., Nekrich, Y., Wild, S., Wu, K.: Distance Oracles for interval graphs via breadth-first rank\/select in succinct trees. In: 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 181, pp. 25:1\u201325:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2020.25","DOI":"10.4230\/LIPIcs.ISAAC.2020.25"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-27868-9_6","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"C Irniger","year":"2004","unstructured":"Irniger, C., Bunke, H.: Decision tree structures for graph database filtering. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR \/SPR 2004. LNCS, vol. 3138, pp. 66\u201375. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27868-9_6"},{"issue":"3","key":"30_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/320831.320834","volume":"3","author":"EJ Isaac","year":"1956","unstructured":"Isaac, E.J., Singleton, R.C.: Sorting by address calculation. J. ACM 3(3), 169\u2013174 (1956). https:\/\/doi.org\/10.1145\/320831.320834","journal-title":"J. ACM"},{"key":"30_CR25","doi-asserted-by":"publisher","unstructured":"Izumi, T., Otachi, Y.: Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), vol. 168, pp. 67:1\u201367:17 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.67","DOI":"10.4230\/LIPIcs.ICALP.2020.67"},{"key":"30_CR26","doi-asserted-by":"publisher","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 549\u2013554. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63533","DOI":"10.1109\/SFCS.1989.63533"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Kammer, F., Meintrup, J.: Space-efficient graph coarsening with applications to succinct planar encodings. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022), vol. 248, pp. 62:1\u201362:15 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2022.62","DOI":"10.4230\/LIPIcs.ISAAC.2022.62"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Kammer, F., Meintrup, J.: Succinct planar encoding with minor operations (2023)","DOI":"10.2139\/ssrn.4805893"},{"issue":"9","key":"30_CR29","doi-asserted-by":"publisher","first-page":"2414","DOI":"10.1007\/s00453-022-00967-3","volume":"84","author":"F Kammer","year":"2022","unstructured":"Kammer, F., Meintrup, J., Sajenko, A.: Space-efficient vertex separators for treewidth. Algorithmica 84(9), 2414\u20132461 (2022). https:\/\/doi.org\/10.1007\/s00453-022-00967-3","journal-title":"Algorithmica"},{"key":"30_CR30","doi-asserted-by":"publisher","unstructured":"Kammer, F., Sajenko, A.: Simple $$2^f$$-color choice dictionaries. In: Proc. 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":"30_CR31","unstructured":"Kammer, F., Sajenko, A.: Sorting and ranking of self-delimiting numbers with applications to tree isomorphism. arXiv preprint arXiv:2002.07287 (2020)"},{"key":"30_CR32","doi-asserted-by":"publisher","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: Proc. 39th Annual 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"},{"key":"30_CR33","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding $$k$$-ary trees and multisets. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 233\u2013242. ACM\/SIAM (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T19:12:08Z","timestamp":1729537928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"86","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":"33","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":"38% - 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.04","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":"5.69","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)"}}]}}