Toshiya Itoh

From MaRDI portal
Person:676826

Available identifiers

zbMath Open itoh.toshiyaMaRDI QIDQ676826

List of research outcomes





PublicationDate of PublicationType
Popularity on the roommate diversity problem2024-12-12Paper
Capacity-insensitive algorithms for online facility assignment problems on a line2024-11-13Paper
Popularity on the roommate diversity problem2024-09-16Paper
Online facility assignment for general layout of servers on a line2024-09-16Paper
Characterization of the imbalance problem on complete bipartite graphs2023-08-04Paper
Physical ZKP for Makaro using a standard deck of cards2023-08-04Paper
Competitive analysis for two variants of online metric matching problem2023-03-21Paper
Physical zero-knowledge proof for Numberlink2023-02-07Paper
Securely computing the \(n\)-variable equality function with \(2n\) cards2022-12-22Paper
Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems2022-07-06Paper
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku2022-02-20Paper
Competitive analysis for two variants of online metric matching problem2022-02-01Paper
Physical zero-knowledge proof for ripple effect2021-11-18Paper
Physical zero-knowledge proof for ripple effect2021-10-04Paper
Securely computing the \(n\)-variable equality function with \(2n\) cards2021-09-27Paper
Unpopularity factor in the marriage and roommates problems2021-08-03Paper
Stable noncrossing matchings2020-02-25Paper
Random Popular Matchings with Incomplete Preference Lists2019-10-25Paper
Unpopularity factor in the Marriage and Roommates problems2019-10-22Paper
AND protocols using only uniform shuffles2019-10-22Paper
Random popular matchings with incomplete preference lists2018-06-15Paper
Optimal online algorithms for the multi-objective time series search problem2018-03-16Paper
Optimal online algorithms for the multi-objective time series search problem2016-05-03Paper
Buffer management of multi-queue QoS switches with class segregation2015-06-01Paper
Weighted random popular matchings2010-12-14Paper
On the sample size of k -restricted min-wise independent permutations and other k -wise distributions2010-08-16Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography2008-12-21Paper
On (ε,k)‐min‐wise independent permutations2008-01-08Paper
Improved Approximation Lower Bounds for TSP with Distances One and Two2002-12-10Paper
Online Algorithms for Convex Case Capital Investment2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49526102001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q45053932000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q45053942000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q43140402000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q43140452000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49406962000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49371982000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49372232000-02-03Paper
Divertible and subliminal-free zero-knowledge proofs for languages1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q43186971999-08-30Paper
https://portal.mardi4nfdi.de/entity/Q42467441999-06-15Paper
https://portal.mardi4nfdi.de/entity/Q43416871998-01-14Paper
https://portal.mardi4nfdi.de/entity/Q43417331997-09-29Paper
https://portal.mardi4nfdi.de/entity/Q43417111997-07-20Paper
A language-dependent cryptographic primitive1997-03-23Paper
Simulating fair dice with biased coins1996-07-03Paper
A low communication competitive interactive proof system for promised quadratic residuosity1996-07-02Paper
On the Complexity of Hyperelliptic Discrete Logarithm Problem1993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40368571993-05-18Paper
New noninteractive identity-based key distribution system1992-06-25Paper
Characterization for a family of infinitely many irreducible equally spaced polynomials1991-01-01Paper
Demonstrating possession without revealing factors and its application1990-01-01Paper
Structure of parallel multipliers for a class of fields \(GF(2^ m)\)1989-01-01Paper
An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\)1989-01-01Paper
A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases1988-01-01Paper
Effective recursive algorithm for computing multiplicative inverses in GF(2m)1988-01-01Paper

Research outcomes over time

This page was built for person: Toshiya Itoh