ken-system: Advance Program

IEICE Technical Committee Submission System
Advance Program

Online Proceedings
[Sign in]
Tech. Rep. Archives

===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Keio Imai (Chuo Univ.) Vice Chair: Hiroo Ito (Univ. of Electro-Comm.)
Secretary: Jinhee Chun (Tohoku Univ.), Akitoshi Kawamura (Univ. of Tokyo)

DATE:
Thu, Jun 21, 2012 09:30 - 17:35

PLACE:
Hokkaido University, School of Engineering, Academic Lounge 3 [Bldg. B3 2F](Kita 13, Nishi 8, Kita-ku, Sapporo, Hokkaido. Please see the following website.http://www.eng.hokudai.ac.jp/english/location/. Prof. Shin-ichi Minato)

TOPICS:

----------------------------------------
Thu, Jun 21 AM (09:30 - 17:35)
----------------------------------------

(1) 09:30 - 09:55
Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems
Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.)

(2) 09:55 - 10:20
Rich Operations for Manipulating Sequence Binary Decision Diagrams
Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato (Hokkaido Univ.)

(3) 10:20 - 10:45
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ)

----- Break ( 15 min. ) -----

(4) 11:00 - 11:25
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII)

(5) 11:25 - 11:50
Recursive and non recursive formulas in finitism
Eiichi Tanaka (Kobe Univ.)

----- Lunch Break ( 90 min. ) -----

(6) 13:20 - 13:45
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
Kazuhisa Seto, Suguru Tamaki (Kyoto Univ.)

(7) 13:45 - 14:10
Candidate Boolean Functions towards Super-Quadratic Formula Size
Kenya Ueno (Kyoto Univ.)

(8) 14:10 - 14:35
Complexity results of distance-d independent set problems
Hiroshi Eto, Fengrui Guo, Eiji Miyano (Kyutech)

----- Break ( 15 min. ) -----

(9) 14:50 - 15:15
An Algorithm for the Next-to-Shortest Path in Undirected Planar Graphs
Cong Zhang, Hiroshi Nagamochi (Kyoto Univ.)

(10) 15:15 - 15:40
Efficient Atomic Block for Faster Elliptic Curve Scalar Multiplication
Chitchanok Chuengsatiansup (Univ. of Tokyo)

(11) 15:40 - 16:05
Optimal Average Joint Hamming Weight for Asymmetric Representation
Vorapong Suppakitpaisarn (Univ. of Tokyo), Masato Edahiro (Nagoya Univ.), Hiroshi Imai (Univ. of Tokyo)

----- Break ( 15 min. ) -----

(12) 16:20 - 16:45
A method for computing a sequence of circumscribing polygons
Kensuke Onishi (Tokai Univ.), Mamoru Hoshi (UEC)

(13) 16:45 - 17:10
Approximation for the Geometric Unique Coverage Problem on Unit Squares
Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.)

(14) 17:10 - 17:35
Notes on weighted Delaunay triangulations and discrete Ricci flow
-- Relation between weighted Delaunay triangulations and circle packing metrics --
Toshihiro Tanuma, Hiroshi Imai (Univ. of Tokyo)

# Information for speakers
General Talk will have 20 minutes for presentation and 5 minutes for discussion.

=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:

Mon, Sep 3, 2012: Hosei University [Wed, Jul 4]

# SECRETARY:
Jinhee Chun
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-3-09, Aoba-ku Sendai
980-8579, Japan
Email: