|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2015)
|
|
Search Results: Keywords 'from:2015-09-01 to:2015-09-01'
|
[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 |
2015-09-01 10:00 |
Nagano |
|
Quantum interpretation of AWPP Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.) COMP2015-16 |
[more] |
COMP2015-16 pp.1-4 |
COMP |
2015-09-01 10:30 |
Nagano |
|
Impossibility of Classically Simulating One-Clean-Qubit Computation Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) COMP2015-17 |
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input... [more] |
COMP2015-17 pp.5-12 |
COMP |
2015-09-01 11:00 |
Nagano |
|
Generalization of Efficient Implementation of Compression by Substring Enumeration
-- Finite Alphabet and Explicit Phase Awareness -- Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-18 |
CSE (Compression by Substring Enumeration), a lossless universal compression scheme was introduced by Dub'e and Beaudoin... [more] |
COMP2015-18 pp.13-20 |
COMP |
2015-09-01 12:45 |
Nagano |
|
[Invited Talk]
Regular Expressions and Their applications
-- Finite Automata to Pattern Matching -- Hiroaki Yamamoto (Shinsyu Univ.) COMP2015-19 |
[more] |
COMP2015-19 pp.21-26 |
COMP |
2015-09-01 14:00 |
Nagano |
|
A Silent Anonymous Self-Stabilizing Algorithm to Construct 1-Maximal Matching under the Distributed Daemon in Trees Yuma Asada, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2015-20 |
We propose a silent self-stabilizing 1-maximal matching algorithm for anonymous trees under a distributed unfair daemon.... [more] |
COMP2015-20 pp.27-34 |
COMP |
2015-09-01 14:30 |
Nagano |
|
Enumerating and Indexing Walks Between Any Pair of Vertices Hiroshi Aoki, Norihito Yasuda, Shin-ichi Minato (Hokkaido Univ.) COMP2015-21 |
This paper presents a method for enumerating and indexing all the walks between any two points in a given graph.
It is ... [more] |
COMP2015-21 pp.35-39 |
|
|
|
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]
|