Abstract
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On ann×narray, one algorithm runs in the optimal 2·n−2 steps, with maximum queue length 32. Another algorithm runs in near-optimal time, 2·n+O(1) steps, with a maximum queue length of only 12.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
