default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFukuhito Ooshita
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications. Acta Informatica 61(1): 83-100 (2024)- [j49]Jion Hirose
, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Fast gathering despite a linear number of weakly Byzantine agents†. Concurr. Comput. Pract. Exp. 36(14) (2024) - [j48]Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Fukuhito Ooshita:
A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model. Concurr. Comput. Pract. Exp. 36(26) (2024) - [c74]Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. AINA (2) 2024: 110-121 - [c73]Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue:
Gathering in Carrier Graphs: Meeting via Public Transportation System. SAND 2024: 21:1-21:17 - [c72]Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei:
Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent. DISC 2024: 55:1-55:7 - 2023
- [j47]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada:
Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots. Concurr. Comput. Pract. Exp. 35(11) (2023) - [j46]Grégory Bénassy, Fukuhito Ooshita, Michiko Inoue:
Eventually consistent distributed ledger despite degraded atomic broadcast. Concurr. Comput. Pract. Exp. 35(11) (2023) - [j45]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Ring exploration of myopic luminous robots with visibility more than one. Inf. Comput. 292: 105036 (2023) - [j44]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Location functions for self-stabilizing byzantine tolerant swarms. Theor. Comput. Sci. 954: 113755 (2023) - [c71]Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Fukuhito Ooshita:
A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model. CANDARW 2023: 100-106 - [c70]Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa:
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. PODC 2023: 2-12 - [c69]Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. SSS 2023: 297-311 - [i19]Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa:
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. CoRR abs/2305.08375 (2023) - [i18]Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. CoRR abs/2305.11590 (2023) - [i17]Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. CoRR abs/2312.12698 (2023) - 2022
- [j43]Fukuhito Ooshita, Sébastien Tixeuil:
Ring exploration with myopic luminous robots. Inf. Comput. 285(Part): 104702 (2022) - [j42]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Weakly Byzantine Gathering with a Strong Team. IEICE Trans. Inf. Syst. 105-D(3): 541-555 (2022) - [j41]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Terminating Grid Exploration with Myopic Luminous Robots. Int. J. Netw. Comput. 12(1): 73-102 (2022) - [c68]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering despite a linear number of weakly Byzantine agents. CANDARW 2022: 161-167 - [c67]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents. PODC 2022: 375-377 - [i16]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering despite a linear number of weakly Byzantine agents. CoRR abs/2205.14937 (2022) - 2021
- [j40]Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Exploration of dynamic tori by multiple agents. Theor. Comput. Sci. 850: 202-220 (2021) - [j39]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform bipartition in the population protocol model with arbitrary graphs. Theor. Comput. Sci. 892: 187-207 (2021) - [c66]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering with a strong team in weakly Byzantine environments. ICDCN 2021: 26-35 - [c65]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Terminating Grid Exploration with Myopic Luminous Robots. IPDPS Workshops 2021: 586-595 - [c64]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. OPODIS 2021: 9:1-9:17 - [c63]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Population Protocols for Graph Class Identification Problems. OPODIS 2021: 13:1-13:19 - [c62]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Location Functions for Self-stabilizing Byzantine Tolerant Swarms. SSS 2021: 229-242 - [i15]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. CoRR abs/2101.05421 (2021) - [i14]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Terminating grid exploration with myopic luminous robots. CoRR abs/2102.06006 (2021) - [i13]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Population Protocols for Graph Class Identification Problems. CoRR abs/2111.05111 (2021) - 2020
- [j38]Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa:
Dynamic Ring Exploration with (H, S) View. Algorithms 13(6): 141 (2020) - [j37]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers. IEICE Trans. Inf. Syst. 103-D(3): 489-499 (2020) - [j36]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards. IEICE Trans. Inf. Syst. 103-D(7): 1672-1682 (2020) - [j35]Fukuhito Ooshita:
Foreword. IEICE Trans. Inf. Syst. 103-D(12): 2411 (2020) - [j34]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore:
Loosely-stabilizing leader election with polylogarithmic convergence time. Theor. Comput. Sci. 806: 617-631 (2020) - [j33]Masahiro Shibata, Norikazu Kawata, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings. Theor. Comput. Sci. 822: 92-109 (2020) - [j32]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Time-Optimal Leader Election in Population Protocols. IEEE Trans. Parallel Distributed Syst. 31(11): 2620-2632 (2020) - [c61]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. OPODIS 2020: 33:1-33:16 - [i12]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering with a strong team in weakly Byzantine environments. CoRR abs/2007.08217 (2020) - [i11]Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei:
Self-stabilizing Graph Exploration by a Single Agent. CoRR abs/2010.08929 (2020) - [i10]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. CoRR abs/2011.08366 (2020)
2010 – 2019
- 2019
- [j31]Masahiro Shibata, Daisuke Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Partial Gathering of Mobile Agents in Arbitrary Networks. IEICE Trans. Inf. Syst. 102-D(3): 444-453 (2019) - [j30]Hiroto Yasumi, Fukuhito Ooshita, Ken-ichi Yamaguchi, Michiko Inoue:
Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness. IEICE Trans. Inf. Syst. 102-D(3): 454-463 (2019) - [j29]Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue:
A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. 9(1): 97-110 (2019) - [j28]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore:
Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model. IEEE Trans. Parallel Distributed Syst. 30(6): 1359-1373 (2019) - [c60]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada:
Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots. CANDAR Workshops 2019: 188-194 - [c59]Grégory Bénassy, Fukuhito Ooshita, Michiko Inoue:
Eventually Consistent Distributed Ledger Relying on Degraded Atomic Broadcast. CANDAR Workshops 2019: 195-200 - [c58]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Uniform Partition in Population Protocol Model Under Weak Fairness. OPODIS 2019: 8:1-8:16 - [c57]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS 2019: 27:1-27:17 - [c56]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Logarithmic Expected-Time Leader Election in Population Protocol Model. PODC 2019: 60-62 - [c55]Masahiro Shibata, Norikazu Kawata, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings. SIROCCO 2019: 277-292 - [c54]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada:
Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots. SSS 2019: 16-21 - [c53]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder. SSS 2019: 127-132 - [c52]Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa:
Exploration of Dynamic Ring Networks by a Single Agent with the H-hops and S-time Steps View. SSS 2019: 165-177 - [c51]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Ring Exploration of Myopic Luminous Robots with Visibility More Than One. SSS 2019: 256-271 - [c50]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Logarithmic Expected-Time Leader Election in Population Protocol Model. SSS 2019: 323-337 - [c49]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Black Hole Search Despite Byzantine Agents. SSS 2019: 354-367 - [c48]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DISC 2019: 43:1-43:3 - [i9]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract). CoRR abs/1903.02843 (2019) - [i8]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Uniform Partition in Population Protocol Model under Weak Fairness. CoRR abs/1911.04678 (2019) - [i7]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR abs/1911.04757 (2019) - 2018
- [j27]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Trans. Inf. Syst. 101-D(3): 602-610 (2018) - [j26]Masahiro Shibata, Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Uniform deployment of mobile agents in asynchronous rings. J. Parallel Distributed Comput. 119: 92-106 (2018) - [j25]Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-optimal partial gathering of mobile agents in asynchronous trees. Theor. Comput. Sci. 705: 9-30 (2018) - [c47]Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Group Exploration of Dynamic Tori. ICDCS 2018: 775-785 - [c46]Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue:
A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops 2018: 813-819 - [c45]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards. NETYS 2018: 85-99 - [c44]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore:
Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time. OPODIS 2018: 30:1-30:16 - [c43]Fukuhito Ooshita, Sébastien Tixeuil:
Ring Exploration with Myopic Luminous Robots. SSS 2018: 301-316 - [c42]Fukuhito Ooshita, Ajoy K. Datta:
Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings. SSS 2018: 393-397 - [c41]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time. DISC 2018: 52:1-52:3 - [i6]Fukuhito Ooshita, Sébastien Tixeuil:
Ring Exploration with Myopic Luminous Robots. CoRR abs/1805.03965 (2018) - [i5]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Logarithmic Expected-Time Leader Election in Population Protocol Model. CoRR abs/1812.11309 (2018) - 2017
- [c40]Hiroto Yasumi, Fukuhito Ooshita, Ken-ichi Yamaguchi, Michiko Inoue:
Constant-Space Population Protocols for Uniform Bipartition. OPODIS 2017: 19:1-19:17 - [c39]Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks. PODC 2017: 411-413 - [c38]Fukuhito Ooshita, Ajoy K. Datta, Toshimitsu Masuzawa:
Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs. SSS 2017: 18-32 - [c37]Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks. SSS 2017: 93-108 - [c36]Tsuyoshi Gotoh, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults. SSS 2017: 234-249 - [c35]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Byzantine Gathering in Networks with Authenticated Whiteboards. WALCOM 2017: 106-118 - 2016
- [j24]Yuma Asada, Fukuhito Ooshita, Michiko Inoue:
An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks. J. Graph Algorithms Appl. 20(1): 59-78 (2016) - [j23]Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Partial gathering of mobile agents in asynchronous unidirectional rings. Theor. Comput. Sci. 617: 1-11 (2016) - [c34]Masahiro Shibata, Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Uniform Deployment of Mobile Agents in Asynchronous Rings. PODC 2016: 415-424 - [c33]Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers. SSS 2016: 195-212 - 2015
- [j22]Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2117-2128 (2015) - [j21]Fukuhito Ooshita, Sébastien Tixeuil:
On the self-stabilization of mobile oblivious robots in uniform rings. Theor. Comput. Sci. 568: 84-96 (2015) - [c32]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers. OPODIS 2015: 14:1-14:16 - [i4]Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Partial Gathering of Mobile Agents in Asynchronous Rings. CoRR abs/1505.06596 (2015) - 2014
- [j20]Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator. Parallel Process. Lett. 24(1) (2014) - [j19]Fukuhito Ooshita, Shinji Kawai, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks. IEEE Trans. Parallel Distributed Syst. 25(5): 1289-1296 (2014) - [c31]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols. OPODIS 2014: 339-354 - [c30]Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees. SIROCCO 2014: 327-342 - [c29]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita:
Asynchronous Ring Gathering by Oblivious Robots with Limited Vision. SRDS Workshops 2014: 46-49 - 2013
- [j18]Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita:
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 (2013) - [j17]Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Linear time and space gathering of anonymous mobile agents in asynchronous trees. Theor. Comput. Sci. 478: 118-126 (2013) - [j16]Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita:
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots. IEEE Trans. Parallel Distributed Syst. 24(4): 716-723 (2013) - [c28]Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Zigzag: Local-Information-Based Self-Optimizing Routing in Virtual Grid Networks. ICDCS 2013: 357-368 - [i3]Susumu Matsumae, Fukuhito Ooshita:
Hierarchical Low Power Consumption Technique with Location Information for Sensor Networks. CoRR abs/1312.2806 (2013) - 2012
- [j15]Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi:
The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling. Parallel Process. Lett. 22(2) (2012) - [j14]Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-stabilizing leader election in a population protocol model. Theor. Comput. Sci. 444: 100-112 (2012) - [c27]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection. MFCS 2012: 542-553 - [c26]Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings. OPODIS 2012: 254-268 - [c25]Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks. SIROCCO 2012: 303-314 - [c24]Tomoya Takimoto, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Communication-Efficient Self-stabilization in Wireless Networks. SSS 2012: 1-15 - [c23]Fukuhito Ooshita, Sébastien Tixeuil:
On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings. SSS 2012: 49-63 - [c22]Kiyoshi Kiyokawa, Masahide Hatanaka, Kazufumi Hosoda, Masashi Okada, Hironori Shigeta, Yasunori Ishihara, Fukuhito Ooshita, Hirotsugu Kakugawa, Satoshi Kurihara, Koichi Moriyama:
Owens Luis - A context-aware multi-modal smart office chair in an ambient environment. VR 2012: 1-4 - [c21]Hironori Shigeta, Junya Nakase, Yuta Tsunematsu, Kiyoshi Kiyokawa, Masahide Hatanaka, Kazufumi Hosoda, Masashi Okada, Yasunori Ishihara, Fukuhito Ooshita, Hirotsugu Kakugawa, Satoshi Kurihara, Koichi Moriyama:
Implementation of a smart office system in an ambient environment. VR 2012: 1-2 - [i2]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Gathering an even number of robots in an odd ring without global multiplicity detection. CoRR abs/1207.7241 (2012) - 2011
- [c20]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection. SIROCCO 2011: 150-161 - [i1]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. CoRR abs/1104.5660 (2011) - 2010
- [j13]Daisuke Kadono, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
An ant colony optimization routing based on robustness for ad hoc networks with GPSs. Ad Hoc Networks 8(1): 63-76 (2010) - [j12]Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Timer-based composition of fault-containing self-stabilizing protocols. Inf. Sci. 180(10): 1802-1816 (2010) - [c19]Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
An agent exploration in unknown undirected graphs with whiteboards. WRAS 2010: 8 - [c18]Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees. SIROCCO 2010: 86-100 - [c17]Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita:
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. SIROCCO 2010: 101-113
2000 – 2009
- 2009
- [j11]Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination. IEICE Trans. Inf. Syst. 92-D(2): 258-268 (2009) - [j10]Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property. IEICE Trans. Inf. Syst. 92-D(3): 451-459 (2009) - [j9]Yu Wu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays. IEICE Trans. Inf. Syst. 92-D(4): 563-574 (2009) - [j8]Tomoko Izumi, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A Biologically Inspired Self-Adaptation of Replica Density Control. IEICE Trans. Inf. Syst. 92-D(5): 1125-1136 (2009) - [j7]Gen Nishikawa, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection. IEICE Trans. Inf. Syst. 92-D(10): 2016-2024 (2009) - [c16]Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi:
A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines. PDCAT 2009: 26-33 - [c15]Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-Stabilizing Leader Election in Population Protocol Model. SIROCCO 2009: 295-308 - [c14]Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita:
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. SSS 2009: 384-398 - 2008
- [j6]Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-optimal gossiping among mobile agents. Theor. Comput. Sci. 393(1-3): 90-101 (2008) - [c13]Gen Nishikawa, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A stable clustering algorithm for mobile ad hoc networks based on attractor selection. BIONETICS 2008: 38 - [c12]Daisuke Kadono, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A Robustness based Ant Colony Optimization Routing for Ad Hoc Networks with GPSs. ICWN 2008: 360-366 - [c11]Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Timer-Based Composition of Fault-Containing Self-stabilizing Protocols. IDC 2008: 217-226 - 2007
- [j5]Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa:
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 (2007) - [j4]Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa:
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 (2007) - [c10]Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
An adaptive randomized search protocol in peer-to-peer systems. SAC 2007: 533-537 - [c9]Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Optimal Moves for Gossiping Among Mobile Agents. SIROCCO 2007: 151-165 - 2006
- [j3]Yusuke Sakurai, Fukuhito Ooshita, Toshimitsu Masuzawa:
A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults. J. Aerosp. Comput. Inf. Commun. 3(8): 420-436 (2006) - [c8]Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Bio-inspired Replica Density Control in Dynamic Networks. BioADIT 2006: 281-293 - [c7]Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa:
Scheduling Independent Tasks on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model. PDPTA 2006: 690-696 - [c6]Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework. SSS 2006: 516-532 - [c5]Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System. SSS 2006: 586-587 - 2005
- [c4]Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa:
Biologically Inspired Self-Adaptation of Mobile Agent Population. DEXA Workshops 2005: 170-174 - [c3]Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa:
Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach. ICAC 2005: 374-375 - 2004
- [j2]Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa, Nobuki Tokura:
Scheduling for broadcast operation in heterogeneous parallel computing environments. Syst. Comput. Jpn. 35(5): 44-54 (2004) - [c2]Yusuke Sakurai, Fukuhito Ooshita, Toshimitsu Masuzawa:
A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks. OPODIS 2004: 283-298 - 2003
- [j1]Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa:
Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 908-918 (2003) - 2002
- [c1]Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa:
Efficient Gather Operation in Heterogeneous Cluster Systems. HPCS 2002: 196-204
Coauthor Index
[j48] [c74] [c71] [i17] [j40] [j37] [j34] [j33] [j32] [j31] [j28] [c56] [c55] [c50] [j26] [j25] [c47] [c44] [c41] [i5] [c36] [j23] [c34] [j22] [c32] [i4] [j20] [j19] [c31] [c30] [j17] [c28] [j14] [c26] [c25] [c24] [c22] [c21] [j13] [j12] [c19] [c18] [j11] [j10] [j9] [j8] [j7] [c15] [j6] [c13] [c12] [c11] [c10] [c9] [c8] [c6] [c5]
[c70] [i19] [j40] [j38] [j37] [j34] [j33] [j32] [j31] [j28] [c56] [c55] [c52] [c50] [j26] [j25] [c47] [c44] [c41] [i5] [c38] [c36] [j23] [c34] [j22] [c32] [i4] [j20] [j19] [c31] [c30] [j17] [c28] [j14] [c26] [c25] [c24] [j13] [j12] [c19] [c18] [j11] [j10] [j9] [j8] [j7] [c15] [j6] [c13] [c12] [c11] [j5] [j4] [c10] [c9] [j3] [c8] [c7] [c6] [c5] [c4] [c3] [j2] [c2] [j1] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
