論文

• Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki. Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line, Discrete Mathematics, Algorithms and Applications, World Scientific, Vol. 16, No. 5, pp. 2350057-1-2350057-39, July 2024.
• Toshiya Itoh, Shuich Miyazaki, Makoto Satake. Competitive analysis for two variants of online metric matching problem, Discrete Mathematics, Algorithms, and Applications, Vol. 13, No. 6, pp. 2150156-1-2150156-16, Dec. 2021.
• Suthee Ruangwises, Toshiya Itoh. Physical zero-knowledge proof for Ripple Effect, Theoretical Computer Science, Elsevior, Vol. 895, pp. 115-123, Dec. 2021.
• Suthee Ruangwises, Toshiya Itoh. Unpopularity Factor in the Marriage and Roommates Problems, Theory of Computing Systtems, Vol. 65, Issue 3, pp. 579-592, May 2021.
• Suthee Ruangwises, Toshiya Itoh. Physical Zero-Knowledge Proof for Numberlink Puzzle and k Vertex-Disjoint Paths Problem, New Generation Computing, Springer, Vol. 39, Issue 1, pp. 3-17, Apr. 2021.
• Suthee Ruangwises, Toshiya Itoh. Securely Computing the n-Variable Equality Function with 2n Cards, Theoretical Computer Science, Elsevior, Volume 887, No. 2, pp. 99-110, 2021.
• Suthee Ruangwises, Toshiya Itoh. Random Popular Matchings with Incomplete Preference Lists, Journal of Graph Algorithms and Applications, Vol. 23, no. 5, pp. 815-835, Oct. 2019.
• Toshiya Itoh, Yoshinori Takei. On the Competitive Analysis for the Multi-Objective Time Series Search Problem, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E102-A, No. 9, pp. 1150-1158, Sept. 2019.
• Toshiya Itoh, Yoshinori Takei. On Aggregating Two Metrics with Relaxed Triangle Inequalities by the Weighted Harmonic Mean, IEICE transactions on fundamentals of electronics, communications and computer sciences., Vol. E101-A, No. 9, pp. 1404-1411, Sept. 2018.
• Shun Hasegawa, Toshiya Itoh. Optimal Online Algorithms for the Multi-Objective Time Series Search Problem, Theoretical Computer Science, Elsevior, Volume 718, Number C, pp. 58-66, 2018.
• Toshiya Itoh, Seiji Yoshimoto. Buffer Management of Multi-Queue QoS Switches with Class Segregation, Theoretical Computer Science, Elsevier, Vol. 389, pp. 24-33, July 2015.
• Toshiya Itoh, Osamu Watanabe. Weighted Random Popular Matchings, Random Structures and Algorithms, Wiley, Vol. 37, No. 4, pp. 477-494, Dec. 2010.
• Toshiya Itoh, Yasuhiro Suzuki. Improved Constructions for Query-Efficient Locally Decdable Codes of Subexponential Length, IEICE Trans. on Information and Systems, IEICE, Vol. E93-D, No. 2, pp. 263-270, Feb. 2010.
• 飯田勝吉, 新里卓史, 伊東利哉, 渡辺治. キャンパス共通認証認可システムの構築と運用, 電子情報通信学会, Vol. J92-B, No. 10, pp. 1554-1565, Oct. 2009.
• Ryoso Hamane, Toshiya Itoh, Kouhei Tomita. Approximation Algorithms for the Highway Problem under the Coupon Model, IEICE Trans. on Fundamentals, IEICE, Vol. E92-A, No. 8, pp. 1779-1786, Aug. 2009.
• Ryoso Hamane, Toshiya Itoh, Kouhei Tomita. Approximation Preserving Reductions among Item Pricing Problems, IEIC Transactions on Information and Systems, IEICE, Vol. E92.D, No. 2, pp. 149-157, Feb. 2009.
• Toshiya Itoh, Ryoso Hamane. Improved Approximation Allgorithms for Item Pricing with Bounded Degree and Valuation, IEICE Trans. on Information and Systems, Vol. 91-D, No. 2, pp. 187-199, Feb. 2008.
• Noga Alon, Toshiya Itoh, Tatsuya Nagatani. On $(\epsilon,k)$-Min-Wise Independent Permutations, Random Structures and Algorithms, Wiley, Vol. 31, No. 3, pp. 384-389, Oct. 2007.
• Toshiya Itoh, Osamu Watanabe. Weighted Random Popular Matchingｓ, Research Repoorts on Mathematical and Computing Sciences, Tokyo Institute of Technology, Vol. ISSN 1342-2812, May 2007.
• Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Kohno, Tomohiko Uematsu. Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography, IEEE Transactions on Information Theory, Vol. 52, No. 9, pp. 4251-4256, Sept. 2006.
• Toshiya Itoh, Noriyuki Takahashi. Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities, Transactions of the IEICE, Vol. E89-A, No. 5, pp. 1186-1197, May 2006.
• Toshiya Itoh. Improved Lower Bounds for Families oif ε-Approximate k-Restricted Min-wise Independent Permutations, ECCC, Vol. TR-06, No. 017, Feb. 2006.
• Toshiya Itoh, Takanobu Nagumo. Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks,, Transactions of the IEICE, Vol. E88-A, No. 5, pp. 1155-1165, May 2005.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. Constructing Families of ε-Approximate k-Wise Independent Permutations, Transactions of the IEICE, Vol. E87-A, No. 5, pp. 993-1003, 2004.
• Eikou Chida, Toshiya Itoh, Hiroki Shizuya. Note on the Relationships among Certified Discrete Log Cryptosystems, Transactions of the IEICE, Vol. E86-A, No. 5, pp. 1198-1202, 2003.
• Toshiya Itoh. Min-Wise Independence vs. 3-Wise Independence, Transactions of the IEICE, Vol. E85-A, No. 5, pp. 957-966, 2002.
• Ryo Hirade, Toshiya Itoh. Improved Approximation Lower Bounds for TSP with Distances One and Two, Interdisciplinary Information Sciences, Vol. 8, No. 1, pp. 63-76, 2002.
• Toshiya Itoh. Online Algorithms for Convex Case Capital Investment, Interdisciplinary Information Sciences, Vol. 8, No. 1, pp. 77-88, 2002.
• Toshiya Itoh. On Lower Bounds for the Communication Complexity of Private Information Retrieval, Transactions of the IEICE, Vol. E854A, No. 1, pp. 157-164, Jan. 2001.
• Toshiya Itoh. Approximating the Maximum Weight of Linear Codes is APX-complete, the Transactions of IEICE, Vol. E83-A, No. 4, pp. 606-613, 2000.
• Yoshinori Takei, Toshiya Itoh, Takahiro Shinozaki. Constructing an Optimal Family of Min-Wise Independent Permutation, Transactions of the IEICE, Vol. E83-A, No. 4, pp. 747-755, 2000.
• Yoshinori Takei, Toshiya Itoh. A General Construction of Min-Wise Independent Permutations, Transactions of the IEICE, Vol. E83-A, No. 4, pp. 646-655, 2000.
• Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya. Divertible and Subliminal-Free Zero-Knowledge Proofs of Languages, Journal of Cryptology, Vol. 12, No. 3, pp. 197-223, 1999.
• Toshiya Itoh. Efficient Private Information Retrieval, Transactions of the IEICE, Vol. E82-A, No. 1, pp. 11-20, 1999.
• Hiroyoshi Mori, Toshiya Itoh. On the Power of Self-Testers and Self-Correctors, Transactions of the IEICE, Vol. E80-A, No. 1, pp. 98-106, 1997.
• Toshiya Itoh. On the Oracle Entropy and the Average Case Oracle Measure of Knowledge Complexity, Transactions of the IEICE, Vol. E80-A, No. 1, pp. 90-97, 1997.
• Toshiya Itoh, Yuji Ohta, Hiroki Shizuya. A Language Dependent Cryptographic Primitive, Journal of Cryptology, Vol. 10, No. 1, pp. 37-50, 1997.
• Toshiya Itoh. Simulating Fair Dice with Biased Coins, Information and Computation, Vol. 126, No. 1, pp. 78-82, 1996.
• Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii. A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity, Journal of Cryptology, Vol. 9, No. 2, pp. 101-109, 1996.
• Toshiya Itoh, Masahiro Takei. Checkers for Adaptive Programs, Transactions of the IEICE, Vol. E78-A, No. 1, pp. 42-50, 1995.
• Toshiya Itoh, Kei Hayashi. Alternative Necessary and Sufficient Conditions for Collision Intractable Hashing, Transactions of the IEICE, Vol. E78-A, No. 1, pp. 19-26, 1995.
• Toshiya Itoh, Tatsuhiko Kakimoto. On the Knowledge Complexity of Arthur-Merlin Games, Transactions of the IEICE, Vol. E77-A, No. 1, pp. 56-64, 1994.

著書

• Tsubasa Harada, Toshiya Itoh, Shigeo Matsubara, Shuichi Miyazaki, Makoto Yokoo. Advanced Mathematical Science for Mobility Society, Springer, Mar. 2024.
• 佐藤泰介, 高橋篤司, 伊東利哉, 上野修一. 情報基礎数学, オーム社, Sept. 2014.
• 荒木純道, 伊東利哉. 通信伝送工学, 培風館, July 2010.
• 佐藤泰介, 高橋篤司, 伊東利哉, 上野修一. 情報基礎数学, 昭晃堂, Oct. 2007.

国際会議発表 (査読有り)

• Steven Ge, Toshiya Itoh. Popularity on the Roommate Diversity Problem, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Springer, Vol. 14461, No. 1, pp. 316-329, Dec. 2023.
• Tsubasa Harada, Toshiya Itoh. Online Facility Assignment for General Layout of Servers on a Line, Combinatorial Optimization and Applications, Lectute Notes in Computer Science, Springer, Vol. 14462, No. 2, pp. 310-322, Dec. 2023.
• Steven Ge, Toshiya Itoh. Characterization of the Imbalance Problem on Complete Bipartite Graphs, Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer, Vol. 13571, pp. 55-66, Jan. 2023.
• Suthee Ruangwises, Toshiya Itoh. Physical ZKP for Makaro Using a Standard Deck of Cards, Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Vol. 13571, pp. 43-54, Sept. 2022.
• Suthee Ruangwises, Toshiya Itoh. How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku, FUN with Algorithms, LIPIcs, Dagstuhl Publishing, Vol. 226, pp. 24:11-24:12, May 2022.
• Suthee Ruangwises, Toshiya Itoh. Physical Zero-Knowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle, International Conference on Unconventional Computation and Natural Computation, Lecture Notes in Computer Science, Vol. 12984, pp. 149-163, Oct. 2021.
• Suthee Ruangwises, Toshiya Itoh. Physical Zero-Knowledge Proof for Ripple Effect, International Conference and Workshops on Algorithms and Computation, Lecture Notes in Computer Science, Springer, Vol. 12635, pp. 296-307, Feb. 2021.
• Suthee Ruangwises, Toshiya Itoh. arXiv:1911.05994,  Securely Computing the n-Variable Equality Function with 2n Cards, Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Vol. 12337, pp. 25-36, Oct. 2020.
• Suthee Ruangwises, Toshiya Itoh. Physical Zero-Knowledge Proof for Numberlink, 10th International Conference on Fun with Algorithms, LIPIcs, Vol. 157, pp. 22:1-22:11, Sept. 2020.
• Suthee Ruangwises, Toshiya Itoh. Stable Noncrossing Matchings, International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science, Springer, Vol. 11638, pp. 405-416, July 2019.
• Suthee Ruangwises, Toshiya Itoh. Unpopularity Factor in the Marriage and Roommates Problems, International Computer Science Symposium in Russia, Lecture Notes in Computer Science, Vol. 11532, pp. 337-348, May 2019.
• Suthee Ruangwises, Toshiya Itoh. AND Protocols Using only Uniform Shuffles, International Computer Science Symposium in Russia, Lecture Notes in Computer Science, Vol. 11532, pp. 349-358, May 2019.
• Suthee RUANGWISES, Toshiya Itoh. Random Popular Matchings with Incomplete Preference Lists, International Workshop on Algorithms and Computation, Lecture notes in computer science, LNCS, Springer, No. 10755, pp. 106-118, Jan. 2018.
• Shun Hasegawa, Toshiya Itoh. Optimal Online Algorithms for the Multi-Objective Time Series Search Problem, WALCOM: Algorithms and Computation, Lecture Notes in Computer Science, Springer, Vol. 9627, pp. 301-312, Mar. 2016.

国際会議発表 (査読なし・不明)

• Toshiya Itoh, Shuichi Miyazami, Makoto Satake. Competitive Analysis for Two Variants of Online Metric Matching Problem, International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol. 12577, pp. 468-498, Dec. 2020.
• Toshiya Itoh, Tatsuya Nagatani, Jun Tarui. Explicit Construction for k-Wise Nearly Random Permutations by Iterated Feistel Transform, Randomness and Computation, No. 1, July 2005.
• Jun Tarui, Toshiya Itoh, Yoshinori Takei. A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries, RANDOM-APPROX, Lecture Notes in Computer Science, Vol. 2764, pp. 396-408, 2003.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. On the Sample Size of k-Restricted Min-Wise Independent Permutations and Other k-Wise Distributions, Sympojium on Theory of Computing, the 35th ACM Annual Symposium on Theory of Computing, pp. 710-719, 2003.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. On Permutations with Limited Independence, the 11th ACM-SIAM Annual Symposium on Discrete Algorithms, pp. 137-146, 2000.

国内会議発表 (査読なし・不明)

• Toshiya Itoh, Yoshinori Takei. Semimetrics Preservation by Harmonic Mean and an Application to the Robust Jaccard-Tanimoto Dissimilarity, 夏のLAシンポジウム, July 2016.
• Shun Hasegawa, Toshiya Itoh. Best Possible Online Algorithms for the Multi-Objective Time Series Search Problem, 夏のLAシンポジウム, July 2016.
• 友石正彦, 吉田真一, 伊東利哉. 無線LAN におけるセキュリティ技術の動向, SITE2004-1, 電子情報通信学会技術研究報告[技術と社会・倫理], Vol. 104, No. 96, pp. 1--6, June 2008.
• 伊東利哉, 渡辺治. 重みつき乱択最適選好マッチング, コンプ研,電子情報通信学会, 信学技報 COMP, Oct. 2007.
• Toshiya Itoh, Osamu Watanabe. Weighted Random Popular Matchings, 電子情報通信学会 技術研究報告, IEICE, Vol. COMP2007, No. 23, pp. 41-48, June 2007.
• Ryouso Hamane, Toshiya Itoh. Improved Approximation Algorithms for Item Pricing with Bounded Degree and valuation, 電子情報通信学会 技術研究報告, IEICE, Vol. COMP2007, No. 1, pp. 1-8, Apr. 2007.
• 新里卓史, 飯田勝吉, 岸本幸一, 太刀川博之, 昆野長典, 山崎浩治, 伊東利哉, 渡辺治. 大学内の業務・システムと連携するキャンパス共通認証認可システムの構築と運用, 電子情報通信学会技術研究報告, 電子情報通信学会, Vol. 106, No. 577, pp. 201-206, Mar. 2007.
• Toshiya Itoh, Tatsuya Nagatani. Improved Lower Bounds for Families oif ε-Approximate k-Restricted Min-wise Independent Permutations, 電子情報通信学会技術研究報告, IEICE, Vol. COMP2005, No. 66, pp. 23--30, Mar. 2006.
• Toshiya Itoh, Takanobu Nagumo. Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks, Technical Report of IEICE, Vol. COMP2003, No. 89, 2004.
• Toshiya Itoh, Tatsuya Nagatani, Jun Tarui. Explicit Construction of k-Wise Nearly Random Permutations by Iterated Feistel Transform, Technical Report of IEICE, Vol. COMP2004, No. 7, 2004.
• Kouhei Maruchi, Toshiya Itoh. On the Competitive Analysis of Stream Merging Algorithms for Video-on-Demand, Technical Report of IEICE, Vol. COMP2003, No. 90, 2004.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. Recent Progress on Min-Wise Independent Permutations, 電子情報通信学会技術研究報告, Vol. COMP2003, No. 49, pp. 41-50, Oct. 2003.
• 本橋賢二, 角田貢, 山岡克式, 伊東利哉, 曽根原登. 零知識証明を用いた分散個人認証システム, 電子情報通信学会ソサイエティ大会, Vol. B, No. 7, pp. 48, 2003.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. Recent Progress on Min-Wise Independent Permutations, Technical Report of IEICE, Vol. COMP2003, No. 49, 2003.
• 本橋賢二, 角田貢, 山岡克式, 伊東利哉, 曽根原登. ゼロ知識証明を用いた分散個人認証システムの設計, コンピュータセキュリティシンポジウム, Vol. 1A, No. 3, 2003.
• Toshiya Itoh, Yoshinori Takei. Constructing Families of ε-Approximate k-Wise Independent Permutations, Technical Report of IEICE, Vol. COMP2003, No. 3, 2003.
• Jun Tarui, Toshiya Itoh, Yoshinori Takei. A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries, Technical Report of IEICE, Vol. COMP2003, No. 21, 2003.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. On the Sample Size of k-Min-Wise Independent Permutations and Other k-Wise Distributions, Technical Report of IEICE, Vol. COMP2002, No. 33, pp. 25-32, 2002.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. On the Sample Size of k-Min-Wise Independent Permutations and Other k-Wise Distributions, Technical Report of IEICE, Vol. COMP2002, No. 33, 2002.
• 篠崎 隆宏, 武井 由智, 伊東 利哉. k-制限最小値独立置換族のサイズ均等性, 平成12年度信越支部大会, Oct. 2000.
• Toshiya Itoh. Lower Bounds for Communication Complexity of Private Information Retrieval, IEICE Technical Report, Vol. COMP2000, No. 9, pp. 25-32, 2000.
• Toshiya Itoh. Min-Wise Independence vs. 3-Wise Independence, IEICE Technical Report, Vol. COMP2000, No. 48, pp. 49-56, 2000.
• Ryo Hirade, Toshiya Itoh. New Approximation Lower Bounds for TSP with Distances One and Two, IEICE Technical Report, Vol. COMP99, No. 84, pp. 41-48, 2000.
• Toshiya Itoh, Shuji Kawakami. Online Algorithms for Convex Case Capital Investment, IEICE Technical Report, Vol. COMP99, No. 83, pp. 33-40, 2000.
• Takahiro Shinozaki, Toshiya Itoh. A Polynomial Time Sampling Algorithm for an Optimal Family of Min-Wise Independent Permutations, LA Symposium, No. 15, 1999.
• 伊東利哉. データベース検索における暗号－プライバシーを保護する検索アルゴリズム－, 日本応用数理学会, Vol. A3, No. 2, pp. 200-201, 1999.
• Toshiya Itoh, Yoshinori Takei, Jun Tarui. On Permutations with Limited Independence, IEICE Technical Report, Vol. COMP99-27, pp. 39-46, 1999.
• Toshiya Itoh. Approximating the Maximum Weight of Linear Codes is APX-complete, IEICE Technical Report, Vol. IT99-10, pp. 1-8, 1999.
• 黒澤馨, 尾形わかは, 伊東利哉, 辻井重男. 4-move zero-knowledge interactive proof systems, 電子情報通信学会技術研究報告, Vol. ISEC90-39, 1990.

その他の論文・著書など

• Tsubasa Harada, Toshiya Itoh. arXiv: 2308.05933v1,  Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line, Aug. 2023.
• Suthee Ruangwises, Toshiya Itoh. Physical ZKP for Makaro Using a Standard Deck of Cards, Dec. 2021.
• Suthee Ruangwises, Toshiya Itoh. 1903.02185v1,  Stable Noncrossing Matchings, ArXiv, Mar. 2019.
• Suthee Ruangwises, Toshiya Itoh. COMP2018-36,  Unpopularity Factor in the Marriage and Roommates Problems, コンピュテーション研究会, 電子情報通信学会技術研究報告, Dec. 2018.
• Suthee Ruangwises, Toshiya Itoh. arXiv:1810.00769,  AND Protocols Using Only Uniform Shuffles, Oct. 2018.
• Toshiya Itoh, Yoshinori Takei. arXiv:1712.0021v2,  On the Hardness of Deriving the Arithmetic Mean Component Competitive Ratio, Apr. 2018.
• Suthee Ruangwises, Toshiya Itoh. arXiv:1803.09435,  Unpopularity Factor in the Marriage and Roommates Problems, Mar. 2018.
• Toshiya Itoh, Yoshinori Takei. arXiv:1712.000214v1 [cs.DS],  Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems, Dec. 2017.
• Suthee Ruangwises, Toshiya Itoh. COMP2016-23 (2016-10),  Random Popular Matchings with Incomplete Preference Lists, The Institute of Electronics, Information, and Communication Engineers, Oct. 2016.
• Suthee Ruangwises, Toshiya Itoh. Random Popular Matchings with Incomplete Preference Lists, Sept. 2016.
• Shun Hasegawa, Toshiya Itoh. arXiv:1506.04474v1 [cs.DS],  Optimal Online Algorithms for the Multi-Objective Time Series Search Problem, June 2015.
• Toshiya Itoh, Seiji Yoshimoto. arXiv:1304.3172v1 [cs.DS],  Buffer Management of Multi-Queue QoS Switches with Class Segregation, Apr. 2013.
• Toshiya Itoh, Seiji Yoshimoto. arXiv:1109.6060v1,  Greedy Algorithms for Multi-Queue Buffer Management Policies with Class Segregation, Sept. 2011.
• Ryoso Hamane, Toshiya Itoh, Kouhei Tomita. Approximation Algorithms for the Highway Problem under the Coupon Model, arXiv, No. 0712.2629v1, Dec. 2007.
• Toshiya Itoh. Weighted Random Popolar Matchings, arXiv, No. 0710.5338v1, Oct. 2007.
• Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh. Primal-dual distance bounds of linear codes with application to cryptography, International Association for Cryptographic Research, No. 194, June 2005.

学位論文

• Algorithms for Finite Field Arithmetics and Their Applications to Public-key Cryptosystems,  Thesis,  Doctor of Engineering,  東京工業大学,  1988/12/31,   

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]