On the Time Complexity of Dijkstra's Three-State Mutual Exclusion Algorithm

Kimoto, Masahiro; Tsuchiya, Tatsuhiro; Kikuno, Tohru

IEICE transactions on information and systems, 2009, E92-D(8), 1570-1573

Number of Access:346（2025-09-03 07:54 Counts）

Identifier to cite or link to this item: https://hdl.handle.net/11094/27264

Link to primary information 

File Format Terms of use Size Views Date.Available Description information
IEICE_E92-D_8_1570 pdf None 78.0 KB 252 2014.04.03  

Item Information

Output File Export EndNote Basic Export Mendeley

Title
On the Time Complexity of Dijkstra's Three-State Mutual Exclusion Algorithm
Creator
CreatorName
Kimoto, Masahiro
NRID
1000030283740 1000030283740
ORCID
0000-0002-3329-9235 0000-0002-3329-9235
researchmap permalink
tatsuhirotsuchiya72 tatsuhirotsuchiya72
Scopus Author ID
7403030658 7403030658
CreatorName
Tsuchiya, Tatsuhiro
NRID
1000050093745 1000050093745
CreatorName
Kikuno, Tohru
Subject
analysis of algorithms
distributed computing
self-stabilization
stabilization time
Publisher
電子情報通信学会
The Institute of Electronics, Information and Communication Engineers
デンシ　ジョウホウ　ツウシン　ガッカイ
Source Title
IEICE transactions on information and systems
Volume (Issue)
E92-D(8)
Page
1570-1573
Date of Issued
2009-08-01
Language
English
Handle URL
https://hdl.handle.net/11094/27264
PISSN
09168532
NCID
AA10826272
Relation.references
URI
http://search.ieice.org/
Relation.isIdenticalTo
DOI (Publisher Version)
https://doi.org/10.1587/transinf.E92.D.1570
Access Rights
open access
CopyRight
Copyright © 2009 The Institute of Electronics, Information and Communication Engineers
oaire:version
Version of Record
Category
学術雑誌論文 Journal Article