default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyuhei Mori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Tatsuya Terao, Ryuhei Mori
:
Parameterized Quantum Query Algorithms for Graph Problems. ESA 2024: 99:1-99:16- [i32]Tatsuya Terao, Ryuhei Mori:
Parameterized Quantum Query Algorithms for Graph Problems. CoRR abs/2408.03864 (2024) - 2023
- [j9]Masaya Norimoto, Ryuhei Mori, Naoki Ishikawa:
Quantum Algorithm for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection. IEEE Trans. Commun. 71(4): 1926-1939 (2023) - 2022
- [j8]Kazuya Shimizu, Ryuhei Mori:
Exponential-Time Quantum Algorithms for Graph Coloring Problems. Algorithmica 84(12): 3603-3621 (2022) - 2021
- [c17]Yasuhiro Kondo, Ryuhei Mori, Ramis Movassagh:
Quantum supremacy and hardness of estimating output probabilities of quantum circuits. FOCS 2021: 1296-1307 - [c16]Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs:
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. MFCS 2021: 50:1-50:23 - [c15]Alin Bostan, Ryuhei Mori:
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. SOSA 2021: 118-132 - [i31]Adam Glos, Ryuhei Mori, Jevgenijs Vihrovs:
Quantum speedups for dynamic programming on n-dimensional lattice graphs. CoRR abs/2104.14384 (2021) - [i30]Ryo Ito, Ryuhei Mori:
Lower bounds on the error probability of multiple quantum channel discrimination by the Bures angle and the trace distance. CoRR abs/2107.03948 (2021) - 2020
- [c14]Kazuya Shimizu, Ryuhei Mori:
Exponential-Time Quantum Algorithms for Graph Coloring Problems. LATIN 2020: 387-398 - [i29]Alin Bostan, Ryuhei Mori:
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. CoRR abs/2008.08822 (2020)
2010 – 2019
- 2019
- [j7]Ryuhei Mori:
Periodic Fourier representation of Boolean functions. Quantum Inf. Comput. 19(5&6): 392-412 (2019) - [i28]Kazuya Shimizu, Ryuhei Mori:
Exponential-time quantum algorithms for graph coloring problems. CoRR abs/1907.00529 (2019) - 2018
- [i27]Ryuhei Mori:
Periodic Fourier representation of boolean functions. CoRR abs/1803.09947 (2018) - 2017
- [j6]Ryuhei Mori:
Better protocol for XOR game using communication protocol and nonlocal boxes. Quantum Inf. Comput. 17(15&16): 1261-1276 (2017) - [c13]Pravesh K. Kothari, Ryuhei Mori, Ryan O'Donnell, David Witmer:
Sum of squares lower bounds for refuting any CSP. STOC 2017: 132-145 - [i26]Ryuhei Mori:
Better Protocol for XOR Game using Communication Protocol. CoRR abs/1701.04327 (2017) - [i25]Pravesh K. Kothari, Ryuhei Mori, Ryan O'Donnell, David Witmer:
Sum of squares lower bounds for refuting any CSP. CoRR abs/1701.04521 (2017) - 2016
- [c12]Ryuhei Mori, David Witmer:
Lower Bounds for CSP Refutation by SDP Hierarchies. APPROX-RANDOM 2016: 41:1-41:30 - [c11]Nobutaka Shimizu, Ryuhei Mori:
Average shortest path length of graphs of diameter 3. NOCS 2016: 1-6 - [i24]Ryuhei Mori:
Three-input Majority Function is the Unique Optimal for the Bias Amplification using Nonlocal Boxes. CoRR abs/1604.05663 (2016) - [i23]Nobutaka Shimizu, Ryuhei Mori:
Average Shortest Path Length of Graphs of Diameter 3. CoRR abs/1606.05119 (2016) - [i22]Ryuhei Mori, David Witmer:
Lower bounds for CSP refutation by SDP hierarchies. CoRR abs/1610.03029 (2016) - 2015
- [j5]Ryuhei Mori:
Loop Calculus For Nonbinary Alphabets Using Concepts From Information Geometry. IEEE Trans. Inf. Theory 61(4): 1887-1904 (2015) - [c10]Ryuhei Mori:
Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories. ISIT 2015: 1099-1103 - [i21]Ryuhei Mori:
Holographic Transformation, Belief Propagation and Loop Calculus for Quantum Information Science. CoRR abs/1501.04183 (2015) - [i20]Ryuhei Mori, Osamu Watanabe:
Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges. CoRR abs/1506.00718 (2015) - 2014
- [j4]Ryuhei Mori, Toshiyuki Tanaka:
Source and Channel Polarization Over Finite Fields and Reed-Solomon Matrices. IEEE Trans. Inf. Theory 60(5): 2720-2736 (2014) - [i19]Ryuhei Mori:
Holographic Transformation for Quantum Factor Graphs. CoRR abs/1401.6500 (2014) - [i18]Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe, Masaki Yamamoto:
Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets. CoRR abs/1406.0373 (2014) - 2013
- [j3]Ryuhei Mori, Toshiyuki Tanaka, Kenta Kasai, Kohichi Sakaniwa:
Effects of Single-Cycle Structure on Iterative Decoding of Low-Density Parity-Check Codes. IEEE Trans. Inf. Theory 59(1): 238-253 (2013) - [j2]Seyed Hamed Hassani, Ryuhei Mori, Toshiyuki Tanaka, Rüdiger L. Urbanke:
Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization. IEEE Trans. Inf. Theory 59(4): 2267-2276 (2013) - [i17]Ryuhei Mori:
New Understanding of the Bethe Approximation and the Replica Method. CoRR abs/1303.2168 (2013) - [i16]Ryuhei Mori:
Loop Calculus for Non-Binary Alphabets using Concepts of Information Geometry. CoRR abs/1309.6550 (2013) - 2012
- [c9]Ryuhei Mori, Toshiyuki Tanaka:
Central approximation in statistical physics and information theory. ISIT 2012: 1652-1656 - [i15]Ryuhei Mori, Toshiyuki Tanaka:
Central Approximation in Statistical Physics and Information Theory. CoRR abs/1202.0655 (2012) - [i14]Ryuhei Mori, Toshiyuki Tanaka:
New Generalizations of the Bethe Approximation via Asymptotic Expansion. CoRR abs/1210.2592 (2012) - [i13]Ryuhei Mori, Toshiyuki Tanaka:
Source and Channel Polarization over Finite Fields and Reed-Solomon Matrix. CoRR abs/1211.5264 (2012) - 2011
- [c8]Seyed Hamed Hassani, Nicolas Macris, Ryuhei Mori:
Near concavity of the growth rate for coupled LDPC chains. ISIT 2011: 356-360 - [c7]Ryuhei Mori:
Connection between annealed free energy and belief propagation on random factor graph ensembles. ISIT 2011: 2010-2014 - [i12]Ryuhei Mori:
Connection between Annealed Free Energy and Belief Propagation on Random Factor Graph Ensembles. CoRR abs/1102.3132 (2011) - [i11]Seyed Hamed Hassani, Nicolas Macris, Ryuhei Mori:
Near concavity of the growth rate for coupled LDPC chains. CoRR abs/1104.0599 (2011) - [i10]Seyed Hamed Hassani, Ryuhei Mori, Toshiyuki Tanaka, Rüdiger L. Urbanke:
Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization. CoRR abs/1110.0194 (2011) - [i9]Ryuhei Mori, Toshiyuki Tanaka:
Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel. CoRR abs/1110.1930 (2011) - 2010
- [c6]Toshiyuki Tanaka, Ryuhei Mori:
Refined rate of channel polarization. ISIT 2010: 889-893 - [c5]Ryuhei Mori, Toshiyuki Tanaka:
Channel polarization on q-ary discrete memoryless channels by arbitrary kernels. ISIT 2010: 894-898 - [c4]Ryuhei Mori, Toshiyuki Tanaka:
Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes. ITW 2010: 1-5 - [i8]Toshiyuki Tanaka, Ryuhei Mori:
Refined rate of channel polarization. CoRR abs/1001.2067 (2010) - [i7]Ryuhei Mori, Toshiyuki Tanaka:
Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels. CoRR abs/1001.2662 (2010) - [i6]Ryuhei Mori:
Properties and Construction of Polar Codes. CoRR abs/1002.3521 (2010) - [i5]Ryuhei Mori, Toshiyuki Tanaka:
Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes. CoRR abs/1007.3661 (2010) - [i4]Ryuhei Mori, Toshiyuki Tanaka, Kenta Kasai, Kohichi Sakaniwa:
Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes. CoRR abs/1010.0333 (2010)
2000 – 2009
- 2009
- [j1]Ryuhei Mori, Toshiyuki Tanaka:
Performance of polar codes with the construction using density evolution. IEEE Commun. Lett. 13(7): 519-521 (2009) - [c3]Ryuhei Mori, Toshiyuki Tanaka:
Performance and construction of polar codes on symmetric binary-input memoryless channels. ISIT 2009: 1496-1500 - [c2]Kenta Kasai, Ryuhei Mori, Toshiyuki Tanaka, Kohichi Sakaniwa:
Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations. ISIT 2009: 2497-2501 - [i3]Ryuhei Mori, Toshiyuki Tanaka, Kenta Kasai, Kohichi Sakaniwa:
Finite-Length Analysis of Irregular Expurgated LDPC Codes under Finite Number of Iterations. CoRR abs/0901.2204 (2009) - [i2]Ryuhei Mori, Toshiyuki Tanaka:
Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels. CoRR abs/0901.2207 (2009) - 2008
- [c1]Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations. ISIT 2008: 449-453 - [i1]Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa:
The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number. CoRR abs/0801.0931 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
