{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:12:33Z","timestamp":1742926353945,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_24","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strictly In-Place Algorithms for Permuting and Inverting Permutations"],"prefix":"10.1007","author":[{"given":"Bart\u0142omiej","family":"Dudek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karol","family":"Pokorski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"24_CR1","volume-title":"Elements of Programming Interviews in Java: The Insiders\u2019 Guide","author":"A Aziz","year":"2015","unstructured":"Aziz, A., Lee, T.H., Prakash, A.: Elements of Programming Interviews in Java: The Insiders\u2019 Guide. CreateSpace Independent Publishing Platform, USA (2015)"},{"issue":"2","key":"24_CR2","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)","journal-title":"SIAM J. Comput."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Birenzwige, O., Golan, S., Porat, E.: Locally consistent parsing for text indexing in small space. In: 31st SODA, pp. 607\u2013626. SIAM (2020)","DOI":"10.1137\/1.9781611975994.37"},{"issue":"2","key":"24_CR4","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)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0022-0000(81)90037-4","volume":"22","author":"A Borodin","year":"1981","unstructured":"Borodin, A., Fischer, M.J., Kirkpatrick, D.G., Lynch, N.A., Tompa, M.: A time-space tradeoff for sorting on non-oblivious machines. J. Comput. Syst. Sci. 22(3), 351\u2013364 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Comparison-based time-space lower bounds for selection. ACM Trans. Algorithms 6(2), 1\u201316 (2010)","DOI":"10.1145\/1721837.1721842"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.03.042","volume":"583","author":"TM Chan","year":"2015","unstructured":"Chan, T.M., Munro, J.I., Raman, V.: Finding median in read-only memory on integer input. Theor. Comput. Sci. 583, 51\u201356 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-662-44777-2_24","volume-title":"Algorithms - ESA 2014","author":"O Darwish","year":"2014","unstructured":"Darwish, O., Elmasry, A.: Optimal time-space tradeoff for the 2d convex-hull problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 284\u2013295. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_24"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev, D., Klawe, M.M., Rodeh, M.: An $${O}(n\\log n)$$ unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms 3(3), 245\u2013260 (1982)","journal-title":"J. Algorithms"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Dudek, B., Gawrychowski, P., Pokorski, K.: Strictly in-place algorithms for permuting and inverting permutations. CoRR abs\/2101.03978 (2021)","DOI":"10.1007\/978-3-030-83508-8_24"},{"key":"24_CR11","unstructured":"El-Zein, H., Munro, J.I., Robertson, M.: Raising permutations to powers in place. In: 27th ISAAC. LIPIcs, vol. 64, pp. 1\u201312. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"5","key":"24_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0020-0190(00)00103-4","volume":"75","author":"JA Ellis","year":"2000","unstructured":"Ellis, J.A., Krahn, T., Fan, H.: Computing the cycles in the perfect shuffle permutation. Inf. Process. Lett. 75(5), 217\u2013224 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/S0097539792238649","volume":"24","author":"FE Fich","year":"1995","unstructured":"Fich, F.E., Munro, J.I., Poblete, P.V.: Permuting in place. SIAM J. Comput. 24(2), 266\u2013278 (1995)","journal-title":"SIAM J. Comput."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-662-48350-3_45","volume-title":"Algorithms \u2013 ESA 2015","author":"J Fischer","year":"2015","unstructured":"Fischer, J., Gagie, T., Gawrychowski, P., Kociumaka, T.: Approximating LZ77 via small-space multiple-pattern matching. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 533\u2013544. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_45"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Fischer, J., I, T., K\u00f6ppl, D., Sadakane, K.: Lempel-ziv factorization powered by space efficient suffix trees. Algorithmica 80(7), 2048\u20132081 (2018)","DOI":"10.1007\/s00453-017-0333-1"},{"issue":"5","key":"24_CR16","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/358506.358517","volume":"25","author":"WR Franklin","year":"1982","unstructured":"Franklin, W.R.: On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM 25(5), 336\u2013337 (1982)","journal-title":"Commun. ACM"},{"issue":"1","key":"24_CR17","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Kociumaka, T.: Sparse suffix tree construction in optimal time and space. In: 28th SODA, pp. 425\u2013439. SIAM (2017)","DOI":"10.1137\/1.9781611974782.27"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Golynski, A.: Cell probe lower bounds for succinct data structures. In: 20th SODA, pp. 625\u2013634. SIAM (2009)","DOI":"10.1137\/1.9781611973068.69"},{"key":"24_CR20","unstructured":"Gu\u015bpiel, G.: An in-place, subquadratic algorithm for permutation inversion. CoRR abs\/1901.01926 (2019)"},{"issue":"11","key":"24_CR21","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"DS Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processors. Commun. ACM 23(11), 627\u2013628 (1980)","journal-title":"Commun. ACM"},{"issue":"1","key":"24_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0890-5401(90)90004-2","volume":"88","author":"A Itai","year":"1990","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Inf. Comput. 88(1), 60\u201387 (1990)","journal-title":"Inf. Comput."},{"key":"24_CR23","unstructured":"Knuth, D.E.: Mathematical analysis of algorithms. In: IFIP Congress (1), pp. 19\u201327 (1971)"},{"key":"24_CR24","unstructured":"Knuth, D.E.: The art of computer programming, Volume I: Fundamental Algorithms, 3rd edn. Addison-Wesley (1997)"},{"key":"24_CR25","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.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315\u2013323 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"24_CR26","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"JI Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theor. Comput. Sci. 165(2), 311\u2013323 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: 39th FOCS, pp. 264\u2013268. IEEE Computer Society (1998)","DOI":"10.7146\/brics.v5i10.19282"},{"issue":"4","key":"24_CR28","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"GL Peterson","year":"1982","unstructured":"Peterson, G.L.: An $${O}(n\\log n)$$ unidirectional algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4(4), 758\u2013762 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"24_CR29","first-page":"162","volume":"6","author":"V Raman","year":"1999","unstructured":"Raman, V., Ramnath, S.: Improved upper bounds for time-space trade-offs for selection. Nord. J. Comput. 6(2), 162\u2013180 (1999)","journal-title":"Nord. J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:27:44Z","timestamp":1645183664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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.1","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":"13","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)"}}]}}