|
|
| Chair |
|
Tetsuo Asano (JAIST) |
| Vice Chair |
|
Kazuhisa Makino (Univ. of Tokyo) |
| Secretary |
|
Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.) |
|
| Conference Date |
Fri, Apr 27, 2012 10:00 - 15:55 |
| Topics |
|
| Conference Place |
Osaka Prefecture University, Nakamozu Campus, Bldg. A12, Science Hall |
| Address |
1-1 Gakuen-cho, Naka-ku, Sakai 599-8531, Japan |
| Transportation Guide |
Access ( http://www.osakafu-u.ac.jp/english/info/campusguide/access.html ) Nakamozu Campus( http://www.osakafu-u.ac.jp/english/info/campusguide/nakamozu_zoom.html ) |
Contact
Person |
Prof. Yushi UNO (Osaka Prefecture University) |
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Fri, Apr 27
10:00 - 15:55 |
| (1) |
10:00-10:35 |
Query Complexity for List Decoding  COMP2012-1 |
Akinori Kawachi (Tokyo Inst. of Tech.) |
| (2) |
10:35-11:10 |
Reconstructing Strings from Substrings with Quantum Queries COMP2012-2 |
Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.) |
| (3) |
11:10-11:45 |
Generation of Ternary Matroids and Experiments on White's Conjecture COMP2012-3 |
Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo), Sonoko Moriyama (Tohoku Univ.) |
| |
11:45-13:20 |
Lunch Break ( 95 min. ) |
| (4) |
13:20-13:55 |
Sequence Binary Decision Diagrams with Mapping Edges COMP2012-4 |
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) |
| (5) |
13:55-14:30 |
Improved algorithm for partially ordered scheduling problem using dynamic programming with a changed order COMP2012-5 |
Keigo Oka (Univ. of Tokyo) |
| |
14:30-14:45 |
Break ( 15 min. ) |
| (6) |
14:45-15:20 |
On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes COMP2012-6 |
Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) |
| (7) |
15:20-15:55 |
Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size COMP2012-7 |
Matsuo Konagaya, Tetsuo Asano (JAIST) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Takehiro ITO
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-6-05, Aoba-ku Sendai
980-8579, Japan
Email:      ecei     |
Last modified: 2012-03-22 14:51:23
|