|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2006)
|
|
Search Results: Keywords 'from:2006-06-23 to:2006-06-23'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2006-06-23 10:00 |
Saitama |
Saitama Univ. |
Track layout of bipartite graph subdivisions Miki Miyauchi (NTT) |
This paper studies the problem of track layout of bipartite graph subdivisions. Recently Dujmovic and Wood showed that e... [more] |
COMP2006-17 pp.1-5 |
COMP |
2006-06-23 10:35 |
Saitama |
Saitama Univ. |
On the Computational Complexity of Interview Timetabling Problems Yuuki Kiyonari, Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.) |
[more] |
COMP2006-18 pp.7-14 |
COMP |
2006-06-23 11:10 |
Saitama |
Saitama Univ. |
Reductions for Monotone Boolean Circuits Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.) |
The large class, say {\it NLOG}, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of $O(n\log... [more] |
COMP2006-19 pp.15-19 |
COMP |
2006-06-23 13:00 |
Saitama |
Saitama Univ. |
Relationships between Data-Privacy and Key-Privacy Ryotaro Hayashi, Keisuke Tanaka (Tokyo Inst. of Tech.) |
The classical security requirement
of public-key encryption schemes is
that it provides privacy
of the encrypted data... [more] |
COMP2006-20 pp.21-27 |
COMP |
2006-06-23 13:35 |
Saitama |
Saitama Univ. |
Polynomial-Time Algorithm for Finding a Solution in the Core of a Multicommodity Flow Game Kazuhiro Karasawa, Toshinori Yamada (Saitama Univ.) |
[more] |
COMP2006-21 pp.29-34 |
COMP |
2006-06-23 14:25 |
Saitama |
Saitama Univ. |
Improvement of repeat search using factor oracles Hisashi Iwasaki (Tokyo Inst. of Tech.) |
We provide a linear time and space algorithm a repeated suffix for each prefix of a given string $p$. Our algorithm is i... [more] |
COMP2006-22 pp.35-42 |
COMP |
2006-06-23 15:00 |
Saitama |
Saitama Univ. |
Simple Rank/Select Dictionaries Kunihiko Sadakane (Kyushu U) |
Rank/Select directories are data structures to compute,for an ordered set S ⊂{0 , 1 ,...,m −1 },
rank x, S = |{y ... [more] |
COMP2006-23 pp.43-48 |
COMP |
2006-06-23 15:35 |
Saitama |
Saitama Univ. |
Notes on Voronoi Diagrams for Pure Quantum States Kimikazu Kato (Nihon Unisys/Univ. of Tokyo), Mayumi Oto (Toshiba), Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |
We give a new geometric interpretation of quantum pure states. We reinterpret the structure of the space of pure states ... [more] |
COMP2006-24 pp.49-55 |
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|