The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hirotada Kobayashi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Quantum versus Deterministic Counter Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:584-594 [Conf]
  2. Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
    One-Way Probabilistic Reversible and Quantum One-Counter Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:436-446 [Conf]
  3. Hirotada Kobayashi
    Non-interactive Quantum Perfect and Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:178-188 [Conf]
  4. Hirotada Kobayashi, Keiji Matsumoto
    Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:115-127 [Conf]
  5. Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
    Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:189-198 [Conf]
  6. Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
    Universal Test for Quantum One-Way Permutations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:839-850 [Conf]
  7. Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
    Exact Quantum Algorithms for the Leader Election Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:581-592 [Conf]
  8. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    An Analysis of Absorbing Times of Quantum Walks. [Citation Graph (0, 0)][DBLP]
    UMC, 2002, pp:315-330 [Conf]
  9. Hirotada Kobayashi, Keiji Matsumoto
    Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  10. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Two-way Quantum One-counter Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  11. Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
    Quantum Certificate Verification: Single versus Multiple Quantum Certificates [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  12. Hirotada Kobayashi, Keiji Matsumoto
    Quantum multi-prover interactive proof systems with limited prior entanglement. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:3, pp:429-450 [Journal]
  13. Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
    Universal test for quantum one-way permutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:370-385 [Journal]
  14. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Quantum versus deterministic counter automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:334, n:1-3, pp:275-297 [Journal]
  15. Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
    One-way probabilistic reversible and quantum one-counter automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:963-976 [Journal]

  16. Using Entanglement in Quantum Multi-prover Interactive Proofs. [Citation Graph (, )][DBLP]


  17. Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. [Citation Graph (, )][DBLP]


  18. Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. [Citation Graph (, )][DBLP]


  19. Entangled Games are Hard to Approximate. [Citation Graph (, )][DBLP]


  20. General Scheme for Perfect Quantum Network Coding with Free Classical Communication. [Citation Graph (, )][DBLP]


  21. Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. [Citation Graph (, )][DBLP]


  22. General Properties of Quantum Zero-Knowledge Proofs. [Citation Graph (, )][DBLP]


  23. Using Entanglement in Quantum Multi-Prover Interactive Proofs. [Citation Graph (, )][DBLP]


  24. Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies [Citation Graph (, )][DBLP]


  25. Perfect Quantum Network Communication Protocol Based on Classical Network Coding [Citation Graph (, )][DBLP]


  26. General Scheme for Perfect Quantum Network Coding with Free Classical Communication [Citation Graph (, )][DBLP]


  27. Computing on Anonymous Quantum Network [Citation Graph (, )][DBLP]


Search in 0.164secs, Finished in 0.166secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002