Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Harumichi
    Last name: Nishimura
    DBLP: 02/5630
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 50 to 74 of 74  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An application of quantum finite automata to interactive proof systems.
    J. Comput. Syst. Sci. 2009, Volume 75 (0) 2009
    Conference paper
    Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita.
    Polynomial-Time Construction of Linear Network Coding.
    Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games 2008 (0) 2008
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita.
    Quantum Query Complexity of Boolean Functions with Small On-Sets.
    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Ashley Montanaro, Harumichi Nishimura, Rudy Raymond.
    Unbounded-Error Quantum Query Complexity.
    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita.
    Unbounded-Error One-Way Classical and Quantum Communication Complexity.
    Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita.
    Unbounded-Error Classical and Quantum Communication Complexity.
    Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Raymond H. Putra, Shigeru Yamashita.
    Quantum Network Coding.
    STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami.
    Computational Indistinguishability between Quantum States and Its Cryptographic Application.
    IACR Cryptology ePrint Archive 2006, Volume 2006 (0) 2006
    Conference paper
    Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita.
    Quantum Network Coding.
    Complexity of Boolean Functions, 12.03. - 17.03.2006 2006 (0) 2006
    Conference paper
    Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami.
    Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
    Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
    CoRR 2005, Volume 0 (0) 2005
    Conference paper
    Harumichi Nishimura, Masanao Ozawa.
    Uniformity of quantum circuit families for error-free algorithms.
    Theor. Comput. Sci. 2005, Volume 332 (0) 2005
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
    Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Application of Quantum Finite Automata to Interactive Proof Systems.
    Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers 2004 (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Application of Quantum Finite Automata to Interactive Proof Systems
    CoRR 2004, Volume 0 (0) 2004
    Conference paper
    Tomoyuki Yamakami, Harumichi Nishimura.
    An Application of Quantum Finite Automata to Interactive Proof Systems
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    Polynomial time quantum computation with advice.
    Inf. Process. Lett. 2004, Volume 90 (0) 2004
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    Polynomial time quantum computation with advice
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Harumichi Nishimura, Tomoyuki Yamakami.
    Polynomial time quantum computation with advice
    Electronic Colloquium on Computational Complexity (ECCC) 2003, Volume 10 (0) 2003
    Conference paper
    Harumichi Nishimura.
    Quantum Computation With Restricted Amplitudes.
    Int. J. Found. Comput. Sci. 2003, Volume 14 (0) 2003
    Journal article
    Elham Kashefi, Harumichi Nishimura, Vlatko Vedral.
    On quantum one-way permutations.
    Quantum Information Computation 2002, Volume 2 (0) 2002
    Conference paper
    Harumichi Nishimura.
    On Quantum Computation with Some Restricted Amplitudes.
    STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Harumichi Nishimura, Masanao Ozawa.
    Computational complexity of uniform quantum circuit families and quantum Turing machines.
    Theor. Comput. Sci. 2002, Volume 276 (0) 2002
    Conference paper
    Masanao Ozawa, Harumichi Nishimura.
    Local transition functions of quantum Turing machines.
    ITA 2000, Volume 34 (0) 2000
    Show item 50 to 74 of 74  

    Your query returned 74 matches in the database.