|
|
| Chair |
|
Osamu Watanabe |
| Vice Chair |
|
Hiroki Arimura |
| Secretary |
|
Takeshi Koshiba, Shuichi Miyazaki |
|
| Conference Date |
Thu, Sep 20, 2007 10:00 - 17:00 |
| 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) |
Thu, Sep 20 AM
10:00 - 17:00 |
| (1) |
10:00-10:35 |
Direct Reduction of String (1,2)-OT to Rabin's OT  COMP2007-32 |
Kaoru Kurosawa (Ibaraki Univ.), Takeshi Koshiba (Saitama Univ.) |
| (2) |
10:35-11:10 |
Alternating tricodes and modified RSA cryptosystems COMP2007-33 |
Feng Ding, Shuji Jimbo, Kosaburo Hashiguchi (Okayama Univ.) |
| (3) |
11:10-11:45 |
Techniques to Accelerate Request Processing for Byzantine Fault Tolerance COMP2007-34 |
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
| (4) |
13:15-13:50 |
Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights COMP2007-35 |
Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
| (5) |
13:50-14:25 |
Bandwidth of Bipartite Permutation Graphs COMP2007-36 |
Ryuhei Uehara (JAIST) |
| (6) |
14:25-15:00 |
Complexity and Enumeration of Subclasses COMP2007-37 |
Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) |
| |
15:00-15:15 |
Break ( 15 min. ) |
| (7) |
15:15-15:50 |
The Complexity of the Hajos Calculus on Planar Graphs COMP2007-38 |
Yoichi Hanatani (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Kazuo Iwama, Suguru Tamaki (Kyoto Univ.) |
| (8) |
15:50-16:25 |
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles COMP2007-39 |
Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
| (9) |
16:25-17:00 |
A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an $n$-Vertex Graph with at Least $\bigl\lceil(3-2\sqrt{2})n^2+n-\frac{7-2\sqrt{2}}{2\sqrt{2}}\bigr\rceil$ Edges COMP2007-40 |
Peng Cheng (Nagoya Gakuin Univ), Shigeru Masuyama (Toyohashi Univ. 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 |
Takeshi Koshiba
Division of Mathematics, Electronics and Informatics,
Graduate School of Science and Engineering, Saitama Univeristy
255 Shimo-Ohkubo, Sakura, Saitama 338-8570, Japan.
Phone/Fax: +81-48-858-3494
Email:   ba t  i i  -u |
Last modified: 2007-07-24 18:28:13
|