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: 2010)

Search Results: Keywords 'from:2010-06-25 to:2010-06-25'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 9 of 9  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2010-06-25
09:30		 Tokyo Tokyo Tech A Fast Algorithm for Computing HOMFLY Poynomials of 2-bridge Links
Fumio Takeshita, Seiichi Tani, Masahiko Murakami (Nihon Univ.) COMP2010-15		 We give a fast algorithm for computing HOMFLY polynomials of oriented 2-bridge links. Given an oriented 2-bridge link di... [more] COMP2010-15
pp.1-8
COMP 2010-06-25
10:05		 Tokyo Tokyo Tech Improved Approximation Algorithms for Firefighter Problem on Trees
Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui (Chuo Univ.) COMP2010-16		  [more] COMP2010-16
pp.9-12
COMP 2010-06-25
10:40		 Tokyo Tokyo Tech A Polynomial-time Algorithm for the Prize-Collecting Edge Dominating Set Problem in Trees
Naoyuki Kamiyama (Chuo Univ.) COMP2010-17		  [more] COMP2010-17
pp.13-19
COMP 2010-06-25
11:30		 Tokyo Tokyo Tech [Invited Talk] On birthday attacks and catching kangaroos
Ravi Montenegro (Univ. of Massachusetts at Lowell) COMP2010-18		  [more] COMP2010-18
p.21
COMP 2010-06-25
14:00		 Tokyo Tokyo Tech Line Embeddings of Complete Binary Trees
Masao Kumamoto, Eiji Miyano (Kyushu Inst. of Tech.) COMP2010-19		  [more] COMP2010-19
pp.23-28
COMP 2010-06-25
14:35		 Tokyo Tokyo Tech Minimum Energy Broadcast on Rectangular Grid Wireless Networks
Atsushi Murata, Akira Matsubayashi (Kanazawa Univ.) COMP2010-20		 The minimum energy broadcast problem is to assign a transmission range to each node in an ad hoc wireless network to con... [more] COMP2010-20
pp.29-35
COMP 2010-06-25
15:10		 Tokyo Tokyo Tech Pattern Formation Algorithm for Weak Robots Which Utilizes Scaling and Rotation Around Centroid
Yasumasa Sujaku, Kiyoaki Yoshida (Kurume Inst. of Tech.) COMP2010-21		 An algorithm for anonymous oblivious robots with no common axes to
form 2-D patterns is presented. This algorithm utili... [more]		 COMP2010-21
pp.37-44
COMP 2010-06-25
16:00		 Tokyo Tokyo Tech A Constant Work Space Algorithm for Finding Nearest Larger Neighbors
Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas), David Kirkpatrick (Univ. of British Columbia) COMP2010-22		 In this report we consider a problem of finding nearest
larger elements using only constant work space in addition
to ... [more]		 COMP2010-22
pp.45-52
COMP 2010-06-25
16:35		 Tokyo Tokyo Tech On the Existence and Reconstruction of a Simple Graph with a Given Joint-Degree Sequence
Shigeo Shioda (Chiba Univ.) COMP2010-23		 We refer to a pair of degrees of two end nodes of a link as a {\it joint degree}, and refer to a list of joint degrees o... [more] COMP2010-23
pp.53-60
 Results 1 - 9 of 9  /   
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