IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 12 of 12  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2023-09-07
10:00
Osaka Osaka Metropolitan Univ.
(Primary: On-site, Secondary: Online)
On a self-stabilizing distributed algorithm for st-edge-ordering problems using ear decomposition
Yoshiaki Katayama, Jin Higa, Yonghwan Kim (NITech) COMP2023-9
In this report, a self-stabilizing distributed algorithm for solving st-edge-ordering problems on any 2-edge-connected g... [more] COMP2023-9
pp.6-13
COMP 2021-12-03
14:50
Ishikawa Kanazawa Chamber of Commerce and Industry
(Primary: On-site, Secondary: Online)
On a Self-Stabilizing Algorithm for k-Flag Problem with Crash Failures
Yuta Yokoyama, Yonghwan Kim, Yoshiaki Katayama (Nitech) COMP2021-27
In developmental biology, the French Flag model is used as a cell positioning model for regeneration of defective cells.... [more] COMP2021-27
pp.30-37
COMP 2018-12-12
16:15
Miyagi Tohoku University Self-stabilizing exploration of a graph by a mobile agent
Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-39
The rotor-router is a self-stabilizing algorithm for graph exploration by a mobile agent, that is, it eventually allows,... [more] COMP2018-39
pp.47-54
SS, DC 2017-10-20
10:00
Kochi Kochi City Culture-plaza CUL-PORT Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks
Michiko Inoue, Fukuhito Ooshita (NAIST), Sebastien Tixeuil (UPMC) SS2017-31 DC2017-30
We present a new self-stabilizing 1-maximal matching algorithm that works under the distributed unfair daemon for arbitr... [more] SS2017-31 DC2017-30
pp.61-66
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, IPSJ-AL 2015-06-13
11:30
Hokkaido   On a Self-Stabilizing Algorithm for constructing a (1, 1)-Maximal Directed Acyclic Graph Using st-ordering
Haruka Ono, Yoshiaki Katayama (NIT), Toshimitsu Masuzawa (OU) COMP2015-12
We propose a new network structure (s, t)-Maximal DAG and a self-stabilizing algorithm for constructing (1, 1)-Maximal D... [more] COMP2015-12
pp.115-122
COMP 2015-03-09
16:00
Kyoto Ritsumeikan University On a 2-approximation Self-stabilizing Algorithm for the Maximum Leaf Spanning Tree
Keisuke Okamoto, Yoshiaki Katayama (NIT) COMP2014-50
The maximum leaf spanning tree (MLST) is a spanning tree that has the largest possible number of leaves among all spanni... [more] COMP2014-50
pp.53-60
DC 2014-10-27
15:20
Tokyo Kikai-Shinko-Kaikan Bldg. An Efficient Silent Self-Stabilizing Algorithm to Solve 1-Maximal Matching in Anonymous Networks
Yuma Asada, Michiko Inoue (NAIST) DC2014-23
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks with... [more] DC2014-23
pp.11-16
COMP, IPSJ-AL 2011-09-06
11:15
Hokkaido Hakodate City Central Library On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET
Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech) COMP2011-23
Geocasting is a mechanism to deliver messages of interest to all hosts within a given geographical region. GeoTORA is on... [more] COMP2011-23
pp.23-30
COMP 2008-12-03
10:05
Gunma Gunma Univ. Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks
Jun Kiniwa, Kensaku Kikuta (Univ. Hyogo) COMP2008-47
We consider a malicious adversary which generates multiple undetectable
faults by local checks.
Though the possibili... [more]
COMP2008-47
pp.7-14
COMP 2007-03-05
10:00
Tokyo The University of Electro-Communications Emulation of Ring Protocols on Trees Preserving Fault-Containment
Yukiko Yamauchi, Toshimitsu Masuzawa (Osaka Univ.), Doina Bein (Univ. of Texas)
A desired property of a distributed, self-stabilizing protocol is
to minimize the impact of faults that can corrupt th... [more]
COMP2006-52
pp.13-20
COMP 2006-09-26
14:50
Ishikawa JAIST An Efficient and Self-Stabilizing Link Formation Algorithm
Jun Kiniwa, Kensaku Kikuta (Univ. of Hyogo)
This paper proposes a self-stabilizing link formation algorithm for agent oriented
networks. The algorithm is develope... [more]
COMP2006-28
pp.23-30
 Results 1 - 12 of 12  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan