| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2009)
Search Results: Keywords 'from:2009-04-17 to:2009-04-17'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2009-04-17 09:45 |
Kyoto | Kyoto Univ. | On the Complexity of Optimal Allocation of Indivisible Goods with Second-Order Utility Functions Akiyoshi Shioura, Takuji Yoshida (Tohoku Univ.)  COMP2009-1 |
In this paper, we consider an allocation problem of goods which arises from the combinatorial auction of indivisible goo... [more] | COMP2009-1 pp.1-6 |
| COMP | 2009-04-17 10:20 |
Kyoto | Kyoto Univ. | Algorithms for submodular systems Partition Problem Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.) COMP2009-2 |
A submodular system $(V,f)$ is a pair of a finite set $V$ and a submodular function $f$ on $V$. The $k$-partition prob... [more] |
COMP2009-2 pp.7-14 |
| COMP | 2009-04-17 10:55 |
Kyoto | Kyoto Univ. | Pathwidth of 3-dimensional grids Ryohei Suda, Yota Otachi, Koichi Yamazaki (Gunma Univ.) COMP2009-3 |
The notion of pathwidth of graphs has been introduced by Robertson and Seymour.Pathwidth, which has relations to bandwid... [more] | COMP2009-3 pp.15-19 |
| COMP | 2009-04-17 13:30 |
Kyoto | Kyoto Univ. | Energy Complexity and Depth of Threshold Circuits Kei Uchizawa, Takao Nishizeki (Tohoku Univ.) COMP2009-4 |
Suppose that a Boolean function $f$ can be computed by a threshold circuit $C$ of energy complexity $e$. Thus, at most... [more] |
COMP2009-4 pp.21-28 |
| COMP | 2009-04-17 14:05 |
Kyoto | Kyoto Univ. | An Improved Algorithm for Inserting a Highway in a City Metric Based on Qua-siconvex Optimization Matias Korman, Takeshi Tokuyama (Tohoku Univ.) COMP2009-5 |
We introduce an improved algorithm to locate a segment highway such that the maximum city distance between a given set o... [more] | COMP2009-5 pp.29-35 |
| COMP | 2009-04-17 14:40 |
Kyoto | Kyoto Univ. | Dynamic Succinct Ordinal Trees Kunihiko Sadakane (Kyushu Univ.) COMP2009-6 |
This paper proposes succinct data structures for dynamic ordinal trees. Succinct data structures are the ones whose siz... [more] |
COMP2009-6 pp.37-41 |
| COMP | 2009-04-17 15:30 |
Kyoto | Kyoto Univ. | Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function Takeshi Koshiba, Takanori Odaira (Saitama Univ.) COMP2009-7 |
[more] | COMP2009-7 pp.43-49 |
| COMP | 2009-04-17 16:05 |
Kyoto | Kyoto Univ. | General Scheme for Perfect Quantum Network Coding with Free Classical Communication Hirotada Kobayashi (NII/ERATO-SORST), Francois Le Gall (JST), Harumichi Nishimura (Osaka Pref. Univ.), Martin Roetteler (NEC Lab. America) COMP2009-8 |
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for som... [more] | COMP2009-8 pp.51-58 |
[Return to Top Page]