Toshiya Itoh

Theor. Comput. Sci., 2025

2024

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

[BibT_eX]

[DOI]

Shuichi Miyazaki

Discret. Math. Algorithms Appl., July, 2024

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Popularity on the 3D-Euclidean Stable Roommates.

[BibT_eX]

[DOI]

Steven Ge

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Physical ZKP for Makaro Using a Standard Deck of Cards.

[BibT_eX]

[DOI]

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

Characterization of the Imbalance Problem on Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Steven Ge

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

How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku.

[BibT_eX]

[DOI]

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

2021

Physical zero-knowledge proof for Ripple Effect.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Securely computing the <i>n</i>-variable equality function with 2<i>n</i> cards.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

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

[BibT_eX]

[DOI]

New Gener. Comput., 2021

Unpopularity Factor in the Marriage and Roommates Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Competitive analysis for two variants of online metric matching problem.

[BibT_eX]

[DOI]

Shuichi Miyazaki

Makoto Satake

Discret. Math. Algorithms Appl., 2021

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

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2021

Physical Zero-Knowledge Proof for Numberlink.

[BibT_eX]

[DOI]

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

2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

Random Popular Matchings with Incomplete Preference Lists.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

On the Competitive Analysis for the Multi-Objective Time Series Search Problem.

[BibT_eX]

[DOI]

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

Securely Computing the n-Variable Equality Function with 2n Cards.

[BibT_eX]

[DOI]

CoRR, 2019

Stable Noncrossing Matchings.

[BibT_eX]

[DOI]

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

AND Protocols Using only Uniform Shuffles.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Optimal online algorithms for the multi-objective time series search problem.

[BibT_eX]

[DOI]

Shun Hasegawa

Theor. Comput. Sci., 2018

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2017

2015

Buffer management of multi-queue QoS switches with class segregation.

[BibT_eX]

[DOI]

Seiji Yoshimoto

Theor. Comput. Sci., 2015

2011

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

[BibT_eX]

[DOI]

Seiji Yoshimoto

CoRR, 2011

2010

Weighted random popular matchings.

[BibT_eX]

[DOI]

Osamu Watanabe

Random Struct. Algorithms, 2010

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

[BibT_eX]

[DOI]

Yasuhiro Suzuki

IEICE Trans. Inf. Syst., 2010

2009

Approximation Algorithms for the Highway Problem under the Coupon Model.

[BibT_eX]

[DOI]

Ryoso Hamane

Kouhei Tomita

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

Approximation Preserving Reductions among Item Pricing Problems.

[BibT_eX]

[DOI]

Ryoso Hamane

Kouhei Tomita

IEICE Trans. Inf. Syst., 2009

2008

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

[BibT_eX]

[DOI]

Ryoso Hamane

IEICE Trans. Inf. Syst., 2008

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

[BibT_eX]

[DOI]

Yasuhiro Suzuki

CoRR, 2008

2007

On (epsilon, k)-min-wise independent permutations.

[BibT_eX]

[DOI]

Noga Alon

Tatsuya Nagatani

Random Struct. Algorithms, 2007

2006

Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

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

[BibT_eX]

[DOI]

Noriyuki Takahashi

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

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

2005

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

[BibT_eX]

[DOI]

Takanobu Nagumo

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

2003

A Note on the Relationships among Certified Discrete Log Cryptosystems.

[BibT_eX]

[DOI]

Eikoh Chida

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

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

[BibT_eX]

[DOI]

Jun Tarui

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.

[BibT_eX]

[DOI]

Jun Tarui

Proceedings of the Approximation, 2003

2002

Min-Wise Independence vs. 3-Wise Independence.

[BibT_eX]

[DOI]

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

2000

On permutations with limited independence.

[BibT_eX]

[DOI]

Jun Tarui

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

1999

Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages.

[BibT_eX]

[DOI]

J. Cryptol., 1999

1997

A Language-Dependent Cryptographic Primitive.

[BibT_eX]

[DOI]

Yuji Ohta

J. Cryptol., 1997

1996

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

[BibT_eX]

[DOI]

Masafumi Hoshi

J. Cryptol., 1996

Simulating Fair Dice with Biased Coins.

[BibT_eX]

[DOI]

Inf. Comput., 1996

A Progress Report on Subliminal-Free Channels.

[BibT_eX]

[DOI]

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

1994

Language Dependent Secure Bit Commitment.

[BibT_eX]

[DOI]

Yuji Ohta

Proceedings of the Advances in Cryptology, 1994

1992

On the Complexity of Composite Numbers.

[BibT_eX]

[DOI]

Kenji Horikawa

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

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

On Bit Correlations Among Preimages of "Many to One" One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

Provably Secure Key-Updating Schemes in Identity-Based Systems.

[BibT_eX]

[DOI]

J. Circuits Syst. Comput., 1991

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

On the Complexity of Hyperelliptic Discrete Logarithm Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

Any Language in IP Has a Divertable ZKIP.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

On the Complexity of Constant Round ZKIP of Possession of Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

1990

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1990

Demonstrating Possession without Revealing Factors and its Application.

[BibT_eX]

[DOI]

Kenji Koyama

Proceedings of the Advances in Cryptology, 1990

1989

Structure of Parallel Multipliers for a Class of Fields GF(2^m)

[BibT_eX]

[DOI]

Inf. Comput., October, 1989

An ID-based cryptosystem based on the discrete logarithm problem.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1989

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

1988

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

[BibT_eX]

[DOI]

Inf. Comput., September, 1988

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

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1988

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

[BibT_eX]

[DOI]

Kaoru Kurosawa