IEICE Technical Committee Submission System
Advance Program		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top  Go Back   / [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


Technical Committee on Theoretical Foundations of Computing (COMP) [schedule] [select]
Chair Takeshi Tokuyama (Tohoku Univ.)
Vice Chair Satoru Iwata (Kyoto Univ.)
Secretary Takashi Horiyama (Saitama Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.)

Conference Date Wed, Dec 3, 2008 09:30 - 17:00
Topics  
Conference Place Guma University 
Contact
Person		 Prof. Shin-Ichi Nakano
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)

Wed, Dec 3 AM 
09:30 - 17:00
(1) 09:30-10:05 A lower bound for tree-width of Cartesian product graphs COMP2008-46 Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.)
(2) 10:05-10:40 Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks COMP2008-47 Jun Kiniwa, Kensaku Kikuta (Univ. Hyogo)
  10:40-10:55 Break ( 15 min. )
(3) 10:55-11:30 A Winning Strategy for the Achievement Game of a Certain Pentahex on Hexagonal Boards COMP2008-48 Yuuki Nohara, Akihiro Matsuura (Tokyo Denki Univ.)
(4) 11:30-12:05 A Simple Generation of Multi-dimensional Partitions COMP2008-49 Yosuke Kikuchi (Tsuyama National Coll. Tech.), Katsuhisa Yamanaka (The University of Electro-Communications), Shin-ichi Nakano (Gunma Univ.)
  12:05-13:20 Lunch Break ( 75 min. )
(5) 13:20-14:20 [Invited Talk]
On the Circuit Complexity of Subgraph Isomorphism COMP2008-50		 Kazuyuki Amano (Gunma Univ.)
  14:20-14:35 Break ( 15 min. )
(6) 14:35-15:10 Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions COMP2008-51 Kenya Ueno (Univ. of Tokyo)
(7) 15:10-15:45 A 4-competitive strategy for exploring unknown polygons COMP2008-52 Xuehou Tan (Tokai Univ.)
  15:45-16:00 Break ( 15 min. )
(8) 16:00-17:00 [Invited Talk]
FOCS 2008 Report COMP2008-53		 Takashi Horiyama (Saitama Univ.)

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address Takashi Horiyama
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-3957
Email: alii-u 


Last modified: 2008-11-24 10:58:47


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   / [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan