===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Tetsuo Asano (JAIST) Vice Chair: Kazuhisa Makino (Univ. of Tokyo)
Secretary: Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.)
===============================================
Special Interest Group on Algorithms (IPSJ-AL)
Chair: Shin-ichi Nakano (Gunma Univ.)
Secretary: Ryuhei Uehara (JAIST), Katsuhisa Yamanaka (Iwate Univ.), Shuji Kijima (Kyushu Univ.)
DATE:
Mon, May 14, 2012 10:00 - 17:00
PLACE:
Center for Information Technology, Ehime University(Matsuyama City, Ehime 790-8577. Please see the following website.http://www.ehime-u.ac.jp/english/about/location/johoku.html. Prof. Yasuyuki KAWAMURA (Ehime Univ.))
TOPICS:
----------------------------------------
Mon, May 14 (10:00 - 17:00)
----------------------------------------
(1) 10:00 - 10:35
Compact Codes for L-drawings
Md. Rezaul Karim (Univ. of Dhaka), Shin-ichi Nakano (Gunma Univ.), Md. Saidur Rahman (BUET)
(2)/COMP 10:35 - 11:10
Algorithms for Uniform Deployment of Mobile Agents on Synchronous Rings
Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
(3)/COMP 11:10 - 11:45
Algorithms for partial rendezvous of mobile agents in asynchronous rings
Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ)
----- Lunch Break ( 90 min. ) -----
(4) 13:15 - 13:50
Constant Amortized Time Enumeration of Bounded-Size Subtrees in Trees
Kunihiro Wasa (Hokkaido Univ.),Takeaki Uno (NII),Hiroki
Arimura (Hokkaido Univ.)
(5) 13:50 - 14:25
Sufficient Conditions for Completely Independent Spanning Trees
Toru Araki (Gunma Univ.)
(6)/COMP 14:25 - 15:00
Dijkstra Algorithm Viewed from Discrete Convex Analysis
Kazuo Murota (Univ. of Tokyo), Akiyoshi Shioura (Tohoku Univ.)
----- Break ( 15 min. ) -----
(7)/COMP 15:15 - 15:50
On Context-free Languages That Cannot Be Recognized by Limited Backtrack Top-down Parsers
Shunichi Matsubara (Aoyama Gakuin Univ.)
(8) 15:50 - 16:25
Non-overlapping random dot pattern generation using nonlinear optimization
Takashi Imamichi, Hidetoshi Numata, Tsuyoshi Ide (IBM)
(9) 16:25 - 17:00
The Number of Different Unfoldings of Polyhedra
Takashi Horiyama, Wataru Shoji (Saitama Univ.)
# Information for speakers
General Talk will have 25 minutes for presentation and 10 minutes for discussion.
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Thu, Jun 21, 2012: Hokkaido University [Wed, Apr 11]
# SECRETARY:
Takehiro ITO
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-6-05, Aoba-ku Sendai
980-8579, Japan
Email: ecei
=== Special Interest Group on Algorithms (IPSJ-AL) ===
# SECRETARY:
Katsuhisa YAMANAKA
Faculty of Engineering,
Iwate University
Ueda 4-3-5, Morioka, Iwate
020-8551, Japan
cisi-u
Last modified: 2012-04-06 14:39:21
|
Notification: Mail addresses are partially hidden against SPAM.
|