Author:
Yamanaka Katsuhisa,Demaine Erik D.,Ito Takehiro,Kawahara Jun,Kiyomi Masashi,Okamoto Yoshio,Saitoh Toshiki,Suzuki Akira,Uchizawa Kei,Uno Takeaki
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. A taxonomy of parallel sorting;Bitton;ACM Comput. Surv.,1984
2. Tree spanners;Cai;SIAM J. Discrete Math.,1995
3. Note on the theory of permutations;Cayley;Philos. Mag.,1849
4. Deterministic sorting in nearly logarithmic time on the hypercube and related computers;Cypher;J. Comput. System Sci.,1993
5. An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs;Dragan,2011
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sorting Permutations on an n − Broom;Mathematics;2024-08-24
2. Polynomial Reduction Methods and their Impact on QAOA Circuits;2024 IEEE International Conference on Quantum Software (QSW);2024-07-07
3. Analysis of Algorithm D* on N-Broom;2023 4th IEEE Global Conference for Advancement in Technology (GCAT);2023-10-06
4. Sorting Permutations with 3-Brooms;2023 4th IEEE Global Conference for Advancement in Technology (GCAT);2023-10-06
5. Mitigating CNOT Errors via Noise-aware Token Swapping;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17