Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: Seiichiro
    Last name: Tani
    DBLP: 42/1198
    Rating: (not rated yet)
    Bookmark:

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

    Show item 1 to 50 of 50  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Seiichiro Tani.
    A fast exact quantum algorithm for solitude verification.
    Quantum Information Computation 2017, Volume 17 (0) 2017
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum algorithms for finding constant-sized sub-hypergraphs.
    Theor. Comput. Sci. 2016, Volume 609 (0) 2016
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka.
    Commuting quantum circuits with few outputs are unlikely to be classically simulatable.
    Quantum Information Computation 2016, Volume 16 (0) 2016
    Conference paper
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Power of Quantum Computation with Few Clean Qubits.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Journal article
    Yasuhiro Takahashi, Seiichiro Tani.
    Shallow Quantum Circuits with Uninitialized Ancillary Qubits.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Raymond H. Putra, Seiichiro Tani, Shigeru Yamashita.
    Quantum Query Complexity of Almost All Functions with Fixed On-set Size.
    Computational Complexity 2016, Volume 25 (0) 2016
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani.
    Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits.
    Computational Complexity 2016, Volume 25 (0) 2016
    Conference paper
    Seiichiro Tani.
    A Fast Exact Quantum Algorithm for Solitude Verification.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Simpler Exact Leader Election via Quantum Reduction.
    Chicago J. Theor. Comput. Sci. 2015, Volume 2015 (0) 2015
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka.
    Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable.
    Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings 2015 (0) 2015
    Journal article
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Power of Quantum Computation with Few Clean Qubits.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs.
    Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka.
    Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Simpler Exact Leader Election via Quantum Reduction.
    Chicago J. Theor. Comput. Sci. 2014, Volume 2014 (0) 2014
    Conference paper
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Impossibility of Classically Simulating One-Clean-Qubit Computation.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani.
    Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits.
    Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013 2013 (0) 2013
    Conference paper
    Seiichiro Tani.
    Compression of View on Anonymous Networks - Folded View -.
    IEEE Trans. Parallel Distrib. Syst. 2012, Volume 23 (0) 2012
    Journal article
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    TOCT 2012, Volume 4 (0) 2012
    Conference paper
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries.
    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani.
    The One-Way Communication Complexity of Subgroup Membership.
    Chicago J. Theor. Comput. Sci. 2011, Volume 2011 (0) 2011
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani.
    Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro.
    Quantum addition circuits and unbounded fan-out.
    Quantum Information Computation 2010, Volume 10 (0) 2010
    Conference paper
    Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani.
    The quantum query complexity of certification.
    Quantum Information Computation 2010, Volume 10 (0) 2010
    Journal article
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Computing on Anonymous Quantum Network
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks.
    Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 2009 (0) 2009
    Conference paper
    Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani.
    The One-Way Communication Complexity of Group Membership
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani.
    The quantum query complexity of certification
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita.
    Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Seiichiro Tani.
    Foreword.
    IEICE Transactions 2009, Volume 92 (0) 2009
    Conference paper
    Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita.
    Multi-Party Quantum Communication Complexity with Routed Messages.
    IEICE Transactions 2009, Volume 92 (0) 2009
    Conference paper
    Seiichiro Tani.
    Claw finding algorithms using quantum walk.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita.
    Multi-party Quantum Communication Complexity with Routed Messages.
    Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings 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
    Seiichiro Tani.
    Claw Finding Algorithms Using Quantum Walk.
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Seiichiro Tani.
    An Improved Claw Finding Algorithm Using Quantum Walk.
    Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima.
    Design and Implementation of Advanced Multicast Router Based on Cluster Computing.
    11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan, July 20-22, 2005 2005 (0) 2005
    Conference paper
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Seiichiro Tani, Toshiaki Miyazaki, Noriyuki Takahashi.
    Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation.
    Active Networks, IFIP-TC6 Third International Working Conference, IWAN 2001, Philadelphia, PA, USA, September 30-October 2, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Toshiaki Miyazaki, Atsushi Takahara, Shinya Ishihara, Seiichiro Tani, Takahiro Murooka, Tomoo Fukazawa, Mitsuo Teramoto, Kazuyoshi Matsuhiro.
    Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer.
    Proceedings of the 14th International Parallel Distributed Processing Symposium (IPDPS'00), Cancun, Mexico, May 1-5, 2000 2000 (0) 2000
    Conference paper
    Atsushi Takahara, Seiichiro Tani, Shinya Ishihara, Toshiaki Miyazaki, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro.
    Virtual BUS: An Easy-to-Use Environment for Distributed Resources.
    LCN 1999 (0) 1999
    Conference paper
    Shinya Ishihara, Seiichiro Tani, Atsushi Takahara.
    Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM.
    Recent Advances in Parallel Virtual Machine and Message Passing Interface, 6th European PVM/MPI Users' Group Meeting, Barcelona, Spain, September 26-29, 1999, Proceedings 1999 (0) 1999
    Conference paper
    Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro.
    Efficient Path Selection for Delay Testing Based on Path Clustering.
    J. Electronic Testing 1999, Volume 15 (0) 1999
    Conference paper
    Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro.
    Efficient Path Selection for Delay Testing Based on Partial Path Evaluation.
    16th IEEE VLSI Test Symposium (VTS '98), 28 April - 1 May 1998, Princeton, NJ, USA 1998 (0) 1998
    Conference paper
    Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani.
    Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem.
    Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995, Proceedings 1995 (0) 1995
    Conference paper
    Kyoko Sekine, Hiroshi Imai, Seiichiro Tani.
    Computing the Tutte Polynomial of a Graph of Moderate Size.
    Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings 1995 (0) 1995
    Conference paper
    Seiichiro Tani, Hiroshi Imai.
    A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs.
    Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima.
    The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams.
    Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings 1993 (0) 1993
    Show item 1 to 50 of 50  

    Your query returned 50 matches in the database.