default search action
Toshiya Itoh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j35]Steven Ge
, Toshiya Itoh:
Popularity on the roommate diversity problem. Theor. Comput. Sci. 1023: 114903 (2025) - 2024
- [j34]Tsubasa Harada
Capacity-insensitive algorithms for online facility assignment problems on a line. Discret. Math. Algorithms Appl. 16(5): 2350057:1-2350057:39 (2024) - [i27]Tsubasa Harada, Toshiya Itoh:
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem. CoRR abs/2406.03778 (2024) - 2023
- [c31]Tsubasa Harada
Online Facility Assignment for General Layout of Servers on a Line. COCOA (2) 2023: 310-322 - [c30]Steven Ge
Popularity on the Roommate Diversity Problem. COCOA (1) 2023: 316-329 - [i26]Tsubasa Harada, Toshiya Itoh:
Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line. CoRR abs/2308.05933 (2023) - [i25]Steven Ge, Toshiya Itoh:
Popularity on the 3D-Euclidean Stable Roommates. CoRR abs/2311.10585 (2023) - 2022
- [c29]Suthee Ruangwises
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. FUN 2022: 24:1-24:12 - [c28]Suthee Ruangwises
Physical ZKP for Makaro Using a Standard Deck of Cards. TAMC 2022: 43-54 - [c27]Steven Ge
Characterization of the Imbalance Problem on Complete Bipartite Graphs. TAMC 2022: 55-66 - [i24]Suthee Ruangwises, Toshiya Itoh:
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. CoRR abs/2202.09788 (2022) - [i23]Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki:
Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line. CoRR abs/2207.05308 (2022) - [i22]Steven Ge, Toshiya Itoh:
Popularity on the Roommate Diversity Problem. CoRR abs/2210.07911 (2022) - 2021
- [j33]Toshiya Itoh, Shuichi Miyazaki
Competitive analysis for two variants of online metric matching problem. Discret. Math. Algorithms Appl. 13(6): 2150156:1-2150156:16 (2021) - [j32]Suthee Ruangwises
Unpopularity Factor in the Marriage and Roommates Problems. Theory Comput. Syst. 65(3): 579-592 (2021) - [j31]Suthee Ruangwises
Physical Zero-Knowledge Proof for Numberlink Puzzle and k Vertex-Disjoint Paths Problem. New Gener. Comput. 39(1): 3-17 (2021) - [j30]Suthee Ruangwises
Securely computing the n-variable equality function with 2n cards. Theor. Comput. Sci. 887: 99-110 (2021) - [j29]Suthee Ruangwises
Physical zero-knowledge proof for Ripple Effect. Theor. Comput. Sci. 895: 115-123 (2021) - [c26]Suthee Ruangwises
Physical Zero-Knowledge Proof for Numberlink. FUN 2021: 22:1-22:11 - [c25]Suthee Ruangwises
Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems. UCNC 2021: 149-163 - [c24]Suthee Ruangwises
Physical Zero-Knowledge Proof for Ripple Effect. WALCOM 2021: 296-307 - [i21]Steven Ge, Toshiya Itoh:
Characterization of the Imbalance Problem on Complete Bipartite Graphs. CoRR abs/2111.00154 (2021) - [i20]Suthee Ruangwises, Toshiya Itoh:
Physical ZKP for Makaro Using a Standard Deck of Cards. CoRR abs/2112.12042 (2021) - 2020
- [c23]Toshiya Itoh
Competitive Analysis for Two Variants of Online Metric Matching Problem. COCOA 2020: 486-498 - [c22]Suthee Ruangwises
Securely Computing the n-Variable Equality Function with 2n Cards. TAMC 2020: 25-36 - [i19]Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Numberlink. CoRR abs/2002.01143 (2020) - [i18]Toshiya Itoh, Shuichi Miyazaki, Makoto Satake:
Competitive Analysis for Two Variants of Online Metric Matching Problem. CoRR abs/2008.08415 (2020) - [i17]Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Ripple Effect. CoRR abs/2009.09983 (2020) - [i16]Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle. CoRR abs/2011.02313 (2020)
2010 – 2019
- 2019
- [j28]Toshiya Itoh, Yoshinori Takei:
On the Competitive Analysis for the Multi-Objective Time Series Search Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1150-1158 (2019) - [j27]Suthee Ruangwises
Random Popular Matchings with Incomplete Preference Lists. J. Graph Algorithms Appl. 23(5): 815-835 (2019) - [c21]Suthee Ruangwises
Unpopularity Factor in the Marriage and Roommates Problems. CSR 2019: 337-348 - [c20]Suthee Ruangwises
AND Protocols Using only Uniform Shuffles. CSR 2019: 349-358 - [c19]Suthee Ruangwises
Stable Noncrossing Matchings. IWOCA 2019: 405-416 - [i15]Suthee Ruangwises, Toshiya Itoh:
Stable Noncrossing Matchings. CoRR abs/1903.02185 (2019) - [i14]Suthee Ruangwises, Toshiya Itoh:
Securely Computing the n-Variable Equality Function with 2n Cards. CoRR abs/1911.05994 (2019) - 2018
- [j26]Toshiya Itoh, Yoshinori Takei:
On Aggregating Two Metrics with Relaxed Triangle Inequalities by the Weighted Harmonic Mean. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1404-1411 (2018) - [j25]Shun Hasegawa, Toshiya Itoh:
Optimal online algorithms for the multi-objective time series search problem. Theor. Comput. Sci. 718: 58-66 (2018) - [c18]Suthee Ruangwises
Random Popular Matchings with Incomplete Preference Lists. WALCOM 2018: 106-118 - [i13]Suthee Ruangwises, Toshiya Itoh:
Unpopularity Factor in the Marriage and Roommates Problems. CoRR abs/1803.09435 (2018) - [i12]Suthee Ruangwises, Toshiya Itoh:
AND Protocols Using Only Uniform Shuffles. CoRR abs/1810.00769 (2018) - 2017
- [i11]Toshiya Itoh, Yoshinori Takei:
Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems. CoRR abs/1712.00214 (2017) - 2016
- [c17]Shun Hasegawa, Toshiya Itoh:
Optimal Online Algorithms for the Multi-objective Time Series Search Problem. WALCOM 2016: 301-312 - [i10]Suthee Ruangwises, Toshiya Itoh:
Random Popular Matchings with Incomplete Preference Lists. CoRR abs/1609.07288 (2016) - 2015
- [j24]Toshiya Itoh, Seiji Yoshimoto:
Buffer management of multi-queue QoS switches with class segregation. Theor. Comput. Sci. 589: 24-33 (2015) - [i9]Shun Hasegawa, Toshiya Itoh:
Optimal Online Algorithms for the Multi-Objective Time Series Search Problem. CoRR abs/1506.04474 (2015) - 2013
- [i8]Toshiya Itoh, Seiji Yoshimoto:
Buffer Management of Multi-Queue QoS Switches with Class Segregation. CoRR abs/1304.3172 (2013) - 2011
- [i7]Toshiya Itoh, Seiji Yoshimoto:
Greedy Algorithms for Multi-Queue Buffer Management Policies with Class Segregation. CoRR abs/1109.6060 (2011) - 2010
- [j23]Toshiya Itoh, Yasuhiro Suzuki:
Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length. IEICE Trans. Inf. Syst. 93-D(2): 263-270 (2010) - [j22]Toshiya Itoh, Osamu Watanabe:
Weighted random popular matchings. Random Struct. Algorithms 37(4): 477-494 (2010)
2000 – 2009
- 2009
- [j21]Ryoso Hamane, Toshiya Itoh, Kouhei Tomita:
Approximation Preserving Reductions among Item Pricing Problems. IEICE Trans. Inf. Syst. 92-D(2): 149-157 (2009) - [j20]Ryoso Hamane, Toshiya Itoh, Kouhei Tomita:
Approximation Algorithms for the Highway Problem under the Coupon Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 1779-1786 (2009) - 2008
- [j19]Ryoso Hamane, Toshiya Itoh:
Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation. IEICE Trans. Inf. Syst. 91-D(2): 187-199 (2008) - [i6]Toshiya Itoh, Yasuhiro Suzuki:
New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length. CoRR abs/0810.4576 (2008) - 2007
- [j18]Noga Alon, Toshiya Itoh, Tatsuya Nagatani:
On (epsilon, k)-min-wise independent permutations. Random Struct. Algorithms 31(3): 384-389 (2007) - [i5]Toshiya Itoh, Osamu Watanabe:
Weighted Random Popular Matchings. CoRR abs/0710.5338 (2007) - [i4]Ryoso Hamane, Toshiya Itoh, Kouhei Tomita:
Approximation Algorithms for the Highway Problem under the Coupon Model. CoRR abs/0712.2629 (2007) - 2006
- [j17]Toshiya Itoh, Noriyuki Takahashi:
Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1186-1197 (2006) - [j16]Ryutaroh Matsumoto
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. IEEE Trans. Inf. Theory 52(9): 4251-4256 (2006) - [i3]Toshiya Itoh:
Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j15]Toshiya Itoh, Takanobu Nagumo:
Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1155-1165 (2005) - [i2]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-dual distance bounds of linear codes with application to cryptography. CoRR abs/cs/0506087 (2005) - [i1]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptol. ePrint Arch. 2005: 194 (2005) - 2003
- [j14]Eikoh Chida, Toshiya Itoh, Hiroki Shizuya:
A Note on the Relationships among Certified Discrete Log Cryptosystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1198-1202 (2003) - [c16]Jun Tarui, Toshiya Itoh, Yoshinori Takei:
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. RANDOM-APPROX 2003: 396-408 - [c15]Toshiya Itoh, Yoshinori Takei, Jun Tarui:
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. STOC 2003: 710-719 - 2002
- [j13]Toshiya Itoh:
Min-Wise Independence vs. 3-Wise Independence. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 957-966 (2002) - 2000
- [c14]Toshiya Itoh, Yoshinori Takei, Jun Tarui:
On permutations with limited independence. SODA 2000: 137-146
1990 – 1999
- 1999
- [j12]Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya:
Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages. J. Cryptol. 12(3): 197-223 (1999) - 1997
- [j11]Toshiya Itoh, Yuji Ohta, Hiroki Shizuya:
A Language-Dependent Cryptographic Primitive. J. Cryptol. 10(1): 37-50 (1997) - 1996
- [j10]Toshiya Itoh:
Simulating Fair Dice with Biased Coins. Inf. Comput. 126(1): 78-82 (1996) - [j9]Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii:
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. J. Cryptol. 9(2): 101-109 (1996) - [c13]Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung:
A Progress Report on Subliminal-Free Channels. Information Hiding 1996: 157-168 - 1994
- [c12]Toshiya Itoh, Yuji Ohta, Hiroki Shizuya:
Language Dependent Secure Bit Commitment. CRYPTO 1994: 188-201 - 1993
- [c11]Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii:
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. CRYPTO 1993: 61-72 - 1992
- [c10]Kouichi Sakurai, Toshiya Itoh:
Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes. AUSCRYPT 1992: 231-243 - [c9]Kouichi Sakurai, Toshiya Itoh:
On Bit Correlations Among Preimages of "Many to One" One-Way Functions. AUSCRYPT 1992: 435-446 - [c8]Kouichi Sakurai, Toshiya Itoh:
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract). CRYPTO 1992: 246-259 - [c7]Toshiya Itoh, Kenji Horikawa:
On the Complexity of Composite Numbers. ISAAC 1992: 229-238 - 1991
- [j8]Toshiya Itoh:
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. Inf. Process. Lett. 37(5): 273-277 (1991) - [j7]Shinji Shinozaki, Atsushi Fujioka
Provably Secure Key-Updating Schemes in Identity-Based Systems. J. Circuits Syst. Comput. 1(3): 257-272 (1991) - [c6]Toshiya Itoh, Kouichi Sakurai:
On the Complexity of Constant Round ZKIP of Possession of Knowledge. ASIACRYPT 1991: 331-345 - [c5]Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya:
Any Language in IP Has a Divertable ZKIP. ASIACRYPT 1991: 382-396 - [c4]Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai:
On the Complexity of Hyperelliptic Discrete Logarithm Problem. EUROCRYPT 1991: 337-351 - 1990
- [c3]Hiroki Shizuya, Kenji Koyama, Toshiya Itoh:
Demonstrating Possession without Revealing Factors and its Application. AUSCRYPT 1990: 273-293 - [c2]Shinji Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii:
Provably Secure Key-Updating Schemes in Identity-Based Systems. EUROCRYPT 1990: 16-30 - [c1]Toshiya Itoh:
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. SIGAL International Symposium on Algorithms 1990: 181-190
1980 – 1989
- 1989
- [j6]Toshiya Itoh, Shigeo Tsujii:
Structure of Parallel Multipliers for a Class of Fields GF(2^m). Inf. Comput. 83(1): 21-40 (1989) - [j5]Toshiya Itoh, Shigeo Tsujii:
An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m). Inf. Process. Lett. 30(3): 111-114 (1989) - [j4]Shigeo Tsujii, Toshiya Itoh:
An ID-based cryptosystem based on the discrete logarithm problem. IEEE J. Sel. Areas Commun. 7(4): 467-473 (1989) - 1988
- [j3]Kaoru Kurosawa, Toshiya Itoh, Masashi Takeuchi:
Public Key Cryptosystem using a reciprocal number with the same Intractability as Factoring a Large number. Cryptologia 12(4): 225-233 (1988) - [j2]Toshiya Itoh, Shigeo Tsujii:
A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases. Inf. Comput. 78(3): 171-177 (1988) - [j1]Shigeo Tsujii, Toshiya Itoh, Atsushi Fujioka
A public-key cryptosystem based on the difficulty of solving a system of nonlinear equations. Syst. Comput. Jpn. 19(2): 10-18 (1988)
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 2024-11-07 20:34 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: