|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2016)
|
|
Search Results: Keywords 'from:2016-10-21 to:2016-10-21'
|
[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 |
2016-10-21 10:00 |
Miyagi |
Tohoku University |
Random Popular Matchings with Incomplete Preference Lists Suthee Ruangwises, Toshiya Itoh (Tokyo Tech.) COMP2016-23 |
[more] |
COMP2016-23 pp.1-8 |
COMP |
2016-10-21 10:30 |
Miyagi |
Tohoku University |
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems Francois Le Gall (Kyoto Univ.) COMP2016-24 |
Censor-Hillel et al.~[PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix ... [more] |
COMP2016-24 pp.9-15 |
COMP |
2016-10-21 11:00 |
Miyagi |
Tohoku University |
A faster parameterized algorithm for Pseudoforest Deletion Hans Bodlaender (Utrecht Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST) COMP2016-25 |
[more] |
COMP2016-25 pp.17-21 |
COMP |
2016-10-21 13:30 |
Miyagi |
Tohoku University |
Physical Bucket Sort with Two Kinds of Items Atsuki Nagao, Shuhei Yoshizawa, Hiro Ito (UEC) COMP2016-26 |
Bucket sort is one of the most famous sorting algorithms, and it runs in time $O(k+n)$, where $k$ is the number of bucke... [more] |
COMP2016-26 pp.23-27 |
COMP |
2016-10-21 14:00 |
Miyagi |
Tohoku University |
An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits. Kazuhisa Seto (Seikei Univ.), Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (NII) COMP2016-27 |
A Boolean function $f: bits{n} to bit$ is {em weighted symmetric}
if there exist a function $g: mathbb{Z} to bit$ and i... [more] |
COMP2016-27 pp.29-34 |
COMP |
2016-10-21 14:30 |
Miyagi |
Tohoku University |
On lower bounds for the complexity of the Frobenius problem and its subproblems Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-28 |
In this paper, we lower bounds for the time complexity of the Frobenius problem. Given a set $A$ of coprime positive in... [more] |
COMP2016-28 pp.35-37 |
COMP |
2016-10-21 15:20 |
Miyagi |
Tohoku University |
A Research of the Number of the Convex Configurations of Silhouette Puzzles Hitoshi Iwai, Jungo Shibuya, Ryuhei Uehara (JAIST) COMP2016-29 |
(To be available after the conference date) [more] |
COMP2016-29 pp.39-45 |
COMP |
2016-10-21 15:50 |
Miyagi |
Tohoku University |
On label size maximization for rotating maps Yusuke Yokosuka, Keiko Imai (Chuo Univ.) COMP2016-30 |
[more] |
COMP2016-30 pp.47-52 |
|
|
|
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)
|
[Return to Top Page]
[Return to IEICE Web Page]
|