|
|
| Chair |
|
Keio Imai (Chuo Univ.) |
| Vice Chair |
|
Hiroo Ito (Univ. of Electro-Comm.) |
| Secretary |
|
Akitoshi Kawamura (Univ. of Tokyo), Jinhee Jon (Tohoku Univ.) |
|
| Conference Date |
Tue, Sep 3, 2013 10:10 - 16:10 |
| Topics |
|
| Conference Place |
|
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
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  COMP2013-25 |
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 COMP2013-26 |
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) -- COMP2013-27 |
Tomoyuki Yamakami (Univ. of Fukui) |
| |
11:55-13:30 |
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 COMP2013-28 |
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 COMP2013-29 |
Yasuhiro Takahashi (NTT), Takeshi Yamazaki, Kazuyuki Tanaka (Tohoku Univ.) |
| |
14:40-15:00 |
Break ( 20 min. ) |
Tue, Sep 3 PM
15:00 - 16:10 |
| (6) |
15:00-15:35 |
Approximation Algorithms for Bandwidth Consective Multicolorings COMP2013-30 |
Yuji Obata, Takao Nishizeki (Kwansei Gakuin Univ.) |
| (7) |
15:35-16:10 |
Finding Maximum Regular Induced Subgraphs with Prescribed Degree COMP2013-31 |
Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Akitoshi Kawamura
Department of Computer Science, University of Tokyo
7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan 113-8656
E- :      is su-  |
Last modified: 2013-06-21 19:50:32
|