Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Nishimura, Harumichi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Interactive proofs with quantum finite automata
Harumichi Nishimura
,
Tomoyuki Yamakami
Theoretical Computer Science
568
, 2015, pp. 1-18
Quantum algorithms for finding constant-sized sub-hypergraphs
François Le Gall
,
Harumichi Nishimura
,
Seiichiro Tani
Lecture Notes in Computer Science
8591
, 2014, pp. 429-440
Quantum algorithms for matrix products over semirings
François Le Gall
,
Harumichi Nishimura
Lecture Notes in Computer Science
8503
, 2014, pp. 331-343
Recovering strings in oracles: Quantum and classic
Kazuo Iwama
,
Harumichi Nishimura
International Journal of Foundations of Computer Science
24
(7), 2013, pp. 979-993
Reconstructing strings from substrings with quantum queries
Richard Cleve
,
Kazuo Iwama
,
François Le Gall
,
Harumichi Nishimura
,
Seiichiro Tani
,
Junichi Teruyama
,
Shigeru Yamashita
Lecture Notes in Computer Science
7357
, 2012, pp. 388-397
Quantum counterfeit coin problems
Kazuo Iwama
,
Harumichi Nishimura
,
Rudy Raymond
,
Junichi Teruyama
Theoretical Computer Science
456
, 2012, pp. 51-64
Unbounded-error quantum query complexity
Ashley Montanaro
,
Harumichi Nishimura
,
Rudy Raymond
Theoretical Computer Science
412
(35), 2011, pp. 4619-4628
Quantum counterfeit coin problems
Kazuo Iwama
,
Harumichi Nishimura
,
Rudy Raymond
,
Junichi Teruyama
Lecture Notes in Computer Science
6506
, 2010, pp. 85-96
General scheme for perfect quantum network coding with free classical communication
Hirotada Kobayashi
,
François Le Gall
,
Harumichi Nishimura
,
Martin Rötteler
Lecture Notes in Computer Science
5555
, 2009, pp. 622-633
An application of quantum finite automata to interactive proof systems
Harumichi Nishimura
,
Tomoyuki Yamakami
Journal of Computer and System Sciences
75
(4), 2009, pp. 255-269
Quantum query complexity of Boolean functions with small on-sets
Andris Ambainis
,
Kazuo Iwama
,
Masaki Nakanishi
,
Harumichi Nishimura
,
Rudy Raymond
,
Seiichiro Tani
,
Shigeru Yamashita
Lecture Notes in Computer Science
5369
, 2008, pp. 907-918
Polynomial-time construction of linear network coding
Kazuo Iwama
,
Harumichi Nishimura
,
Mike Paterson
,
Rudy Raymond
,
Shigeru Yamashita
Lecture Notes in Computer Science
5125
, 2008, pp. 271-282
Unbounded-error quantum query complexity
Ashley Montanaro
,
Harumichi Nishimura
,
Rudy Raymond
Lecture Notes in Computer Science
5369
, 2008, pp. 919-930
Quantum network coding
Masahito Hayashi
,
Kazuo Iwama
,
Harumichi Nishimura
,
Rudy Raymond
,
Shigeru Yamashita
Lecture Notes in Computer Science
4393
, 2007, pp. 610-621
Unbounded-error one-way classical and quantum communication complexity
Kazuo Iwama
,
Harumichi Nishimura
,
Rudy Raymond
,
Shigeru Yamashita
Lecture Notes in Computer Science
4596
, 2007, pp. 110-121
Unbounded-error classical and quantum communication complexity
Kazuo Iwama
,
Harumichi Nishimura
,
Rudy Raymond
,
Shigeru Yamashita
Lecture Notes in Computer Science
4835
, 2007, pp. 100-111
Uniformity of quantum circuit families for error-free algorithms
Harumichi Nishimura
,
Masanao Ozawa
Theoretical Computer Science
332
(1-3), 2005, pp. 487-496
Polynomial time quantum computation with advice
Harumichi Nishimura
,
Tomoyuki Yamakami
Information Processing Letters
90
(4), 2004, pp. 195-204
An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation
Harumichi Nishimura
,
Tomoyuki Yamakami
Lecture Notes in Computer Science
3153
, 2004, pp. 827-838
Quantum computation with restricted amplitudes
Harumichi Nishimura
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 853-870
Computational complexity of uniform quantum circuit families and quantum Turing machines
Harumichi Nishimura
,
Masanao Ozawa
Theoretical Computer Science
276
(1-2), 2002, pp. 147-181
On quantum computation with some restricted amplitudes
Harumichi Nishimura
Lecture Notes in Computer Science
2285
, 2002, pp. 311-322