default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsuyoshi Ito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Kenji Tanaka, Yuki Arikawa, Kazutaka Morita, Tsuyoshi Ito, Takashi Uchida, Natsuko Saito, Shinya Kaji, Takeshi Sakamoto:
VTA-NIC: Deep Learning Inference Serving in Network Interface Cards. HCS 2022: 1-16- [c14]Kenji Tanaka, Yuki Arikawa, Tsuyoshi Ito, Yuki Matsuda, Keisuke Kamahori
, Shinya Kaji, Takeshi Sakamoto:
CiraaS: cloud computing with programmable logic. SIGCOMM Posters and Demos 2022: 43-45 - 2021
- [j10]Kenji Tanaka, Yuki Arikawa, Tsuyoshi Ito, Kazutaka Morita, Naru Nemoto, Kazuhiko Terada, Junji Teramoto, Takeshi Sakamoto:
Distributed Deep Learning With GPU-FPGA Heterogeneous Computing. IEEE Micro 41(1): 15-22 (2021) - 2020
- [c13]Kenji Tanaka, Yuki Arikawa, Tsuyoshi Ito, Kazutaka Morita, Naru Nemoto, Fumiaki Miura, Kazuhiko Terada, Junji Teramoto, Takeshi Sakamoto:
Communication-Efficient Distributed Deep Learning with GPU-FPGA Heterogeneous Computing. Hot Interconnects 2020: 43-46
2010 – 2019
- 2019
- [j9]Tsuyoshi Ito, Stacey Jeffery:
Approximate Span Programs. Algorithmica 81(6): 2158-2195 (2019) - 2016
- [c12]Tsuyoshi Ito, Stacey Jeffery:
Approximate Span Programs. ICALP 2016: 12:1-12:14 - 2015
- [i12]Tsuyoshi Ito, Stacey Jeffery:
Approximate Span Programs. CoRR abs/1507.00432 (2015) - [i11]Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito:
On the Role of Shared Randomness in Simultaneous Communication. CoRR abs/1508.06395 (2015) - [i10]Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito:
On the Role of Shared Randomness in Simultaneous Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j8]Tsuyoshi Ito:
Parallelization of entanglement-resistant multi-prover interactive proofs. Inf. Process. Lett. 114(10): 579-583 (2014) - [c11]Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito:
On the Role of Shared Randomness in Simultaneous Communication. ICALP (1) 2014: 150-162 - 2013
- [j7]Dmitry Gavinsky, Tsuyoshi Ito:
Quantum fingerprints that keep secrets. Quantum Inf. Comput. 13(7-8): 583-606 (2013) - [c10]Dmitry Gavinsky, Tsuyoshi Ito, Guoming Wang:
Shared Randomness and Quantum Communication in the Multi-party Model. CCC 2013: 34-43 - [i9]Dmitry Gavinsky, Tsuyoshi Ito, Guoming Wang:
Shared Randomness and Quantum Communication in the Multi-Party Model. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j6]Masataku Sutoh, Junya Yusa, Tsuyoshi Ito, Keiji Nagatani, Kazuya Yoshida:
Traveling performance evaluation of planetary rovers on loose soil. J. Field Robotics 29(4): 648-662 (2012) - [c9]Tsuyoshi Ito, Thomas Vidick:
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers. FOCS 2012: 243-252 - [c8]Tsuyoshi Ito, Hirotada Kobayashi, John Watrous:
Quantum interactive proofs with weak error bounds. ITCS 2012: 266-275 - [i8]Tsuyoshi Ito, Thomas Vidick:
A multi-prover interactive proof for NEXP sound against entangled provers. CoRR abs/1207.0550 (2012) - [i7]Dmitry Gavinsky, Tsuyoshi Ito, Guoming Wang:
Shared Randomness and Quantum Communication in the Multi-Party Model. CoRR abs/1210.1535 (2012) - [i6]Tsuyoshi Ito, Thomas Vidick:
A multi-prover interactive proof for NEXP sound against entangled provers. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j5]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - 2010
- [c7]Tsuyoshi Ito:
Polynomial-Space Approximation of No-Signaling Provers. ICALP (1) 2010: 140-151 - [i5]Dmitry Gavinsky, Tsuyoshi Ito:
Quantum Fingerprints that Keep Secrets. CoRR abs/1010.5342 (2010) - [i4]Tsuyoshi Ito, Hirotada Kobayashi, John Watrous:
Quantum interactive proofs with weak error bounds. CoRR abs/1012.4427 (2010) - [i3]Dmitry Gavinsky, Tsuyoshi Ito:
Quantum Fingerprints that Keep Secrets. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c6]Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto:
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. CCC 2009: 217-228 - [i2]Tsuyoshi Ito:
Polynomial-Space Approximation of No-Signaling Provers. CoRR abs/0908.2363 (2009) - 2008
- [j4]David Avis, Hiroshi Imai, Tsuyoshi Ito:
Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112(2): 303-325 (2008) - [c5]Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao:
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. CCC 2008: 187-198 - [i1]Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto:
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. CoRR abs/0810.0693 (2008) - 2007
- [j3]David Avis, Tsuyoshi Ito:
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities. Discret. Appl. Math. 155(13): 1689-1699 (2007) - [c4]David Avis, Tsuyoshi Ito:
Comparison of two bounds of the quantum correlation set. ICQNM 2007: 2 - 2005
- [j2]Takayuki Yato, Takahiro Seta, Tsuyoshi Ito:
Finding Yozume of Generalized Tsume-Shogi is Exptime-Complete. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1249-1257 (2005) - 2004
- [c3]Tsuyoshi Ito, Mary Inaba:
Theoretical Analysis of Performances of TCP/IP Congestion Control Algorithm with Different Distances. NETWORKING 2004: 962-973 - 2003
- [c2]Yasuhito Asano, Tsuyoshi Ito, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa:
Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database. WAIM 2003: 37-46 - 2000
- [c1]Nicole Beringer, Tsuyoshi Ito, Marcia Neff:
Generation of pronunciation rule sets for automatic segmentation of American English and Japanese. INTERSPEECH 2000: 452-455
1990 – 1999
- 1997
- [j1]Hiromasa Suzuki, Tsuyoshi Ito, Hidetoshi Ando, Koichi Kikkawa, Fumihiko Kimura:
Solving regional constraints in components layout design based on geometric gadgets. Artif. Intell. Eng. Des. Anal. Manuf. 11(4): 343-353 (1997)
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-08-05 20:22 CEST 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:
