|
|
| Chair |
|
Tetsuo Asano (JAIST) |
| Vice Chair |
|
Kazuhisa Makino (Univ. of Tokyo) |
| Secretary |
|
Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.) |
|
| Conference Date |
Fri, Mar 16, 2012 10:00 - 17:30 |
| Topics |
|
| Conference Place |
University of Tokyo, Building 6 of Department of Engineering, Seminar Room AD |
| Address |
7-3-1 Hongo Bunkyo-ku Tokyo 113-8656 Japan |
Contact
Person |
Prof. Naonori KAKIMURA |
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) |
Fri, Mar 16
10:00 - 17:30 |
| (1) |
10:00-10:35 |
The Linguistic Information and Human Evolution
-- The Mechanism of Linguistic Automata: Concept, Grammar and Logical Concept --  COMP2011-47 |
Kimiaki Tokumaru (System Engineer) |
| (2) |
10:35-10:55 |
A simple parallel computation algorithm for functions on trees COMP2011-48 |
Kunihiko Sadakane (NII) |
| (3) |
10:55-11:30 |
Computational Complexity of Competitive Diffusion on Graphs COMP2011-49 |
Hisayuki Satoh, Kei Uchizawa, Takehiro Ito, Xiao Zhou (Tohoku Univ.) |
| |
11:30-13:00 |
Lunch Break ( 90 min. ) |
| (4) |
13:00-13:35 |
Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth COMP2011-50 |
Ei Ando (Sojo Univ.), Joseph Peters (Simon Fraser Univ.) |
| (5) |
13:35-14:10 |
Parameterized complexity of coloring comparability-ke graphs COMP2011-51 |
Atsuhsi Saito, Yasuhiko Takenaga (UEC) |
| (6) |
14:10-14:45 |
Sublinear Space Algorithm for Shortest Path Problem on Grid Graph COMP2011-52 |
Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) |
| |
14:45-15:05 |
Break ( 20 min. ) |
| (7) |
15:05-15:40 |
Randomized Rendezvous of Multiple Mobile Agents in Anonymous Unidirectional Ring Networks COMP2011-53 |
Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
| (8) |
15:40-16:15 |
Conjecture on a Upper Bound on the Recurrent Lengths COMP2011-54 |
Shuji Jimbo (Okayama Univ.) |
| |
16:15-16:30 |
Break ( 15 min. ) |
| (9) |
16:30-17:30 |
[Invited Talk]
My Favorite Garden COMP2011-55 |
Takeaki Uno (NII) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Invited Talk | Each speech will have 50 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 |
Takehiro ITO
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-6-05, Aoba-ku Sendai
980-8579, Japan
Email:      ecei     |
Last modified: 2012-01-18 14:21:51
|