| Performance of polar codes with the construction using density evolution R Mori, T Tanaka IEEE Communications Letters 13 (7), 519-521, 2009 | 550 | 2009 |
| Performance and construction of polar codes on symmetric binary-input memoryless channels R Mori, T Tanaka 2009 IEEE International symposium on information theory, 1496-1500, 2009 | 333 | 2009 |
| Sum of squares lower bounds for refuting any CSP PK Kothari, R Mori, R O'Donnell, D Witmer Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 122 | 2017 |
| Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes R Mori, T Tanaka 2010 IEEE Information Theory Workshop, 1-5, 2010 | 121 | 2010 |
| Channel polarization on q-ary discrete memoryless channels by arbitrary kernels R Mori, T Tanaka 2010 IEEE International Symposium on Information Theory, 894-898, 2010 | 108 | 2010 |
| Source and channel polarization over finite fields and Reed–Solomon matrices R Mori, T Tanaka IEEE Transactions on Information Theory 60 (5), 2720-2736, 2014 | 99 | 2014 |
| Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization SH Hassani, R Mori, T Tanaka, R Urbanke Arxiv preprint arXiv:1110.0194, 2011 | 73 | 2011 |
| Quantum supremacy and hardness of estimating output probabilities of quantum circuits Y Kondo, R Mori, R Movassagh 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 60* | 2022 |
| Refined rate of channel polarization T Tanaka, R Mori arXiv preprint arXiv:1001.2067, 2010 | 32 | 2010 |
| Exponential-time quantum algorithms for graph coloring problems K Shimizu, R Mori Algorithmica 84 (12), 3603-3621, 2022 | 26 | 2022 |
| Properties and construction of polar codes R Mori arXiv preprint arXiv:1002.3521, 2010 | 22 | 2010 |
| Quantum algorithm for higher-order unconstrained binary optimization and MIMO maximum likelihood detection M Norimoto, R Mori, N Ishikawa IEEE Transactions on Communications 71 (4), 1926-1939, 2023 | 19* | 2023 |
| A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence A Bostan, R Mori Symposium on Simplicity in Algorithms (SOSA), 118-132, 2021 | 15 | 2021 |
| Loop calculus for nonbinary alphabets using concepts from information geometry R Mori IEEE Transactions on Information Theory 61 (4), 1887-1904, 2015 | 15 | 2015 |
| Average shortest path length of graphs of diameter 3 N Shimizu, R Mori 2016 Tenth IEEE/ACM International Symposium on Networks-on-Chip (NOCS), 1-6, 2016 | 13 | 2016 |
| New understanding of the Bethe approximation and the replica method R Mori arXiv preprint arXiv:1303.2168, 2013 | 11 | 2013 |
| Connection between annealed free energy and belief propagation on random factor graph ensembles R Mori 2011 IEEE International Symposium on Information Theory Proceedings, 2010-2014, 2011 | 11 | 2011 |
| Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories R Mori 2015 IEEE International Symposium on Information Theory (ISIT), 1099-1103, 2015 | 10* | 2015 |
| Three-input majority function as the unique optimal function for the bias amplification using nonlocal boxes R Mori Physical Review A 94 (5), 052130, 2016 | 8 | 2016 |
| Lower bounds for CSP refutation by SDP hierarchies R Mori, D Witmer arXiv preprint arXiv:1610.03029, 2016 | 8 | 2016 |
Toshiyuki TanakaGraduate School of Informatics, Kyoto UniversityVerified email at i.kyoto-u.ac.jp
