===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Masafumi Yamashita Vice Chair: Tatsuya Akutsu
Secretary: Kunihiko Sadakane, Keisuke Tanaka
DATE:
Tue, Oct 18, 2005 09:00 - 17:05
Wed, Oct 19, 2005 09:00 - 12:10
PLACE:
Tohoku University(Aramaki aza Aoba 09, Aoba-ku Sendai-city Miyagi-pref. 980-8579, Japan. http://www.eng.tohoku.ac.jp/php/eng/access.php. Prof. Eiji Takimoto. 022-217-7148)
TOPICS:
----------------------------------------
Tue, Oct 18 (09:00 - 10:25)
----------------------------------------
(1) 09:00 - 09:35
Queue layout of bipartite graph subdivisions
Miki Miyauchi (NTT)
(2) 09:35 - 10:10
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
Xiao Zhou, Takao Nishizeki (Touhoku Univ.)
----- Break ( 15 min. ) -----
----------------------------------------
Tue, Oct 18 (10:25 - 13:15)
----------------------------------------
(3) 10:25 - 11:00
An asynchronous cellular space in which synchronous reversible cellular automata can be embedded
Jin-Shan Qi, Kenichi Morita (Hiroshima Univ.)
(4) 11:00 - 11:35
Margin Preserving Projection with Limited Randomness and Embedding to Boolean Space
Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka (Tohoku Univ.)
----- Lunch Break, Steering Committee ( 100 min. ) -----
----------------------------------------
Tue, Oct 18 (13:15 - 14:30)
----------------------------------------
(5) 13:15 - 14:15
[Tutorial Lecture]
An approach for obtaining the lower bounds on circuit complexity with mathematical programming
Kazuyuki Amano (Tohoku Univ.)
----- Break ( 15 min. ) -----
----------------------------------------
Tue, Oct 18 (14:30 - 15:55)
----------------------------------------
(6) 14:30 - 15:05
Hamiltonian laceability of bubble-sort graphs with edge faults
Toru Araki (Iwate Univ.), Yosuke Kikuchi (JST)
(7) 15:05 - 15:40
Compressing Compressed Data Structures
Kunihiko Sadakane (Kyushu Univ.), Roberto Grossi (Pisa Univ.)
----- Break ( 15 min. ) -----
----------------------------------------
Tue, Oct 18 (15:55 - 17:05)
----------------------------------------
(8) 15:55 - 16:30
Convex Drawings of Plane Graphs of Minimum Outer Apices
Kazuyuki Miura (Fukushima Univ.), Machiko Azuma, Takao Nishizeki (Tohoku Univ.)
(9) 16:30 - 17:05
On the Graph Orientation of Minimizing the Maximum Outdegree
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.), Kouhei Zenmyo (Kyushu Inst. of Tech.)
----------------------------------------
Wed, Oct 19 (09:00 - 11:00)
----------------------------------------
(10) 09:00 - 09:35
A quantum protocol to win the graph colouring game on all Hadamard graphs
David Avis (McGill Univ.), Jun Hasegawa (Univ. of Tokyo/JST), Yosuke Kikuchi (JST), Yuuya Sasaki (Univ. of Tokyo)
(11) 09:35 - 10:10
Automated Competitive Analysis of Online Problems
Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.)
(12) 10:10 - 10:45
An Approximate Algorithum for Pricing European-Asian Options
Takehisa Sekino, Akiyoshi Shioura, Takeshi Tokuyama (Tohoku Univ.)
----- Break ( 15 min. ) -----
----------------------------------------
Wed, Oct 19 (11:00 - 12:10)
----------------------------------------
(13) 11:00 - 11:35
Monotone DNFs that Minimize/Maximize the Number of Satisfying Assignments
Kazuyuki Amano (Tohoku Univ.), Takayuki Sato (Sendai Nat. Col. Tech.), Akira Maruoka (Tohoku Univ.)
(14) 11:35 - 12:10
Some sufficient conditions to solve the learning problem of simple deterministic languages from queries and counterexamples
Yasuhiro Tajima, Yoshiyuki Kotani (Tokyo Univ. of Agri and Tech.), Etsuji Tomita (Univ. of Electro-Comm.)
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Thu, Dec 22, 2005: The University of Tokushima [Mon, Oct 24]
Last modified: 2005-08-29 09:45:52
|
Notification: Mail addresses are partially hidden against SPAM.
|