IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2008)

Search Results: Keywords 'from:2008-12-03 to:2008-12-03'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2008-12-03
09:30		 Gunma Gunma Univ. A lower bound for tree-width of Cartesian product graphs
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2008-46		 In this paper, we give a lower bound
for tree-width of Cartesian product graphs.
To be more precise,
we show that ... [more]		 COMP2008-46
pp.1-5
COMP 2008-12-03
10:05		 Gunma Gunma Univ. Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks
Jun Kiniwa, Kensaku Kikuta (Univ. Hyogo) COMP2008-47		 We consider a malicious adversary which generates multiple undetectable
faults by local checks.
Though the possibili... [more]		 COMP2008-47
pp.7-14
COMP 2008-12-03
10:55		 Gunma Gunma Univ. A Winning Strategy for the Achievement Game of a Certain Pentahex on Hexagonal Boards
Yuuki Nohara, Akihiro Matsuura (Tokyo Denki Univ.) COMP2008-48		 In polyomino achievement games, two players alternately mark cells of a tessellation and try to
achieve a given polyom... [more]		 COMP2008-48
pp.15-21
COMP 2008-12-03
11:30		 Gunma Gunma Univ. A Simple Generation of Multi-dimensional Partitions
Yosuke Kikuchi (Tsuyama National Coll. Tech.), Katsuhisa Yamanaka (The University of Electro-Communications), Shin-ichi Nakano (Gunma Univ.) COMP2008-49		 This paper gives a simple algorithm to generate all multi-dimensional partitions of a positive integer N. The problem is... [more] COMP2008-49
pp.23-29
COMP 2008-12-03
13:20		 Gunma Gunma Univ. [Invited Talk] On the Circuit Complexity of Subgraph Isomorphism
Kazuyuki Amano (Gunma Univ.) COMP2008-50		  [more] COMP2008-50
p.31
COMP 2008-12-03
14:35		 Gunma Gunma Univ. Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions
Kenya Ueno (Univ. of Tokyo) COMP2008-51		 We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduc... [more] COMP2008-51
pp.33-40
COMP 2008-12-03
15:10		 Gunma Gunma Univ. A 4-competitive strategy for exploring unknown polygons
Xuehou Tan (Tokai Univ.) COMP2008-52		 We present a new, on-line strategy for a mobile robot to
explore an unknown simple polygon with $n$ vertices,
starti... [more]		 COMP2008-52
pp.41-48
COMP 2008-12-03
16:00		 Gunma Gunma Univ. [Invited Talk] FOCS 2008 Report
Takashi Horiyama (Saitama Univ.) COMP2008-53		  [more] COMP2008-53
p.49
 Results 1 - 8 of 8  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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)

[Return to Top Page]

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