{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T15:27:39Z","timestamp":1764084459981,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"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-10801-4_6","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"54-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sorting Networks on Restricted Topologies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3059-0748","authenticated-orcid":false,"given":"Indranil","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7260-4394","authenticated-orcid":false,"given":"Dana","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5013-6422","authenticated-orcid":false,"given":"Igor","family":"Shinkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An $$O(n log n)$$ sorting network. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 1\u20139. ACM (1983)","DOI":"10.1145\/800061.808726"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N Alon","year":"1994","unstructured":"Alon, N., Chung, F.R., Graham, R.L.: Routing permutations on graphs via matchings. SIAM J. Discrete Math. 7(3), 513\u2013530 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1007\/s00373-016-1700-4","volume":"32","author":"O Angel","year":"2016","unstructured":"Angel, O., Shinkar, I.: A tight upper bound on acquaintance time of graphs. Graphs Comb. 32(5), 1667\u20131673 (2016). arXiv:1307.6029","journal-title":"Graphs Comb."},{"issue":"01","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548300000031","volume":"1","author":"L Babai","year":"1992","unstructured":"Babai, L., Szegedy, M.: Local expansion of symmetrical graphs. Comb. Probab. Comput. 1(01), 1\u201311 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the 30 April\u20132 May 1968, Spring Joint Computer Conference, pp. 307\u2013314. ACM (1968)","DOI":"10.1145\/1468075.1468121"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1137\/130930078","volume":"28","author":"I Benjamini","year":"2014","unstructured":"Benjamini, I., Shinkar, I., Tsur, G.: Acquaintance time of a graph. SIAM J. Discrete Math. 28(2), 767\u2013785 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR7","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/BFb0039623","volume-title":"STACS 87","author":"M Kunde","year":"1987","unstructured":"Kunde, M.: Optimal sorting on multi-dimensionally mesh-connected computers. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 408\u2013419. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0039623"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539794268406","volume":"27","author":"T Leighton","year":"1998","unstructured":"Leighton, T., Plaxton, C.G.: Hypercubic sorting networks. SIAM J. Comput. 27(1), 1\u201347 (1998)","journal-title":"SIAM J. Comput."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/3-540-58201-0_103","volume-title":"Automata, Languages and Programming","author":"CG Plaxton","year":"1994","unstructured":"Plaxton, C.G., Suel, T.: A super-logarithmic lower bound for hypercubic sorting networks. In: Abiteboul, S., Shamir, E. (eds.) ICALP 1994. LNCS, vol. 820, pp. 618\u2013629. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58201-0_103"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh connected computers. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 255\u2013263. ACM (1986)","DOI":"10.1145\/12130.12156"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:15:46Z","timestamp":1709810146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_6","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":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","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":"92","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":"35","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":"6","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","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":"3.3","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)"}}]}}