The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harumichi Nishimura: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
    Computational Indistinguishability Between Quantum States and Its Cryptographic Application. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:268-284 [Conf]
  2. Harumichi Nishimura, Tomoyuki Yamakami
    An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:827-838 [Conf]
  3. Harumichi Nishimura
    On Quantum Computation with Some Restricted Amplitudes. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:311-322 [Conf]
  4. Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita
    Quantum Network Coding. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:610-621 [Conf]
  5. Harumichi Nishimura, Tomoyuki Yamakami
    An Application of Quantum Finite Automata to Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:225-236 [Conf]
  6. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  7. Harumichi Nishimura, Tomoyuki Yamakami
    An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  8. Harumichi Nishimura, Tomoyuki Yamakami
    An Application of Quantum Finite Automata to Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  9. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:059, pp:- [Journal]
  10. Tomoyuki Yamakami, Harumichi Nishimura
    An Application of Quantum Finite Automata to Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:110, pp:- [Journal]
  11. Harumichi Nishimura
    Quantum Computation With Restricted Amplitudes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:853-870 [Journal]
  12. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:195-204 [Journal]
  13. Masanao Ozawa, Harumichi Nishimura
    Local transition functions of quantum Turing machines. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:5, pp:379-402 [Journal]
  14. Harumichi Nishimura, Masanao Ozawa
    Computational complexity of uniform quantum circuit families and quantum Turing machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:147-181 [Journal]
  15. Harumichi Nishimura, Masanao Ozawa
    Uniformity of quantum circuit families for error-free algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:487-496 [Journal]
  16. Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    Unbounded-Error One-Way Classical and Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:110-121 [Conf]

  17. Quantum Network Coding. [Citation Graph (, )][DBLP]


  18. Polynomial-Time Construction of Linear Network Coding. [Citation Graph (, )][DBLP]


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


  20. Quantum Query Complexity of Boolean Functions with Small On-Sets. [Citation Graph (, )][DBLP]


  21. Unbounded-Error Quantum Query Complexity. [Citation Graph (, )][DBLP]


  22. Unbounded-Error Classical and Quantum Communication Complexity. [Citation Graph (, )][DBLP]


  23. Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks [Citation Graph (, )][DBLP]


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


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


  26. Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size [Citation Graph (, )][DBLP]


Search in 0.076secs, Finished in 0.077secs
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