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 Keio Imai (Chuo Univ.)
Vice Chair Hiroo Ito (Univ. of Electro-Comm.)
Secretary Jinhee Jon (Tohoku Univ.), Akitoshi Kawamura (Univ. of Tokyo)

Conference Date Mon, Mar 18, 2013 09:55 - 17:30
Topics  
Conference Place  

Mon, Mar 18 AM 
09:55 - 10:45
(1) 09:55-10:20 On the eternal vertex cover number of trees composed of elementary bipartite graphs Shota Inoue, Hisashi Araki, Toshihiro Fujito (Toyohashi Univ. of Tech)
(2) 10:20-10:45 Reservoir sampling in stream using O(log log n) space Naoto Sonoda, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.)
  10:45-10:55 Break ( 10 min. )
Mon, Mar 18 AM 
10:55 - 12:05
(3) 10:55-12:05 [Tutorial Lecture]
Introduction to Computational Complexity Theory (2):Algorithmic Approaches to Lower Bounds of Computational Complexity
Akinori Kawachi (Tokyo Inst. of Tech.)
  12:05-13:20 Lunch Break ( 75 min. )
Mon, Mar 18 PM 
13:20 - 16:30
(4) 13:20-13:45 Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate Large-Scale Sparse Matrices Shin-ichi Minato (Hokkaido Univ.)
(5) 13:45-14:10 Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII)
(6) 14:10-14:35 A note on lower bounds of the girth of planar C_7-colorable graphs Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.)
(7) 14:35-15:00 Comparative evaluation of two constructions of Hamiltonian circuits for generating picturesque mazes with illusory images Fuhito Yanagitani, Akihiro Uejima (Osaka Electro-Comm. Univ.)
  15:00-15:15 Break ( 15 min. )
(8) 15:15-15:40 A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.)
(9) 15:40-16:05 Schnorr and Kurtz randomness versions of Merkel's criterion Kenshi Miyabe (Kyoto Univ.)
(10) 16:05-16:30 An extension of code by introducing partial orders on codewords Etsuro Moriya (Waseda Univ.)
  16:30-16:40 Break ( 10 min. )
Mon, Mar 18 PM 
16:40 - 17:30
(11) 16:40-17:30 [Fellow Memorial Lecture]
The significance and power of computation theory: The role in information society
Takeshi Tokuyama (Tohoku Univ.)

Announcement for Speakers
General TalkEach speech will have 20 minutes for presentation and 5 minutes for discussion.

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address Jinhee Chun
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-3-09, Aoba-ku Sendai
980-8579, Japan
Email: neisis 


Last modified: 2013-03-12 15:35:58


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