Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichiko Inoue
- > Home > Persons > Michiko Inoue
Publications
- 2023
[j36]Grégory Bénassy, Fukuhito Ooshita
, Michiko Inoue:
Eventually consistent distributed ledger despite degraded atomic broadcast. Concurr. Comput. Pract. Exp. 35(11) (2023)- [j35]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Ring exploration of myopic luminous robots with visibility more than one. Inf. Comput. 292: 105036 (2023) - [c87]Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. SSS 2023: 297-311 - [i10]Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. CoRR abs/2305.11590 (2023) - 2022
- [j33]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) - [j32]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Terminating Grid Exploration with Myopic Luminous Robots. Int. J. Netw. Comput. 12(1): 73-102 (2022) - [c85]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering despite a linear number of weakly Byzantine agents. CANDARW 2022: 161-167 - [c83]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents. PODC 2022: 375-377 - [i8]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering despite a linear number of weakly Byzantine agents. CoRR abs/2205.14937 (2022) - 2021
- [j29]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) - [c80]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering with a strong team in weakly Byzantine environments. ICDCN 2021: 26-35 - [c78]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Terminating Grid Exploration with Myopic Luminous Robots. IPDPS Workshops 2021: 586-595 - [c75]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Population Protocols for Graph Class Identification Problems. OPODIS 2021: 13:1-13:19 - [i7]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Terminating grid exploration with myopic luminous robots. CoRR abs/2102.06006 (2021) - [i5]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Population Protocols for Graph Class Identification Problems. CoRR abs/2111.05111 (2021) - 2020
- [j25]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) - [c72]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 - [i3]Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Gathering with a strong team in weakly Byzantine environments. CoRR abs/2007.08217 (2020) - [i2]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) - 2019
- [j23]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) - [j22]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) - [c66]Grégory Bénassy, Fukuhito Ooshita, Michiko Inoue:
Eventually Consistent Distributed Ledger Relying on Degraded Atomic Broadcast. CANDAR Workshops 2019: 195-200 - [c62]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Uniform Partition in Population Protocol Model Under Weak Fairness. OPODIS 2019: 8:1-8:16 - [c60]Shota Nagahama, Fukuhito Ooshita, Michiko Inoue:
Ring Exploration of Myopic Luminous Robots with Visibility More Than One. SSS 2019: 256-271 - [c59]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Black Hole Search Despite Byzantine Agents. SSS 2019: 354-367 - [i1]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Uniform Partition in Population Protocol Model under Weak Fairness. CoRR abs/1911.04678 (2019) - 2018
- [j21]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) - [c55]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 - [c52]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards. NETYS 2018: 85-99 - 2017
- [c48]Hiroto Yasumi, Fukuhito Ooshita, Ken-ichi Yamaguchi, Michiko Inoue:
Constant-Space Population Protocols for Uniform Bipartition. OPODIS 2017: 19:1-19:17 - [c47]Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks. PODC 2017: 411-413 - [c46]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 - [c45]Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Byzantine Gathering in Networks with Authenticated Whiteboards. WALCOM 2017: 106-118 - 2016
- [j17]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) - [c43]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
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-04-25 02:27 CEST 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:
