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


Technical Committee on Theoretical Foundations of Computing (COMP) [schedule] [select]
Chair Masafumi Yamashita
Vice Chair Tatsuya Akutsu
Secretary Keisuke Tanaka, Kunihiko Sadakane

Conference Date Fri, Mar 18, 2005 09:00 - 17:40
Topics  
Conference Place O-okayama campus, Tokyo Institute of Technology 
Transportation Guide http://www.titech.ac.jp/access-and-campusmap/j/o-okayama-campusmap-j.html
Contact
Person
Prof. Keisuke Tanaka
03-5734-3884

Fri, Mar 18 AM 
09:00 - 17:40
(1) 09:00-09:25 RSA-based Public-Key Encryption Schemes with Anonymity Ryotaro Hayashi, Keisuke Tanaka (Tokyo Inst. of Tech.)
(2) 09:25-09:50 A General Construction of Hard-Core Predicates for Any Quantum One-Way Function Akinori Kawachi (Tokyo Inst. Tech.), Tomoyuki Yamakami (Trent Univ.)
(3) 09:50-10:15 Equality between Recognizable Expression and Finite Tree Automaton Fumihiko Yamaguchi, Katsunori Yamasaki (Tokyo Univ. of Sci.)
  10:15-10:25 Break ( 10 min. )
(4) 10:25-10:50 AC-termination by modified monotonic AC-compatible semantic path orderings Hideyuki Ochiai, Takahito Aoto, Yoshihito Toyama (Tohoku Univ.)
(5) 10:50-11:15 Horn functions with single two-negated term Naoki Kawamura, Shigeki Iwata (UEC)
(6) 11:15-11:40 An Energy Conplexity of Threshold Circuits Kei Uchizawa (Tohoku Univ.), Wolfgang Maass (Tech. Univ. Graz)
  11:40-13:00 Lunch Break ( 80 min. )
(7) 13:00-14:00  
  14:00-14:10 Break ( 10 min. )
(8) 14:10-14:35 Algorithms for Finding Distance-Edge-Colorings of Graphs Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki (Tohoku Univ.)
(9) 14:35-15:00 A lower bound for the vertex isoperimetric number of the complete k-ary tree Yota Otachi, Kaori Umezawa, Koichi Yamazaki (Gunma Univ.)
(10) 15:00-15:25 Minimum 3-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints Toshiya Mashima (Hiroshima International Univ.), Toshimasa Watanabe (Hiroshima Univ.)
(11) 15:25-15:50 Complexity of coloring comparability + ke graphs Kenichi Higashide, Yasuhiko Takenaga (UEC)
  15:50-16:00 Break ( 10 min. )
(12) 16:00-16:25 Collect Tours for Moving Objects with Release Times and Deadlines Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano, Shinichi Shimoirisa (Kyushu Inst. of Tech.)
(13) 16:25-16:50 Algorithms for Map Labeling with Leader Lines Kazuki Omori, Sumio Masuda, Kazuaki Yamaguchi (Kobe Univ.)
(14) 16:50-17:15 NP-completeness of maximum chain problem on generalized Puyopuyo Teruhisa Matsukane, Yasuhiko Takenaga (UEC)
(15) 17:15-17:40 Online Allocation with Risk Information Shigeaki Harada, Eiji Takimoto, Akira Maruoka (Tohoku Univ.)

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address  


Last modified: 2005-01-24 22:16:40


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   Prev COMP Conf / Next COMP Conf [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