| 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) Chair: Takeshi Tokuyama (Tohoku Univ.) Vice Chair: Satoru Iwata (Kyoto Univ.) Secretary: Takashi Horiyama (Saitama Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.) DATE: Fri, Oct 10, 2008 09:00 - 16:45 PLACE: Aobayama Campus, Tohoku University(Aoba-yama 6-6, Aoba-ku, Sendai, 980-8579, Japan. http://www.eng.tohoku.ac.jp/english/map/?menu=campus-overview. Prof. Xiao Zhou / Prof. Takehiro Ito) TOPICS: ---------------------------------------- Fri, Oct 10 AM (09:00 - 16:45) ---------------------------------------- (1) 09:00 - 09:30 Bit-Parallel Tree Pattern Matching Algorithms for Trees with Restricted Labels Hiroaki Yamamoto (Shinshu Univ.), Daichi Takenouchi (NTT-AT) (2) 09:30 - 10:00 Packing Alignment and Its Application to Music Mining Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) (3) 10:00 - 10:30 On the Complexity of Reconfiguration Problems Takehiro Ito (Tohoku Univ.), Erik D. Demaine, Nicholas J. A. Harvey (MIT), Christos H. Papadimitriou (UC Berkeley), Martha Sideri (AUEB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) ----- Break ( 15 min. ) ----- (4) 10:45 - 11:15 A Class of Smallest Four-State Firing Squad Synchronization Protocols for One-Dimensional Ring Cellular Automata Hiroshi Umeo, Naoki Kamikawa (Univ. of Osaka Electro-Comm.), Jean Baptiste Yun\`es (LIAFA-Univ.) (5) 11:15 - 11:45 A Simple Succinct Representation of Balanced Parentheses Sequences Kunihiko Sadakane (Kyushu U) ----- Lunch Break ( 105 min. ) ----- (6) 13:30 - 14:00 Computing the Tutte Polynomial of a Graph via BDD Revisited Hiroshi Imai (Univ. Tokyo), Keiko Imai (Chuo Univ.), Yoshitake Matsumoto, Sonoko Moriyama (Univ. Tokyo) (7) 14:00 - 14:30 Lower bounds on quantum query complexity for decision trees Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) (8) 14:30 - 15:00 Partitioning a Weighted Tree to Subtrees of Almost Uniform Size Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) ----- Break ( 15 min. ) ----- (9) 15:15 - 15:45 Size-Energy Tradeoff for Threshold Logic Circuits Computing MOD Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) (10) 15:45 - 16:15 The carving-width of even grids Masanobu Furuse, Kyohei Kozawa, Yota Otachi, Koichi Yamazaki (Gunma Univ.) (11) 16:15 - 16:45 Divide-and-Conquer Approach for Preemptive Scheduling Problems with Controllable Processing Times Natalia Shakhlevich (Univ. Leeds), Akiyoshi Shioura (Tohoku Univ.), Vitaly Strusevich (Univ. Greenwich) === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Wed, Dec 3, 2008: Gunma Univ. [Sun, Sep 21] # SECRETARY: 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:      al i  i -u Last modified: 2008-09-25 15:00:59 |
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]