Travelled to:1 × Canada
1 × Greece
1 × Iceland
1 × Poland
Collaborated with:K.Iwama T.Yamakami R.Raymond S.Yamashita H.Kobayashi F.L.Gall M.Rötteler M.Paterson
Talks about:quantum (4) classic (3) communic (2) network (2) code (2) construct (1) polynomi (1) interact (1) automata (1) unbound (1)
Person: Harumichi Nishimura
DBLP: Nishimura:Harumichi
Contributed to:
2013
200920082007
2004Wrote 5 papers:
- DLT-J-2012-IwamaN13 #quantum #string
- Recovering Strings in Oracles: Quantum and Classic (KI, HN), pp. 979–994.
- ICALP-v1-2009-KobayashiGNR #communication #network #quantum
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication (HK, FLG, HN, MR), pp. 622–633.
- ICALP-A-2008-IwamaNPRY #linear #network #polynomial
- Polynomial-Time Construction of Linear Network Coding (KI, HN, MP, RR, SY), pp. 271–282.
- ICALP-2007-IwamaNRY #bound #communication #complexity #quantum
- Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.
- CIAA-2004-NishimuraY #automaton #finite #interactive #proving #quantum
- An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.