| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Keio Imai (Chuo Univ.) Vice Chair: Hiroo Ito (Univ. of Electro-Comm.) Secretary: Akitoshi Kawamura (Univ. of Tokyo), Jinhee Jon (Tohoku Univ.) DATE: Tue, Sep 3, 2013 10:10 - 16:10 PLACE: TOPICS: ---------------------------------------- Tue, Sep 3 AM (10:10 - 11:55) ---------------------------------------- (1) 10:10 - 10:45 An O(n log n) Algorithm for the Minimax Regret Sink Location Problem in Dynamic Path Networks with the Uniform Capacity Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.) (2) 10:45 - 11:20 A New UCB-based Algorithm for the Matching-Selection Multi-armed Bandit Problem Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) (3) 11:20 - 11:55 Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages -- (Preliminary Version) -- Tomoyuki Yamakami (Univ. of Fukui) ----- Break ( 95 min. ) ----- ---------------------------------------- Tue, Sep 3 PM (13:30 - 14:40) ---------------------------------------- (4) 13:30 - 14:05 A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions Endre Boros (Rutgers Univ.), Khaled Elbassioni (MPI), Vladimir Gurvich (Rutgers Univ.), Kazuhisa Makino (Kyoto Univ.) (5) 14:05 - 14:40 Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates Yasuhiro Takahashi (NTT), Takeshi Yamazaki, Kazuyuki Tanaka (Tohoku Univ.) ----- Break ( 20 min. ) ----- ---------------------------------------- Tue, Sep 3 PM (15:00 - 16:10) ---------------------------------------- (6) 15:00 - 15:35 Approximation Algorithms for Bandwidth Consective Multicolorings Yuji Obata, Takao Nishizeki (Kwansei Gakuin Univ.) (7) 15:35 - 16:10 Finding Maximum Regular Induced Subgraphs with Prescribed Degree Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) # Information for speakers General Talk will have 25 minutes for presentation and 10 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Fri, Oct 18, 2013: Nagoya Institute of Technology [Mon, Aug 5] Fri, Dec 20, 2013 - Sat, Dec 21, 2013: Okinawa Industry Support Center [Thu, Oct 3] # SECRETARY: Akitoshi Kawamura Department of Computer Science, University of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan 113-8656 E-mail:      is su-  Last modified: 2013-06-21 19:50:32 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]