Tsuyoshi Ito

According to our database1, Tsuyoshi Ito authored at least 24 papers between 1997 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
CiraaS: cloud computing with programmable logic.
Proceedings of the SIGCOMM '22 Poster and Demo Sessions, 2022

VTA-NIC: Deep Learning Inference Serving in Network Interface Cards.
Proceedings of the 2022 IEEE Hot Chips 34 Symposium, 2022

2021
Distributed Deep Learning With GPU-FPGA Heterogeneous Computing.
IEEE Micro, 2021

2020
Communication-Efficient Distributed Deep Learning with GPU-FPGA Heterogeneous Computing.
Proceedings of the IEEE Symposium on High-Performance Interconnects, 2020

2019
Approximate Span Programs.
Algorithmica, 2019

2015
On the Role of Shared Randomness in Simultaneous Communication.
Electron. Colloquium Comput. Complex., 2015

2014
Parallelization of entanglement-resistant multi-prover interactive proofs.
Inf. Process. Lett., 2014

2013
Shared Randomness and Quantum Communication in the Multi-Party Model.
Electron. Colloquium Comput. Complex., 2013

2012
Traveling performance evaluation of planetary rovers on loose soil.
J. Field Robotics, 2012

A multi-prover interactive proof for NEXP sound against entangled provers.
Electron. Colloquium Comput. Complex., 2012

Quantum interactive proofs with weak error bounds.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Algorithmic Folding Complexity.
Graphs Comb., 2011

2010
Quantum Fingerprints that Keep Secrets.
Electron. Colloquium Comput. Complex., 2010

Polynomial-Space Approximation of No-Signaling Provers.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
Generating facets for the cut polytope of a graph by triangular elimination.
Math. Program., 2008

Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007
New classes of facets of the cut polytope and tightness of I<sub>mm22</sub> Bell inequalities.
Discret. Appl. Math., 2007

Comparison of two bounds of the quantum correlation set.
Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies, 2007

2005
Finding Yozume of Generalized Tsume-Shogi is Exptime-Complete.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2004
Theoretical Analysis of Performances of TCP/IP Congestion Control Algorithm with Different Distances.
Proceedings of the NETWORKING 2004, 2004

2003
Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database.
Proceedings of the Advances in Web-Age Information Management, 2003

2000
Generation of pronunciation rule sets for automatic segmentation of American English and Japanese.
Proceedings of the Sixth International Conference on Spoken Language Processing, 2000

1997
Solving regional constraints in components layout design based on geometric gadgets.
Artif. Intell. Eng. Des. Anal. Manuf., 1997


  Loading...