Almost optimal permutation routing on hypercubes
From MaRDI portal
Publication:5176011
DOI10.1145/380752.380848zbMath1323.68019OpenAlexW2024158969MaRDI QIDQ5176011
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380848
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Cites Work