# Toshiya Itoh

Orcid: 0000-0002-1149-7046
According to our database

Collaborative distances:

^{1}, Toshiya Itoh authored at least 66 papers between 1988 and 2025.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2025

Theor. Comput. Sci., 2025

2024

Capacity-insensitive algorithms for online facility assignment problems on a line.

Discret. Math. Algorithms Appl., July, 2024

CoRR, 2024

2023

CoRR, 2023

Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line.

CoRR, 2023

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Proceedings of the Theory and Applications of Models of Computation, 2022

Proceedings of the Theory and Applications of Models of Computation, 2022

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Theor. Comput. Sci., 2021

Theor. Comput. Sci., 2021

Physical Zero-Knowledge Proof for Numberlink Puzzle and k Vertex-Disjoint Paths Problem.

New Gener. Comput., 2021

Theory Comput. Syst., 2021

Discret. Math. Algorithms Appl., 2021

Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems.

Proceedings of the Unconventional Computation and Natural Computation, 2021

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020

Physical Zero-Knowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle.

CoRR, 2020

2019

J. Graph Algorithms Appl., 2019

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

CoRR, 2019

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Theor. Comput. Sci., 2018

On Aggregating Two Metrics with Relaxed Triangle Inequalities by the Weighted Harmonic Mean.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems.

CoRR, 2017

2015

Theor. Comput. Sci., 2015

2011

Greedy Algorithms for Multi-Queue Buffer Management Policies with Class Segregation

CoRR, 2011

2010

Random Struct. Algorithms, 2010

Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length.

IEICE Trans. Inf. Syst., 2010

2009

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

IEICE Trans. Inf. Syst., 2009

2008

Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation.

IEICE Trans. Inf. Syst., 2008

New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length

CoRR, 2008

2007

Random Struct. Algorithms, 2007

2006

IEEE Trans. Inf. Theory, 2006

Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations

Electron. Colloquium Comput. Complex., 2006

2005

Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2003

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

On the sample size of k-restricted min-wise independent permutations and other k-wise distributions.

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries.

Proceedings of the Approximation, 2003

2002

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2000

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

J. Cryptol., 1999

1997

J. Cryptol., 1997

1996

A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity.

J. Cryptol., 1996

Inf. Comput., 1996

Proceedings of the Information Hiding, First International Workshop, Cambridge, UK, May 30, 1996

1994

Proceedings of the Advances in Cryptology, 1994

1992

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract).

Proceedings of the Advances in Cryptology, 1992

Proceedings of the Advances in Cryptology, 1992

Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes.

Proceedings of the Advances in Cryptology, 1992

1991

J. Circuits Syst. Comput., 1991

Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials.

Inf. Process. Lett., 1991

Proceedings of the Advances in Cryptology, 1991

Proceedings of the Advances in Cryptology, 1991

Proceedings of the Advances in Cryptology, 1991

1990

Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals.

Proceedings of the Algorithms, 1990

Proceedings of the Advances in Cryptology, 1990

1989

Inf. Comput., October, 1989

IEEE J. Sel. Areas Commun., 1989

An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m).

Inf. Process. Lett., 1989

1988

A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases

Inf. Comput., September, 1988

A public-key cryptosystem based on the difficulty of solving a system of nonlinear equations.

Syst. Comput. Jpn., 1988

Public Key Cryptosystem using a reciprocal number with the same Intractability as Factoring a Large number.

Cryptologia, 1988