iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/73/183.rss
dblp: Fukuhito Ooshita https://dblp.org/pid/73/183.html dblp person page RSS feed Mon, 02 Dec 2024 21:31:13 +0100 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Fukuhito Ooshitahttps://dblp.org/pid/73/183.html14451 Neighborhood mutual remainder: self-stabilizing distributed implementation and applications.https://doi.org/10.1007/s00236-023-00450-8, , , , :
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications. Acta Informatica 61(1): 83-100 ()]]>https://dblp.org/rec/journals/acta/DolevKKOW24Fri, 01 Mar 2024 00:00:00 +0100 Fast gathering despite a linear number of weakly Byzantine agents†.https://doi.org/10.1002/cpe.8055, , , :
Fast gathering despite a linear number of weakly Byzantine agents†. Concurr. Comput. Pract. Exp. 36(14) ()]]>https://dblp.org/rec/journals/concurrency/HiroseNOI24Sat, 01 Jun 2024 01:00:00 +0200 A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model.https://doi.org/10.1002/cpe.8281, , , :
A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model. Concurr. Comput. Pract. Exp. 36(26) ()]]>https://dblp.org/rec/journals/concurrency/KakugawaKSO24Fri, 01 Nov 2024 00:00:00 +0100 Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots.https://doi.org/10.1007/978-3-031-57853-3_10, , , , , , :
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. AINA (2) : 110-121]]>https://dblp.org/rec/conf/aina/BramasKKLOST24Mon, 01 Jan 2024 00:00:00 +0100 Gathering in Carrier Graphs: Meeting via Public Transportation System.https://doi.org/10.4230/LIPIcs.SAND.2024.21, , , :
Gathering in Carrier Graphs: Meeting via Public Transportation System. SAND : 21:1-21:17]]>https://dblp.org/rec/conf/sand/ZhengEOI24Mon, 01 Jan 2024 00:00:00 +0100 Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent.https://doi.org/10.4230/LIPIcs.DISC.2024.55, , :
Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent. DISC : 55:1-55:7]]>https://dblp.org/rec/conf/wdag/SudoOK24Mon, 01 Jan 2024 00:00:00 +0100 Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots.https://doi.org/10.1002/cpe.6123, , , , :
Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots. Concurr. Comput. Pract. Exp. 35(11) ()]]>https://dblp.org/rec/journals/concurrency/AshkenaziDKOW23Sun, 01 Jan 2023 00:00:00 +0100 Eventually consistent distributed ledger despite degraded atomic broadcast.https://doi.org/10.1002/cpe.6199, , :
Eventually consistent distributed ledger despite degraded atomic broadcast. Concurr. Comput. Pract. Exp. 35(11) ()]]>https://dblp.org/rec/journals/concurrency/BenassyOI23Sun, 01 Jan 2023 00:00:00 +0100 Ring exploration of myopic luminous robots with visibility more than one.https://doi.org/10.1016/j.ic.2023.105036, , :
Ring exploration of myopic luminous robots with visibility more than one. Inf. Comput. 292: 105036 ()]]>https://dblp.org/rec/journals/iandc/NagahamaOI23Thu, 01 Jun 2023 01:00:00 +0200 Location functions for self-stabilizing byzantine tolerant swarms.https://doi.org/10.1016/j.tcs.2023.113755, , , , , :
Location functions for self-stabilizing byzantine tolerant swarms. Theor. Comput. Sci. 954: 113755 ()]]>https://dblp.org/rec/journals/tcs/AshkenaziDKKOW23Sun, 01 Jan 2023 00:00:00 +0100 A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model.https://doi.org/10.1109/CANDARW60564.2023.00025, , , :
A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model. CANDARW : 100-106]]>https://dblp.org/rec/conf/candar/KakugawaKSO23Sun, 01 Jan 2023 00:00:00 +0100 A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States.https://doi.org/10.1145/3583668.3594586, , , :
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. PODC : 2-12]]>https://dblp.org/rec/conf/podc/YokotaSOM23Sun, 01 Jan 2023 00:00:00 +0100 Meeting Times of Non-atomic Random Walks.https://doi.org/10.1007/978-3-031-44274-2_22, , , :
Meeting Times of Non-atomic Random Walks. SSS : 297-311]]>https://dblp.org/rec/conf/sss/EguchiOIT23Sun, 01 Jan 2023 00:00:00 +0100 A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States.https://doi.org/10.48550/arXiv.2305.08375, , , :
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. CoRR abs/2305.08375 ()]]>https://dblp.org/rec/journals/corr/abs-2305-08375Sun, 01 Jan 2023 00:00:00 +0100 Meeting Times of Non-atomic Random Walks.https://doi.org/10.48550/arXiv.2305.11590, , , :
Meeting Times of Non-atomic Random Walks. CoRR abs/2305.11590 ()]]>https://dblp.org/rec/journals/corr/abs-2305-11590Sun, 01 Jan 2023 00:00:00 +0100 Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots.https://doi.org/10.48550/arXiv.2312.12698, , , , , , :
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. CoRR abs/2312.12698 ()]]>https://dblp.org/rec/journals/corr/abs-2312-12698Sun, 01 Jan 2023 00:00:00 +0100 Ring exploration with myopic luminous robots.https://doi.org/10.1016/j.ic.2021.104702, :
Ring exploration with myopic luminous robots. Inf. Comput. 285(Part): 104702 ()]]>https://dblp.org/rec/journals/iandc/OoshitaT22Sat, 01 Jan 2022 00:00:00 +0100 Weakly Byzantine Gathering with a Strong Team.https://doi.org/10.1587/transinf.2021fcp0011, , , :
Weakly Byzantine Gathering with a Strong Team. IEICE Trans. Inf. Syst. 105-D(3): 541-555 ()]]>https://dblp.org/rec/journals/ieicetd/HiroseNOI22Sat, 01 Jan 2022 00:00:00 +0100 Terminating Grid Exploration with Myopic Luminous Robots.http://www.ijnc.org/index.php/ijnc/article/view/273, , :
Terminating Grid Exploration with Myopic Luminous Robots. Int. J. Netw. Comput. 12(1): 73-102 ()]]>https://dblp.org/rec/journals/ijnc/NagahamaOI22Sat, 01 Jan 2022 00:00:00 +0100 Gathering despite a linear number of weakly Byzantine agents.https://doi.org/10.1109/CANDARW57323.2022.00067, , , :
Gathering despite a linear number of weakly Byzantine agents. CANDARW : 161-167]]>https://dblp.org/rec/conf/ic-nc/HiroseNOI22Sat, 01 Jan 2022 00:00:00 +0100 Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents.https://doi.org/10.1145/3519270.3538470, , , :
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents. PODC : 375-377]]>https://dblp.org/rec/conf/podc/Hirose0OI22Sat, 01 Jan 2022 00:00:00 +0100 Gathering despite a linear number of weakly Byzantine agents.https://doi.org/10.48550/arXiv.2205.14937, , , :
Gathering despite a linear number of weakly Byzantine agents. CoRR abs/2205.14937 ()]]>https://dblp.org/rec/journals/corr/abs-2205-14937Sat, 01 Jan 2022 00:00:00 +0100 Exploration of dynamic tori by multiple agents.https://doi.org/10.1016/j.tcs.2020.11.004, , , , :
Exploration of dynamic tori by multiple agents. Theor. Comput. Sci. 850: 202-220 ()]]>https://dblp.org/rec/journals/tcs/GotohSOKM21Fri, 01 Jan 2021 00:00:00 +0100 Uniform bipartition in the population protocol model with arbitrary graphs.https://doi.org/10.1016/j.tcs.2021.09.020, , , :
Uniform bipartition in the population protocol model with arbitrary graphs. Theor. Comput. Sci. 892: 187-207 ()]]>https://dblp.org/rec/journals/tcs/YasumiOIT21Fri, 01 Jan 2021 00:00:00 +0100 Gathering with a strong team in weakly Byzantine environments.https://doi.org/10.1145/3427796.3427799, , , :
Gathering with a strong team in weakly Byzantine environments. ICDCN : 26-35]]>https://dblp.org/rec/conf/icdcn/Hirose0OI21Fri, 01 Jan 2021 00:00:00 +0100 Terminating Grid Exploration with Myopic Luminous Robots.https://doi.org/10.1109/IPDPSW52791.2021.00092, , :
Terminating Grid Exploration with Myopic Luminous Robots. IPDPS Workshops : 586-595]]>https://dblp.org/rec/conf/ipps/NagahamaOI21Fri, 01 Jan 2021 00:00:00 +0100 Asynchronous Gathering in a Torus.https://doi.org/10.4230/LIPIcs.OPODIS.2021.9, , , , :
Asynchronous Gathering in a Torus. OPODIS : 9:1-9:17]]>https://dblp.org/rec/conf/opodis/KameiLOTW21Fri, 01 Jan 2021 00:00:00 +0100 Population Protocols for Graph Class Identification Problems.https://doi.org/10.4230/LIPIcs.OPODIS.2021.13, , :
Population Protocols for Graph Class Identification Problems. OPODIS : 13:1-13:19]]>https://dblp.org/rec/conf/opodis/YasumiOI21Fri, 01 Jan 2021 00:00:00 +0100 Location Functions for Self-stabilizing Byzantine Tolerant Swarms.https://doi.org/10.1007/978-3-030-91081-5_15, , , , , :
Location Functions for Self-stabilizing Byzantine Tolerant Swarms. SSS : 229-242]]>https://dblp.org/rec/conf/sss/AshkenaziDKKOW21Fri, 01 Jan 2021 00:00:00 +0100 Asynchronous Gathering in a Torus.https://arxiv.org/abs/2101.05421, , , , :
Asynchronous Gathering in a Torus. CoRR abs/2101.05421 ()]]>https://dblp.org/rec/journals/corr/abs-2101-05421Fri, 01 Jan 2021 00:00:00 +0100 Terminating grid exploration with myopic luminous robots.https://arxiv.org/abs/2102.06006, , :
Terminating grid exploration with myopic luminous robots. CoRR abs/2102.06006 ()]]>https://dblp.org/rec/journals/corr/abs-2102-06006Fri, 01 Jan 2021 00:00:00 +0100 Population Protocols for Graph Class Identification Problems.https://arxiv.org/abs/2111.05111, , :
Population Protocols for Graph Class Identification Problems. CoRR abs/2111.05111 ()]]>https://dblp.org/rec/journals/corr/abs-2111-05111Fri, 01 Jan 2021 00:00:00 +0100 Dynamic Ring Exploration with (H, S) View.https://doi.org/10.3390/a13060141, , , :
Dynamic Ring Exploration with (H, S) View. Algorithms 13(6): 141 ()]]>https://dblp.org/rec/journals/algorithms/GotohSOM20Wed, 01 Jan 2020 00:00:00 +0100 Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers.http://search.ieice.org/bin/summary.php?id=e103-d_3_489, , , :
Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers. IEICE Trans. Inf. Syst. 103-D(3): 489-499 ()]]>https://dblp.org/rec/journals/ieicet/SudoOKM20Wed, 01 Jan 2020 00:00:00 +0100 Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards.https://doi.org/10.1587/transinf.2019EDP7311, , :
Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards. IEICE Trans. Inf. Syst. 103-D(7): 1672-1682 ()]]>https://dblp.org/rec/journals/ieicetd/TsuchidaOI20Wed, 01 Jan 2020 00:00:00 +0100 Foreword.https://doi.org/10.1587/transinf.2020PAF0001:
Foreword. IEICE Trans. Inf. Syst. 103-D(12): 2411 ()]]>https://dblp.org/rec/journals/ieicetd/Ooshita20Wed, 01 Jan 2020 00:00:00 +0100 Loosely-stabilizing leader election with polylogarithmic convergence time.https://doi.org/10.1016/j.tcs.2019.09.034, , , , , :
Loosely-stabilizing leader election with polylogarithmic convergence time. Theor. Comput. Sci. 806: 617-631 ()]]>https://dblp.org/rec/journals/tcs/SudoOKMDL20Wed, 01 Jan 2020 00:00:00 +0100 Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings.https://doi.org/10.1016/j.tcs.2020.04.002, , , , , :
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings. Theor. Comput. Sci. 822: 92-109 ()]]>https://dblp.org/rec/journals/tcs/ShibataKSOKM20Wed, 01 Jan 2020 00:00:00 +0100 Time-Optimal Leader Election in Population Protocols.https://doi.org/10.1109/TPDS.2020.2991771, , , , :
Time-Optimal Leader Election in Population Protocols. IEEE Trans. Parallel Distributed Syst. 31(11): 2620-2632 ()]]>https://dblp.org/rec/journals/tpds/SudoOIKM20Wed, 01 Jan 2020 00:00:00 +0100 Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs.https://doi.org/10.4230/LIPIcs.OPODIS.2020.33, , , :
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. OPODIS : 33:1-33:16]]>https://dblp.org/rec/conf/opodis/YasumiOIT20Wed, 01 Jan 2020 00:00:00 +0100 Gathering with a strong team in weakly Byzantine environments.https://arxiv.org/abs/2007.08217, , , :
Gathering with a strong team in weakly Byzantine environments. CoRR abs/2007.08217 ()]]>https://dblp.org/rec/journals/corr/abs-2007-08217Wed, 01 Jan 2020 00:00:00 +0100 Self-stabilizing Graph Exploration by a Single Agent.https://arxiv.org/abs/2010.08929, , :
Self-stabilizing Graph Exploration by a Single Agent. CoRR abs/2010.08929 ()]]>https://dblp.org/rec/journals/corr/abs-2010-08929Wed, 01 Jan 2020 00:00:00 +0100 Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs.https://arxiv.org/abs/2011.08366, , , :
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. CoRR abs/2011.08366 ()]]>https://dblp.org/rec/journals/corr/abs-2011-08366Wed, 01 Jan 2020 00:00:00 +0100 Partial Gathering of Mobile Agents in Arbitrary Networks.https://doi.org/10.1587/transinf.2018FCP0008, , , , :
Partial Gathering of Mobile Agents in Arbitrary Networks. IEICE Trans. Inf. Syst. 102-D(3): 444-453 ()]]>https://dblp.org/rec/journals/ieicet/ShibataNOKM19Tue, 01 Jan 2019 00:00:00 +0100 Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness.https://doi.org/10.1587/transinf.2018FCP0009, , , :
Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness. IEICE Trans. Inf. Syst. 102-D(3): 454-463 ()]]>https://dblp.org/rec/journals/ieicet/YasumiOYI19Tue, 01 Jan 2019 00:00:00 +0100 A Population Protocol for Uniform $k$-partition under Global Fairness.http://www.ijnc.org/index.php/ijnc/article/view/198, , , , :
A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. 9(1): 97-110 ()]]>https://dblp.org/rec/journals/ijnc/YasumiKOII19Tue, 01 Jan 2019 00:00:00 +0100 Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model.https://doi.org/10.1109/TPDS.2018.2881125, , , , , :
Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model. IEEE Trans. Parallel Distributed Syst. 30(6): 1359-1373 ()]]>https://dblp.org/rec/journals/tpds/SudoOKMDL19Tue, 01 Jan 2019 00:00:00 +0100 Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots.https://doi.org/10.1109/CANDARW.2019.00041, , , , :
Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots. CANDAR Workshops : 188-194]]>https://dblp.org/rec/conf/ic-nc/AshkenaziDKOW19Tue, 01 Jan 2019 00:00:00 +0100 Eventually Consistent Distributed Ledger Relying on Degraded Atomic Broadcast.https://doi.org/10.1109/CANDARW.2019.00042, , :
Eventually Consistent Distributed Ledger Relying on Degraded Atomic Broadcast. CANDAR Workshops : 195-200]]>https://dblp.org/rec/conf/ic-nc/BenassyOI19Tue, 01 Jan 2019 00:00:00 +0100 Uniform Partition in Population Protocol Model Under Weak Fairness.https://doi.org/10.4230/LIPIcs.OPODIS.2019.8, , :
Uniform Partition in Population Protocol Model Under Weak Fairness. OPODIS : 8:1-8:16]]>https://dblp.org/rec/conf/opodis/YasumiOI19Tue, 01 Jan 2019 00:00:00 +0100 Gathering on Rings for Myopic Asynchronous Robots With Lights.https://doi.org/10.4230/LIPIcs.OPODIS.2019.27, , , , :
Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS : 27:1-27:17]]>https://dblp.org/rec/conf/opodis/KameiLOTW19Tue, 01 Jan 2019 00:00:00 +0100 Logarithmic Expected-Time Leader Election in Population Protocol Model.https://doi.org/10.1145/3293611.3331585, , , , :
Logarithmic Expected-Time Leader Election in Population Protocol Model. PODC : 60-62]]>https://dblp.org/rec/conf/podc/SudoOIKM19Tue, 01 Jan 2019 00:00:00 +0100 Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings.https://doi.org/10.1007/978-3-030-24922-9_19, , , , , :
Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings. SIROCCO : 277-292]]>https://dblp.org/rec/conf/sirocco/ShibataKSOKM19Tue, 01 Jan 2019 00:00:00 +0100 Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots.https://doi.org/10.1007/978-3-030-34992-9_2, , , , :
Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots. SSS : 16-21]]>https://dblp.org/rec/conf/sss/AshkenaziDKOW19Tue, 01 Jan 2019 00:00:00 +0100 Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder.https://doi.org/10.1007/978-3-030-34992-9_11, , , , :
Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder. SSS : 127-132]]>https://dblp.org/rec/conf/sss/DolevKKOW19Tue, 01 Jan 2019 00:00:00 +0100 Exploration of Dynamic Ring Networks by a Single Agent with the H-hops and S-time Steps View.https://doi.org/10.1007/978-3-030-34992-9_14, , , :
Exploration of Dynamic Ring Networks by a Single Agent with the H-hops and S-time Steps View. SSS : 165-177]]>https://dblp.org/rec/conf/sss/GotohSOM19Tue, 01 Jan 2019 00:00:00 +0100 Ring Exploration of Myopic Luminous Robots with Visibility More Than One.https://doi.org/10.1007/978-3-030-34992-9_20, , :
Ring Exploration of Myopic Luminous Robots with Visibility More Than One. SSS : 256-271]]>https://dblp.org/rec/conf/sss/NagahamaOI19Tue, 01 Jan 2019 00:00:00 +0100 Logarithmic Expected-Time Leader Election in Population Protocol Model.https://doi.org/10.1007/978-3-030-34992-9_26, , , , :
Logarithmic Expected-Time Leader Election in Population Protocol Model. SSS : 323-337]]>https://dblp.org/rec/conf/sss/SudoOIKM19Tue, 01 Jan 2019 00:00:00 +0100 Black Hole Search Despite Byzantine Agents.https://doi.org/10.1007/978-3-030-34992-9_28, , :
Black Hole Search Despite Byzantine Agents. SSS : 354-367]]>https://dblp.org/rec/conf/sss/TsuchidaOI19Tue, 01 Jan 2019 00:00:00 +0100 Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots.https://doi.org/10.4230/LIPIcs.DISC.2019.43, , , , :
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DISC : 43:1-43:3]]>https://dblp.org/rec/conf/wdag/DolevKKOW19Tue, 01 Jan 2019 00:00:00 +0100 Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract).http://arxiv.org/abs/1903.02843, , , , :
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract). CoRR abs/1903.02843 ()]]>https://dblp.org/rec/journals/corr/abs-1903-02843Tue, 01 Jan 2019 00:00:00 +0100 Uniform Partition in Population Protocol Model under Weak Fairness.http://arxiv.org/abs/1911.04678, , :
Uniform Partition in Population Protocol Model under Weak Fairness. CoRR abs/1911.04678 ()]]>https://dblp.org/rec/journals/corr/abs-1911-04678Tue, 01 Jan 2019 00:00:00 +0100 Gathering on Rings for Myopic Asynchronous Robots with Lights.http://arxiv.org/abs/1911.04757, , , , :
Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR abs/1911.04757 ()]]>https://dblp.org/rec/journals/corr/abs-1911-04757Tue, 01 Jan 2019 00:00:00 +0100 Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards.https://doi.org/10.1587/transinf.2017FCP0008, , :
Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Trans. Inf. Syst. 101-D(3): 602-610 ()]]>https://dblp.org/rec/journals/ieicet/TsuchidaOI18Mon, 01 Jan 2018 00:00:00 +0100 Uniform deployment of mobile agents in asynchronous rings.https://doi.org/10.1016/j.jpdc.2018.03.008, , , , :
Uniform deployment of mobile agents in asynchronous rings. J. Parallel Distributed Comput. 119: 92-106 ()]]>https://dblp.org/rec/journals/jpdc/ShibataMOKM18Mon, 01 Jan 2018 00:00:00 +0100 Move-optimal partial gathering of mobile agents in asynchronous trees.https://doi.org/10.1016/j.tcs.2017.09.016, , , :
Move-optimal partial gathering of mobile agents in asynchronous trees. Theor. Comput. Sci. 705: 9-30 ()]]>https://dblp.org/rec/journals/tcs/ShibataOKM18Mon, 01 Jan 2018 00:00:00 +0100 Group Exploration of Dynamic Tori.https://doi.org/10.1109/ICDCS.2018.00080, , , , :
Group Exploration of Dynamic Tori. ICDCS : 775-785]]>https://dblp.org/rec/conf/icdcs/GotohSOKM18Mon, 01 Jan 2018 00:00:00 +0100 A Population Protocol for Uniform k-Partition Under Global Fairness.https://doi.org/10.1109/IPDPSW.2018.00128, , , , :
A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops : 813-819]]>https://dblp.org/rec/conf/ipps/YasumiKOII18Mon, 01 Jan 2018 00:00:00 +0100 Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards.https://doi.org/10.1007/978-3-030-05529-5_6, , :
Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards. NETYS : 85-99]]>https://dblp.org/rec/conf/netys/TsuchidaOI18Mon, 01 Jan 2018 00:00:00 +0100 Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time.https://doi.org/10.4230/LIPIcs.OPODIS.2018.30, , , , , :
Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time. OPODIS : 30:1-30:16]]>https://dblp.org/rec/conf/opodis/SudoOKMDL18Mon, 01 Jan 2018 00:00:00 +0100 Ring Exploration with Myopic Luminous Robots.https://doi.org/10.1007/978-3-030-03232-6_20, :
Ring Exploration with Myopic Luminous Robots. SSS : 301-316]]>https://dblp.org/rec/conf/sss/OoshitaT18Mon, 01 Jan 2018 00:00:00 +0100 Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings.https://doi.org/10.1007/978-3-030-03232-6_27, :
Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings. SSS : 393-397]]>https://dblp.org/rec/conf/sss/OoshitaD18Mon, 01 Jan 2018 00:00:00 +0100 Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time.https://doi.org/10.4230/LIPIcs.DISC.2018.52, , , :
Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time. DISC : 52:1-52:3]]>https://dblp.org/rec/conf/wdag/SudoOKM18Mon, 01 Jan 2018 00:00:00 +0100 Ring Exploration with Myopic Luminous Robots.http://arxiv.org/abs/1805.03965, :
Ring Exploration with Myopic Luminous Robots. CoRR abs/1805.03965 ()]]>https://dblp.org/rec/journals/corr/abs-1805-03965Mon, 01 Jan 2018 00:00:00 +0100 Logarithmic Expected-Time Leader Election in Population Protocol Model.http://arxiv.org/abs/1812.11309, , , , :
Logarithmic Expected-Time Leader Election in Population Protocol Model. CoRR abs/1812.11309 ()]]>https://dblp.org/rec/journals/corr/abs-1812-11309Mon, 01 Jan 2018 00:00:00 +0100 Constant-Space Population Protocols for Uniform Bipartition.https://doi.org/10.4230/LIPIcs.OPODIS.2017.19, , , :
Constant-Space Population Protocols for Uniform Bipartition. OPODIS : 19:1-19:17]]>https://dblp.org/rec/conf/opodis/YasumiOYI17Sun, 01 Jan 2017 00:00:00 +0100 Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks.https://doi.org/10.1145/3087801.3087840, , :
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks. PODC : 411-413]]>https://dblp.org/rec/conf/podc/InoueOT17Sun, 01 Jan 2017 00:00:00 +0100 Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs.https://doi.org/10.1007/978-3-319-69084-1_2, , :
Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs. SSS : 18-32]]>https://dblp.org/rec/conf/sss/OoshitaDM17Sun, 01 Jan 2017 00:00:00 +0100 An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks.https://doi.org/10.1007/978-3-319-69084-1_7, , :
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks. SSS : 93-108]]>https://dblp.org/rec/conf/sss/InoueOT17Sun, 01 Jan 2017 00:00:00 +0100 How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults.https://doi.org/10.1007/978-3-319-69084-1_16, , , :
How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults. SSS : 234-249]]>https://dblp.org/rec/conf/sss/GotohOKM17Sun, 01 Jan 2017 00:00:00 +0100 Byzantine Gathering in Networks with Authenticated Whiteboards.https://doi.org/10.1007/978-3-319-53925-6_9, , :
Byzantine Gathering in Networks with Authenticated Whiteboards. WALCOM : 106-118]]>https://dblp.org/rec/conf/walcom/TsuchidaOI17Sun, 01 Jan 2017 00:00:00 +0100 An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks.https://doi.org/10.7155/jgaa.00384, , :
An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks. J. Graph Algorithms Appl. 20(1): 59-78 ()]]>https://dblp.org/rec/journals/jgaa/AsadaOI16Fri, 01 Jan 2016 00:00:00 +0100 Partial gathering of mobile agents in asynchronous unidirectional rings.https://doi.org/10.1016/j.tcs.2015.09.012, , , , :
Partial gathering of mobile agents in asynchronous unidirectional rings. Theor. Comput. Sci. 617: 1-11 ()]]>https://dblp.org/rec/journals/tcs/ShibataKOKM16Fri, 01 Jan 2016 00:00:00 +0100 Uniform Deployment of Mobile Agents in Asynchronous Rings.https://doi.org/10.1145/2933057.2933093, , , , :
Uniform Deployment of Mobile Agents in Asynchronous Rings. PODC : 415-424]]>https://dblp.org/rec/conf/podc/ShibataMOKM16Fri, 01 Jan 2016 00:00:00 +0100 An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers.https://doi.org/10.1007/978-3-319-49259-9_17, , :
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers. SSS : 195-212]]>https://dblp.org/rec/conf/sss/InoueOT16Fri, 01 Jan 2016 00:00:00 +0100 A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards.https://doi.org/10.1587/transfun.E98.A.2117, , , , , :
A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2117-2128 ()]]>https://dblp.org/rec/journals/ieicet/SudoBNOKM15Thu, 01 Jan 2015 00:00:00 +0100 On the self-stabilization of mobile oblivious robots in uniform rings.https://doi.org/10.1016/j.tcs.2014.12.008, :
On the self-stabilization of mobile oblivious robots in uniform rings. Theor. Comput. Sci. 568: 84-96 ()]]>https://dblp.org/rec/journals/tcs/OoshitaT15Thu, 01 Jan 2015 00:00:00 +0100 Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers.https://doi.org/10.4230/LIPIcs.OPODIS.2015.14, , , :
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers. OPODIS : 14:1-14:16]]>https://dblp.org/rec/conf/opodis/SudoOKM15Thu, 01 Jan 2015 00:00:00 +0100 Partial Gathering of Mobile Agents in Asynchronous Rings.http://arxiv.org/abs/1505.06596, , , , :
Partial Gathering of Mobile Agents in Asynchronous Rings. CoRR abs/1505.06596 ()]]>https://dblp.org/rec/journals/corr/ShibataKOKM15Thu, 01 Jan 2015 00:00:00 +0100 Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator.https://doi.org/10.1142/S0129626414500029, , , :
Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator. Parallel Process. Lett. 24(1) ()]]>https://dblp.org/rec/journals/ppl/KawaiOKM14Wed, 01 Jan 2014 00:00:00 +0100 Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks.https://doi.org/10.1109/TPDS.2013.259, , , :
Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks. IEEE Trans. Parallel Distributed Syst. 25(5): 1289-1296 ()]]>https://dblp.org/rec/journals/tpds/OoshitaKKM14Wed, 01 Jan 2014 00:00:00 +0100 Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols.https://doi.org/10.1007/978-3-319-14472-6_23, , , :
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols. OPODIS : 339-354]]>https://dblp.org/rec/conf/opodis/SudoOKM14Wed, 01 Jan 2014 00:00:00 +0100 Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees.https://doi.org/10.1007/978-3-319-09620-9_25, , , :
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees. SIROCCO : 327-342]]>https://dblp.org/rec/conf/sirocco/ShibataOKM14Wed, 01 Jan 2014 00:00:00 +0100 Asynchronous Ring Gathering by Oblivious Robots with Limited Vision.https://doi.org/10.1109/SRDSW.2014.15, , :
Asynchronous Ring Gathering by Oblivious Robots with Limited Vision. SRDS Workshops : 46-49]]>https://dblp.org/rec/conf/srds/KameiLO14Wed, 01 Jan 2014 00:00:00 +0100 Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings.https://doi.org/10.1587/transfun.E96.A.1072, , , :
Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1072-1080 ()]]>https://dblp.org/rec/journals/ieicet/IzumiIKO13Tue, 01 Jan 2013 00:00:00 +0100 Linear time and space gathering of anonymous mobile agents in asynchronous trees.https://doi.org/10.1016/j.tcs.2013.01.022, , , , :
Linear time and space gathering of anonymous mobile agents in asynchronous trees. Theor. Comput. Sci. 478: 118-126 ()]]>https://dblp.org/rec/journals/tcs/BabaIOKM13Tue, 01 Jan 2013 00:00:00 +0100 Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots.https://doi.org/10.1109/TPDS.2012.212, , , :
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots. IEEE Trans. Parallel Distributed Syst. 24(4): 716-723 ()]]>https://dblp.org/rec/journals/tpds/IzumiIKO13Tue, 01 Jan 2013 00:00:00 +0100 Zigzag: Local-Information-Based Self-Optimizing Routing in Virtual Grid Networks.https://doi.org/10.1109/ICDCS.2013.63, , , :
Zigzag: Local-Information-Based Self-Optimizing Routing in Virtual Grid Networks. ICDCS : 357-368]]>https://dblp.org/rec/conf/icdcs/TakatsuOKM13Tue, 01 Jan 2013 00:00:00 +0100 Hierarchical Low Power Consumption Technique with Location Information for Sensor Networks.http://arxiv.org/abs/1312.2806, :
Hierarchical Low Power Consumption Technique with Location Information for Sensor Networks. CoRR abs/1312.2806 ()]]>https://dblp.org/rec/journals/corr/MatsumaeO13Tue, 01 Jan 2013 00:00:00 +0100 The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling.https://doi.org/10.1142/S0129626412500065, , :
The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling. Parallel Process. Lett. 22(2) ()]]>https://dblp.org/rec/journals/ppl/OoshitaII12Sun, 01 Jan 2012 00:00:00 +0100 Loosely-stabilizing leader election in a population protocol model.https://doi.org/10.1016/j.tcs.2012.01.007, , , , , :
Loosely-stabilizing leader election in a population protocol model. Theor. Comput. Sci. 444: 100-112 ()]]>https://dblp.org/rec/journals/tcs/SudoNYOKM12Sun, 01 Jan 2012 00:00:00 +0100 Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection.https://doi.org/10.1007/978-3-642-32589-2_48, , , :
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection. MFCS : 542-553]]>https://dblp.org/rec/conf/mfcs/KameiLOT12Sun, 01 Jan 2012 00:00:00 +0100 Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings.https://doi.org/10.1007/978-3-642-35476-2_18, , , , :
Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings. OPODIS : 254-268]]>https://dblp.org/rec/conf/opodis/ShibataKOKM12Sun, 01 Jan 2012 00:00:00 +0100 Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks.https://doi.org/10.1007/978-3-642-31104-8_26, , , :
Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks. SIROCCO : 303-314]]>https://dblp.org/rec/conf/sirocco/KawaiOKM12Sun, 01 Jan 2012 00:00:00 +0100 Communication-Efficient Self-stabilization in Wireless Networks.https://doi.org/10.1007/978-3-642-33536-5_1, , , :
Communication-Efficient Self-stabilization in Wireless Networks. SSS : 1-15]]>https://dblp.org/rec/conf/sss/TakimotoOKM12Sun, 01 Jan 2012 00:00:00 +0100 On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings.https://doi.org/10.1007/978-3-642-33536-5_6, :
On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings. SSS : 49-63]]>https://dblp.org/rec/conf/sss/OoshitaT12Sun, 01 Jan 2012 00:00:00 +0100 Owens Luis - A context-aware multi-modal smart office chair in an ambient environment.https://doi.org/10.1109/VR.2012.6180951, , , , , , , , , :
Owens Luis - A context-aware multi-modal smart office chair in an ambient environment. VR : 1-4]]>https://dblp.org/rec/conf/vr/KiyokawaHHOSIOKKM12Sun, 01 Jan 2012 00:00:00 +0100 Implementation of a smart office system in an ambient environment.https://doi.org/10.1109/VR.2012.6180849, , , , , , , , , , , :
Implementation of a smart office system in an ambient environment. VR : 1-2]]>https://dblp.org/rec/conf/vr/ShigetaNTKHHOIOKKM12Sun, 01 Jan 2012 00:00:00 +0100 Gathering an even number of robots in an odd ring without global multiplicity detection.http://arxiv.org/abs/1207.7241, , , :
Gathering an even number of robots in an odd ring without global multiplicity detection. CoRR abs/1207.7241 ()]]>https://dblp.org/rec/journals/corr/abs-1207-7241Sun, 01 Jan 2012 00:00:00 +0100 Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection.https://doi.org/10.1007/978-3-642-22212-2_14, , , :
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection. SIROCCO : 150-161]]>https://dblp.org/rec/conf/sirocco/KameiLOT11Sat, 01 Jan 2011 00:00:00 +0100 Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection.http://arxiv.org/abs/1104.5660, , , :
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. CoRR abs/1104.5660 ()]]>https://dblp.org/rec/journals/corr/abs-1104-5660Sat, 01 Jan 2011 00:00:00 +0100 An ant colony optimization routing based on robustness for ad hoc networks with GPSs.https://doi.org/10.1016/j.adhoc.2009.04.005, , , , :
An ant colony optimization routing based on robustness for ad hoc networks with GPSs. Ad Hoc Networks 8(1): 63-76 ()]]>https://dblp.org/rec/journals/adhoc/KadonoIOKM10Fri, 01 Jan 2010 00:00:00 +0100 Timer-based composition of fault-containing self-stabilizing protocols.https://doi.org/10.1016/j.ins.2009.10.003, , , , , :
Timer-based composition of fault-containing self-stabilizing protocols. Inf. Sci. 180(10): 1802-1816 ()]]>https://dblp.org/rec/journals/isci/YamauchiKOKKM10Fri, 01 Jan 2010 00:00:00 +0100 An agent exploration in unknown undirected graphs with whiteboards.https://doi.org/10.1145/1953563.1953570, , , , , :
An agent exploration in unknown undirected graphs with whiteboards. WRAS : 8]]>https://dblp.org/rec/conf/podc/SudoBNOKM10Fri, 01 Jan 2010 00:00:00 +0100 Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees.https://doi.org/10.1007/978-3-642-13284-1_8, , , , :
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees. SIROCCO : 86-100]]>https://dblp.org/rec/conf/sirocco/BabaIOKM10Fri, 01 Jan 2010 00:00:00 +0100 Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings.https://doi.org/10.1007/978-3-642-13284-1_9, , , :
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. SIROCCO : 101-113]]>https://dblp.org/rec/conf/sirocco/IzumiIKO10Fri, 01 Jan 2010 00:00:00 +0100 A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination.https://doi.org/10.1587/transinf.E92.D.258, , , , :
A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination. IEICE Trans. Inf. Syst. 92-D(2): 258-268 ()]]>https://dblp.org/rec/journals/ieicet/WuIOKM09Thu, 01 Jan 2009 00:00:00 +0100 Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property.https://doi.org/10.1587/transinf.E92.D.451, , , , , :
Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property. IEICE Trans. Inf. Syst. 92-D(3): 451-459 ()]]>https://dblp.org/rec/journals/ieicet/YamauchiKOKKM09Thu, 01 Jan 2009 00:00:00 +0100 Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays.https://doi.org/10.1587/transinf.E92.D.563, , , :
Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays. IEICE Trans. Inf. Syst. 92-D(4): 563-574 ()]]>https://dblp.org/rec/journals/ieicet/WuOKM09Thu, 01 Jan 2009 00:00:00 +0100 A Biologically Inspired Self-Adaptation of Replica Density Control.https://doi.org/10.1587/transinf.E92.D.1125, , , , :
A Biologically Inspired Self-Adaptation of Replica Density Control. IEICE Trans. Inf. Syst. 92-D(5): 1125-1136 ()]]>https://dblp.org/rec/journals/ieicet/IzumiIOKM09Thu, 01 Jan 2009 00:00:00 +0100 A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection.https://doi.org/10.1587/transinf.E92.D.2016, , , , :
A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection. IEICE Trans. Inf. Syst. 92-D(10): 2016-2024 ()]]>https://dblp.org/rec/journals/ieicet/NishikawaIOKM09Thu, 01 Jan 2009 00:00:00 +0100 A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines.https://doi.org/10.1109/PDCAT.2009.26, , :
A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines. PDCAT : 26-33]]>https://dblp.org/rec/conf/pdcat/OoshitaII09Thu, 01 Jan 2009 00:00:00 +0100 Loosely-Stabilizing Leader Election in Population Protocol Model.https://doi.org/10.1007/978-3-642-11476-2_23, , , , , :
Loosely-Stabilizing Leader Election in Population Protocol Model. SIROCCO : 295-308]]>https://dblp.org/rec/conf/sirocco/SudoNYOKM09Thu, 01 Jan 2009 00:00:00 +0100 Randomized Gathering of Mobile Robots with Local-Multiplicity Detection.https://doi.org/10.1007/978-3-642-05118-0_27, , , :
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. SSS : 384-398]]>https://dblp.org/rec/conf/sss/IzumiIKO09Thu, 01 Jan 2009 00:00:00 +0100 Move-optimal gossiping among mobile agents.https://doi.org/10.1016/j.tcs.2007.11.007, , , , :
Move-optimal gossiping among mobile agents. Theor. Comput. Sci. 393(1-3): 90-101 ()]]>https://dblp.org/rec/journals/tcs/SuzukiIOKM08Tue, 01 Jan 2008 00:00:00 +0100 A stable clustering algorithm for mobile ad hoc networks based on attractor selection.https://doi.org/10.4108/ICST.BIONETICS2008.4736, , , :
A stable clustering algorithm for mobile ad hoc networks based on attractor selection. BIONETICS : 38]]>https://dblp.org/rec/conf/bionetics/NishikawaOKM08Tue, 01 Jan 2008 00:00:00 +0100 A Robustness based Ant Colony Optimization Routing for Ad Hoc Networks with GPSs.https://dblp.org/pid/73/183.html, , , , :
A Robustness based Ant Colony Optimization Routing for Ad Hoc Networks with GPSs. ICWN : 360-366]]>https://dblp.org/rec/conf/icwn/KadonoIOKM08Tue, 01 Jan 2008 00:00:00 +0100 Timer-Based Composition of Fault-Containing Self-stabilizing Protocols.https://doi.org/10.1007/978-3-540-85257-5_22, , , , , :
Timer-Based Composition of Fault-Containing Self-stabilizing Protocols. IDC : 217-226]]>https://dblp.org/rec/conf/idc/YamauchiKOKKM08Tue, 01 Jan 2008 00:00:00 +0100 Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model.https://doi.org/10.1093/ietisy/e90-1.1.314, , , :
Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model. IEICE Trans. Inf. Syst. 90-D(1): 314-324 ()]]>https://dblp.org/rec/journals/ieicet/SuzukiIOM07Mon, 01 Jan 2007 00:00:00 +0100 Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model.https://doi.org/10.1093/ietisy/e90-d.2.403, , :
Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model. IEICE Trans. Inf. Syst. 90-D(2): 403-417 ()]]>https://dblp.org/rec/journals/ieicet/OoshitaMM07Mon, 01 Jan 2007 00:00:00 +0100 An adaptive randomized search protocol in peer-to-peer systems.https://doi.org/10.1145/1244002.1244126, , , , :
An adaptive randomized search protocol in peer-to-peer systems. SAC : 533-537]]>https://dblp.org/rec/conf/sac/WuIOKM07Mon, 01 Jan 2007 00:00:00 +0100 Optimal Moves for Gossiping Among Mobile Agents.https://doi.org/10.1007/978-3-540-72951-8_13, , , , :
Optimal Moves for Gossiping Among Mobile Agents. SIROCCO : 151-165]]>https://dblp.org/rec/conf/sirocco/SuzukiIOKM07Mon, 01 Jan 2007 00:00:00 +0100 A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults.https://doi.org/10.2514/1.19822, , :
A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults. J. Aerosp. Comput. Inf. Commun. 3(8): 420-436 ()]]>https://dblp.org/rec/journals/jacic/SakuraiOM06Sun, 01 Jan 2006 00:00:00 +0100 Bio-inspired Replica Density Control in Dynamic Networks.https://doi.org/10.1007/11613022_23, , , , :
Bio-inspired Replica Density Control in Dynamic Networks. BioADIT : 281-293]]>https://dblp.org/rec/conf/bioadit/SuzukiIOKM06Sun, 01 Jan 2006 00:00:00 +0100 Scheduling Independent Tasks on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model.https://dblp.org/pid/73/183.html, , :
Scheduling Independent Tasks on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model. PDPTA : 690-696]]>https://dblp.org/rec/conf/pdpta/OoshitaMM06Sun, 01 Jan 2006 00:00:00 +0100 Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework.https://doi.org/10.1007/978-3-540-49823-0_36, , , , , :
Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework. SSS : 516-532]]>https://dblp.org/rec/conf/sss/YamauchiKOKKM06Sun, 01 Jan 2006 00:00:00 +0100 Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System.https://doi.org/10.1007/978-3-540-49823-0_50, , , , :
Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System. SSS : 586-587]]>https://dblp.org/rec/conf/sss/WuIOKM06Sun, 01 Jan 2006 00:00:00 +0100 Biologically Inspired Self-Adaptation of Mobile Agent Population.https://doi.org/10.1109/DEXA.2005.56, , , :
Biologically Inspired Self-Adaptation of Mobile Agent Population. DEXA Workshops : 170-174]]>https://dblp.org/rec/conf/dexaw/SuzukiIOM05Sat, 01 Jan 2005 00:00:00 +0100 Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach.https://doi.org/10.1109/ICAC.2005.52, , , :
Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach. ICAC : 374-375]]>https://dblp.org/rec/conf/icac/SuzukiIOM05Sat, 01 Jan 2005 00:00:00 +0100 Scheduling for broadcast operation in heterogeneous parallel computing environments.https://doi.org/10.1002/scj.10533, , , :
Scheduling for broadcast operation in heterogeneous parallel computing environments. Syst. Comput. Jpn. 35(5): 44-54 ()]]>https://dblp.org/rec/journals/scjapan/OoshitaMMT04Thu, 01 Jan 2004 00:00:00 +0100 A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks.https://doi.org/10.1007/11516798_21, , :
A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks. OPODIS : 283-298]]>https://dblp.org/rec/conf/opodis/SakuraiOM04Thu, 01 Jan 2004 00:00:00 +0100 Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments.http://search.ieice.org/bin/summary.php?id=e86-a_4_908, , :
Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 908-918 ()]]>https://dblp.org/rec/journals/ieiceta/OoshitaMM03Wed, 01 Jan 2003 00:00:00 +0100 Efficient Gather Operation in Heterogeneous Cluster Systems.https://doi.org/10.1109/HPCSA.2002.1019155, , :
Efficient Gather Operation in Heterogeneous Cluster Systems. HPCS : 196-204]]>https://dblp.org/rec/conf/hpcs/OoshitaMM02Tue, 01 Jan 2002 00:00:00 +0100