ルディー・レイモンド・ハリー・プテラ

ルディー・レイモンド・ハリー・プテラ（情報学博士）

インドネシアの西スマトラ出身．線形計画や半正定値計画といった離散最適化手法で量子計算とアルゴリズムの理論，大規模推薦システムの開発，通信計算量理論などの研究に従事し，通信とネット関連のコンサルティングサービスおよびアプリ開発などへの応用に専念．2006年京都大学情報学研究科博士課程修了．2003年と2001年同大学修士課程と学士課程卒業．

• 1996: 大阪外国語大学 (日本語研修)
• 2001: 京都大学計算機工学学士課程卒業
• 2003: 同大学情報学研究科修士課程修了
• 2003: McGill大学情報学研究科に留学
• 2006: 京都大学情報学研究科博士課程修了
• 2006: 日本アイ・ビー・エム（株）東京基礎研究所入社

新しい連絡先（２０１２年６月から）：

日本アイ・ビー・エム（株）東京基礎研究所数理科学
〒１３５－８５１１　東京都江東区豊洲５－６－５２NBF豊洲キャナルフロント
メール: raymond AT jp DOT ibm DOT com

• Map Matching with Hidden Markov Model on Sampled Road Network,
  with Tetsuro Morimura, Takayuki Osogami, and Noriaki Hirosue.
  (accepted). The 21st International Conference on Pattern Recognition (ICPR), International Association on Pattern Recognition (IAPR), 2012
• User community reconstruction using sampled microblogging data,
  with M. Enoki and Y. Ikawa.
  Proceedings of the 21st international conference companion on World Wide Web, pp. 657--660, 2012
• Simple bounds for a transient queue,
  with T. Osogami.
  Dependable Systems \& Networks (DSN), 2011 IEEE/IFIP 41st International Conference on, pp. 562--573
• Location recommendation based on location history and spatio-temporal correlations for an on-demand bus system,
  with T. Sugiura and K. Tsubouchi.
  Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 377--380, 2011
• Quantum counterfeit coin problems,
  with Kazuo Iwama, Harumichi Nishimura and Junichi Teruyama.
  The 21th International Symposium on Algorithms and Computation (ISAAC 2010), Jeju Island, Korea, 2010. pp. 85 -- 96, 2010.
• Fast and scalable algorithms for semi-supervised Link Prediction on static and dynamic graphs, ,
  with Hisashi Kashima.
  Proc. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2010), Barcelona, Spain, 2010. pp. 131 -- 147, 2010.
• Support or oppose? Classifying positions in online debates from reply activities and opinion expressions,
  Akiko Murakami and Rudy Raymond.
  The 23rd International Conference on Computational Linguistics (COLING 2010), Beijing, China, 2010. pp. 869 -- 875, 2010.
• Semidefinite optimization for transient analysis of queues,
  Takayuki Osogami and Rudy Raymond.
  The ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2010), accepted as a poster presentation with a two-page abstract, New York, NY, June 2010.
• Quantum Query Complexity of Boolean Functions with Small On-Sets,
  with Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Seiichiro Tani and Shigeru Yamashita.
  The 19th International Symposium on Algorithms and Computation ( ISAAC 2008 ), pp. 907 -- 918, Gold Coast, Australia, December 2008.
• Unbounded Error Quantum Query Complexity,
  with Ashley Montanaro and Harumichi Nishimura..
  The 19th International Symposium on Algorithms and Computation ( ISAAC 2008 ), pp. 919 -- 930, Gold Coast, Australia, December 2008.
  Preprint at: quant-ph/0712.1446.
• Polynomial-Time Construction of Linear Network Coding,
  with Kazuo Iwama, Harumichi Nishimura, Mike Paterson and Shigeru Yamashita.
  The 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), LNCS 5125 pp. 271 -- 282, Reykjavik, Iceland, July 2008.
• Sensitivity Analysis on Causal Events of WIP Bubbles by a Log-Driven Simulator,
  with Ryo Hirade and Hiroyuki Okano.
  Winter Simulation Conference (WSC) pp. 1747--1754, 2007.
• Unbounded-Error Classical and Quantum Communication Complexity,
  with Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  A contributed talk at the 11th Workshop on Quantum Information Processing (QIP 2008), New Delhi, December 2007.
  
• Unbounded-Error Classical and Quantum Communication Complexity,
  with Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  The 18th International Symposium on Algorithms and Computation (ISAAC 2007), LNCS 4835 pp. 100 -- 111, Sendai, Japan, December 2007.
  Preprint at: quant-ph/0709.2761.
• Unbounded-Error One-Way Classical and Quantum Communication Complexity,
  with Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  The 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), LNCS 4596 pp. 110 -- 121, Wroclaw, Poland, July 2007.
  Preprint at: quant-ph/0706.3265.
• Quantum Network Coding,
  with Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  The 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007), LNCS 4393 pp. 610 -- 621, Aachen, Germany.
  Preprint at: quant-ph/0601088.
• (4,1)-quantum Random Access Coding does not Exist,
  with Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  In Proceedings of IEEE Symposium on Information Theory 2006 (ISIT 2006), pp. 446-450, Seattle, Washington, USA, July 2006.
• Improved Algorithms for Quantum Identification of Boolean Oracles,
  with Andris Ambainis, Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.
  In Proceedings of 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006) LNCS 4059 pp. 280 -- 291, Riga, Latvia, July 2006.

• Analysis of transient queues with semidefinite optimization,
  with T. Osogami,
  Queueing Systems, 1--40, Springer, 2012
• [招待論文] Quantum Random Access Coding,
  with Harumichi Nishimura.
  IEICE Trans. Fundamentals, Vol.E92-A, No.5 May 2009.
• Improved Algorithms for Quantum Identification of Boolean Oracles,
  with Andris Ambainis, Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.
  Theoretical Computer Science 378(1): 41--53, 2007.
• [招待論文] 量子通信計算量理論 : 花子から太郎へ,
  西村　治道（共著）.
  <特集>量子コンピュータと量子計算，情報処理47(12)pp.1347-1352 20061215, 2006年12月．
• (4,1)-Quantum random access coding does not exist -- one qubit is not enough to recover one of four bits
  with Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  New J. Phys. 8 (2006) 129.
• Query Complexity of Quantum Biased Oracles,
  with Kazuo Iwama and Shigeru Yamashita.
  In Quantum Computation and Information -- From Theory to Experiment, H. Imai and M. Hayashi (Eds.), TAP 102, pp. 19 -- 42, 2006.
• Quantum Identification of Boolean Oracles,
  with Andris Ambainis, Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.
  In Quantum Computation and Information -- From Theory to Experiment, H. Imai and M. Hayashi (Eds.), TAP 102, pp. 3 -- 18, 2006.

• Quantum Query Complexity and Coin Problems. Centre for Quantum Technologies. Workshop on Quantum Algorithms & Complexity Theory (WQACT 2008). National University of Singapore (NUS), November 17--21, 2008.
• Quantum Query Complexity of Boolean Functions with Small On-Set. JST-CNRS Quantum Computation: Theory and Feasibility. Joint workshop in Paris, France. Institut Henri Poincare, September 25--26, 2008.
• Quantum Random Access Coding with Multiple Qubits. Workshop on Theory of Quantum Computation, Communication and Cryptography (TQC 2007). Nara Institute of Science and Technology, Nara, Japan. January 24, 2007.

• 村上明子, ルディーレイモンド
  オンラインディベートにおけるテキストと行動に基づいた意見の分類 2010年度人工知能学会全国大会（第24回） JSAI2010，長崎, 2010年6月．
• 恐神貴行, ルディーレイモンド
  半正定値計画による確率モデルの解析. 日本オペレーションズ・リサーチ学会2010年春季研究発表会, 　東京, 2010年3月.
• 恐神貴行, ルディーレイモンド
  半正定値計画による閉形式での解析. 待ち行列シンポジウム「確率モデルとその応用」, 　広島, 2010年1月.
• 岩間 一雄，西村 治道，ルディー・レイモンド・ハリー・プテラ，照山 順一
  量子偽コイン問題. LA夏シンポジウム，2009年7月.
• 岩間 一雄，西村 治道，ルディー・レイモンド・ハリー・プテラ
  Designing Quantum Game Strategies from Quantum Communication Protocols. 信学技報, vol. 109, no. 54, COMP2009-12, pp. 21-28, 2009年5月.
• Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani and Shigeru Yamashita.
  Average/Worst-case Gaps of Quantum Query Complexities. Twelfth Workshop on Quantum Information Processing (QIP 2009), Poster presentation, Santa Fe, USA, 2009.
• A. Ambainis, K. Iwama, M. Nakanishi, H. Nishimura, R. Raymond, S. Tani, and S. Yamashita.
  Quantum Query Complexity of Boolean Functions with Small On-Sets. 第19回量子情報技術研究会 (QIT19), QIT2008-56, pp.39-44, 2008年11月.
• Rudy Raymond.
  日本アイ・ビー・エム東京基礎研究所とＧＴＯ　２００８年の紹介 会津大学, 会津, 2008年7月2日．
• A. Montanaro, H. Nishimura and Rudy Raymond.
  非有界誤り量子質問計算量 電子情報通信学会技術研究報告. COMP, コンピュテーション 107(537) pp.9-14 2008年3月3日．
• Rudy Raymond.
  Unbounded-error Quantum Query Complexity. Presentation at JST-ERATO Meeting, Kyoto, January 10-11, 2008.
• Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond and Shigeru Yamashita.
  Fidelity-Efficient Quantum Network Coding. Eleventh Workshop on Quantum Information Processing (QIP 2008), Poster presentation, New Delhi, India, 2007.
• Rudy Raymond.
  Arrangements and Unbouded-error Communication Complexity. Presentation at JST-ERATO Meeting, Kyoto, June 18-19, 2007.
• K. Iwama, H. Nishimura, R. Raymond and S. Yamashita.
  Unbounded-error Quantum Communication Complexity. 第16回量子情報技術研究会 (QIT16), pp.106-111, 2007年5月．
• Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  Quantum Random Access Coding using Multiple Qubits. Tenth Workshop on Quantum Information Processing (QIP 2007). Poster presentation, Brisbane, Australia, 2007.
• Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  Quantum Network Coding for General Graphs Tenth Workshop on Quantum Information Processing (QIP 2007). Poster presentation, Brisbane, Australia, 2007.
• Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  (4,1)-Quantum Random Access Coding Does Not Exist . One qubit is not enough to recover one of four bits. Proc. of Asian Conference on Quantum Information Science 2006 (AQIS 2006), pp. 188--189, Beijing, China, Sep. 2006.
• Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  (4,1)-Quantum Random Access Coding Does Not Exist. 信学技報, vol. 106, no. 63, COMP2006-14, pp. 33-38, 2006年5月．

English page

日本語のページ