研究者詳細 - 大下　福仁

写真a

オオシタ　フクヒト

大下　福仁

Fukuhito Ooshita

学位

修士（工学）課程（ 2002年3月大阪大学）
博士（情報科学）論文（ 2006年12月大阪大学）

研究キーワード

分散アルゴリズム

研究分野

情報通信 / ソフトウェア
情報通信 / 情報学基礎論

学歴

大阪大学基礎工学部情報科学科飛び級

1997年4月 - 2000年3月
大阪大学大学院基礎工学研究科情報数理系専攻博士前期課程修了

2000年4月 - 2002年3月
大阪大学大学院情報科学研究科コンピュータサイエンス専攻博士後期課程中退

2002年4月 - 2003年3月

経歴

大阪大学大学院情報科学研究科助手

2003年4月 - 2007年3月
大阪大学大学院情報科学研究科助教

2007年4月 - 2015年6月
奈良先端科学技術大学院大学情報科学研究科准教授

2015年7月 - 2018年3月
奈良先端科学技術大学院大学先端科学技術研究科准教授

2018年4月 - 2022年3月
福井工業大学工学部教授

2022年4月 - 現在

所属学協会

電子情報通信学会

2001年10月 - 現在
ACM

2004年3月 - 現在
IEEE

2004年3月 - 現在
情報処理学会

2004年4月 - 現在

論文

A near time-optimal population protocol for self-stabilizing leader election on rings with a poly-logarithmic number of states 査読国際誌

Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita, and Toshimitsu Masuzawa

42nd ACM Symposium on Principles of Distributed Computing (PODC) 2023年7月

　詳細を見る

We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocolmodel. Given a rough knowledge ψ = ⌈log n⌉ + O(1) on the population size n, the proposed protocol lets the population reach a safe configuration within O(n2 log n) steps with high probability starting from any configuration. Thereafter, the population keeps the unique leader forever. Since no protocol solves SS-LE in o(n2) steps with high probability, the convergence time is near-optimal: the gap is only an O(log n) multiplicative factor. This protocol uses only polylog(n) states. There exist two state-of-the-art algorithms in current literature that solve SS-LE on ring networks. The first algorithm uses a polynomial number of states and solves SS-LE in O(n2) steps, whereas the second algorithm requires exponential time but it uses only a constant number of states. Our proposed algorithm provides an excellent middle ground between these two.
Uniform Bipartition in the Population Protocol Model with Arbitrary Graphs 査読国際共著

Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, and Sebastien Tixeuil

Theoretical Computer Science 892 187 - 207 2021年9月

　詳細を見る

In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of arbitrary communication graphs. As a result, we investigate the solvability of the uniform bipartition problem with arbitrary communication graphs when agents in the population have designated initial states, under various assumptions such as the existence of a base station, symmetry of the protocol, and fairness of the execution. When the problem is solvable, we present protocols for uniform bipartition. When global fairness is assumed, the space complexity of our solutions is tight.
Ring exploration with myopic luminous robots 査読国際共著

Fukuhito Ooshita and Sebastien Tixeuil

Information and Computation 2021年1月

　詳細を見る

We investigate exploration algorithms for autonomous mobile robots evolving in uniform ring-shaped networks. Unlike previous works, we consider myopia (each robot can only observe its neighboring nodes) and luminosity (each robot can use only two colors for its light) properties for the robots.

As a main contribution, we prove that (i) in the FSYNC model, two (resp. three) myopic robots are necessary and sufficient to achieve perpetual (resp. terminating) exploration, and (ii) in the SSYNC and ASYNC models, three (resp. four) myopic robots are necessary and sufficient to achieve perpetual (resp. terminating) exploration.

We also show that, in all execution models, our perpetual exploration algorithm is universal. That is, the algorithm solves perpetual exploration from any solvable initial configuration with two (resp. three) myopic robots and two colors in the FSYNC model (resp. the SSYNC and ASYNC models). On the other hand, we provide impossibility results for universal terminating exploration.
Exploration of dynamic tori by multiple agents 査読

Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 850 ( 5 ) 202 - 220 2021年1月
Time-optimal leader election in population protocols 査読

Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEEE Transactions on Parallel and Distributed Systems 31 ( 11 ) 2620 - 2632 2020年11月

　詳細を見る

In this article, we present the first leader election protocol in the population protocol model that stabilizes within O(logn) parallel time in expectation with O(logn) states per agent, where n is the number of agents. Given a rough knowledge m of lg n such that m ≥ lg n and m = O(logn), the proposed protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter. This protocol is time-optimal because it was recently proven that any leader election protocol requires Ω(logn) parallel time.
Neighborhood Mutual Remainder: Self-Stabilizing Distributed Implementation and Applications 査読国際共著

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada

Acta Informatica 2023年12月

　詳細を見る

Motivated by the need to convert move-atomic assumption in LOOK-COMPUTE-MOVE (LCM) robot algorithms to be implemented in existing distributed systems, we define a new distributed fundamental task, the neighborhood mutual remainder (NMR). Consider a situation where each process has a set of operations Op and executes each operation in Op infinitely often in distributed systems. Then, let Oe⊂Op be a subset of operations, which a process cannot execute, while its closed neighborhood executes operations in Op-Oe. The NMR is defined for such a situation. A distributed algorithm that satisfies the NMR requirement should satisfy the following two properties: (1) Liveness is satisfied if a process executes each operation in Op infinitely often and (2) safety is satisfied if, when each process executes operations in Oe, no process in its closed neighborhood executes operations in Op-Oe. We formalize the concept of NMR and give a simple self-stabilizing algorithm using the pigeon-hole principle to demonstrate the design paradigm to achieve NMR. A self-stabilizing algorithm tolerates transient faults (e.g., message loss, memory corruption, etc.) by its ability to converge from an arbitrary configuration to the legitimate one. In addition, we present an application of NMR to an LCM robot system for implementing a move-atomic property, where robots possess an independent clock that is advanced at the same speed. It is the first self-stabilizing implementation of the LCM synchronization for environments where each robot can have limited visibility and lights.
A self-stabilizing distributed algorithm for 1-MIS problem under the distance-3 model 査読

Hirotsugu kakugawa, Sayaka Kamei, Masahiro Shibata, and Fukuhito Ooshita

15th International Workshop on Parallel and Distributed Algorithms and Applications (PDAA) 2023年11月

　詳細を見る

Fault-tolerance and self-organization are critical
properties in modern distributed systems. Self-stabilization is a class of fault-tolerant distributed algorithms which has the ability to recover from any kind and any finite number of transient faults and topology changes. In this paper, we propose a selfstabilizing distributed algorithm for the 1-MIS problem under the unfair central daemon assuming the distance-3 model. Here, in the distance-3 model, each process can refer to the values of local variables of processes within three hops. Intuitively speaking, the
1-MIS problem is a variant of the maximal independent set (MIS) problem with improved local optimizations. The time complexity (convergence time) of our algorithm is O(n) steps and the space complexity is O(log n) bits, where n is the number of processes.
Meeting times of non-atomic random walks 査読国際共著国際誌

Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, and Sebastien Tixeuil

25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2023年10月

　詳細を見る

In this paper, we revisit the problem of classical meeting times of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected times until they meet when the two agents are initially located at different vertices. A key feature of the problem is that, in each discrete time-clock (called round) of the process, the scheduler selects only one of the two agents, and the agent performs one move of the random walk. In the adversarial setting, the scheduler utilizes the strategy that intends to maximizing the expected time to meet. In the seminal papers [5, 11, 18], for the random walks of two agents, the notion of atomicity is implicitly considered. That is, each move of agents should complete while the other agent waits. In this paper, we consider and formalize the meeting time of non-atomic random walks. In the non-atomic random walks, we assume that in each round, only one agent can move but the move does not necessarily complete in the next round. In other words, we assume that an agent can move at a round while the other agent is still moving on an edge. For the non-atomic random walks with the adversarial schedulers, we give a polynomial upper bound on the meeting times.
Location Functions for Self-Stabilizing Byzantine Tolerant Swarms 査読国際共著

Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada

Theoretical Computer Science 954 2023年4月

　詳細を見る

This paper proposes a novel framework to realize self-stabilizing Byzantine tolerant swarms. In this framework, non-Byzantine robots execute tasks while satisfying location functions. That is, the robots use a policy for their location choice, which restricts their location to satisfy the functions. We give a general Byzantine-resilient self-stabilizing algorithm based on the location function. Then we provide an efficient implementation of the self-stabilizing algorithms for special classes of tasks, called polynomial-based tasks and shape-based tasks. We also demonstrate the usefulness of the proposed framework by implementing typical tasks of robots.
Weakly Byzantine Gathering with a Strong Team 査読

Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue

IEICE Transactions on Information and Systems E105-D ( 3 ) 2022年3月

　詳細を見る

We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of k agents with unique identifiers (IDs), and f of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agents move in synchronous rounds and cannot leave any information on nodes. If the number of nodes n is given to agents, the existing fastest algorithm tolerates any number of weakly Byzantine agents and achieves gathering with simultaneous termination in O(n^4·|Λgood|·X(n)) rounds, where |Λgood| is the length of the maximum ID of non-Byzantine agents and X(n) is the number of rounds required to explore any network composed of n nodes. In this paper, we ask the question of whether we can reduce the time complexity if we have a strong team, i.e., a team with a few Byzantine agents, because not so many agents are subject to faults in practice. We give a positive answer to this question by proposing two algorithms in the case where at least 4f^2+9f+4 agents exist. Both the algorithms assume that the upper bound N of n is given to agents. The first algorithm achieves gathering with non-simultaneous termination in O((f+|Λgood|)·X(N)) rounds. The second algorithm achieves gathering with simultaneous termination in O((f+|Λall|)·X(N)) rounds, where |Λall| is the length of the maximum ID of all agents. The second algorithm significantly reduces the time complexity compared to the existing one if n is given to agents and |Λall|=O(|Λgood|) holds.
Terminating grid exploration with myopic luminous robots 査読

Shota Nagahama, Fukuhito Ooshita, and Michiko Inoue

International Journal of Networking and Computing 2022年1月

　詳細を見る

We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and luminous robots mean that they have light devices that can emit colors. First, we prove that, in the semi-synchronous and asynchronous models, three myopic robots are necessary to achieve the terminating grid exploration if the visible distance is one. Next, we give fourteen algorithms for the terminating grid exploration in various assumptions of synchrony (fully-synchronous, semi-synchronous, and asynchronous models), visible distance, the number of colors, and a chirality. Six of them are optimal in terms of the number of robots.
Eventually consistent distributed ledger despite degraded atomic broadcast 査読国際共著

Gregory Benassy, Fukuhito Ooshita, and Michiko Inoue

Concurrency and Computation: Practice and Experience 2021年1月

　詳細を見る

The distributed ledger or blockchain technologies originated from the Bitcoin have been rapidly widespread in recent years. However, it also gives incentive to malicious users who would like to break the system or take advantage of it (steal money, hide some information stored in the ledger, isolate a particular node from the rest of the network, and so forth). Thus, research focusing on overcoming potential attacks to distributed ledgers is required. In this article, we focus on attacks that damage underlying networks of distributed ledgers. Underlying networks offer useful communication primitives such as an atomic broadcast, however, such attacks may degrade the property of the primitives and make distributed ledgers relying on the primitives no longer work. Hence we should design algorithms to make the distributed ledgers still work even when some attacks degrade the primitives. As the first study for such situations, we consider a problem to implement distributed ledgers tolerating the degradation of an underlying atomic broadcast service that distributed ledgers are relying on. We consider the case where the uniform agreement property of the atomic broadcast is degraded, and propose new algorithms that could ensure to reach eventual consistency despite degraded atomic broadcast.
Forgive & Forget: Self-stabilizing swarms in spite of Byzantine robots 査読国際共著

Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, and Koichi Wada

Concurrency and Computation: Practice and Experience 2020年11月

　詳細を見る

In this article, we consider the case in which a swarm of robots collaborates in a mission, where a few of the robots behave maliciously. These malicious Byzantine robots may be temporally or constantly controlled by an adversary. The scope is synchronized full information robot operations, where a robot that does not follow the program/policy of the swarm is immediately identified and can be remembered as Byzantine. As robots may be suspected of being Byzantine due to benign temporal malfunctions, it is imperative to forgive and forget, otherwise, a robot cannot assume collaborative actions with any other robot in the swarm. Still, remembering for a while may facilitate a policy of surrounding, isolating and freezing the movement of the misbehaving robots, by several robots, allowing the rest to perform the swarm task with no intervention. We demonstrate the need to periodically forgive and forget to realize swarm several tasks including patrolling/cleaning in the presence of possible Byzantine robots. The policy for achieving the task consists of blocking the movement of the Byzantine robot(s) by some of the robots, while the rest patrol/clean the plane.
Byzantine-tolerant gathering of mobile agents in asynchronous arbitrary networks with authenticated whiteboards 査読

Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue

IEICE Transactions on Information and Systems E103-D ( 7 ) 1672 - 1682 2020年7月
Dynamic ring exploration with (H, S) view 査読

Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, and Toshimitsu Masuzawa

Algorithms 13 ( 6 ) 2020年6月
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings 査読

Masahiro Shibata, Norikazu Kawata, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 822 ( 24 ) 92 - 109 2020年6月
Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers 査読

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E103-D ( 3 ) 489 - 499 2020年3月
Loosely-stabilizing leader election with polylogarithmic convergence time 査読国際共著

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, and Lawrence L. Larmore

Theoretical Computer Science 806 617 - 631 2020年2月
Loosely-stabilizing leader election for arbitrary graphs in population protocol model 査読国際共著

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, and Lawrence L. Larmore

IEEE Transactions on Parallel and Distributed Systems 30 ( 6 ) 1359 - 1373 2019年6月
Partial gathering of mobile agents in arbitrary networks 査読

Masahiro Shibata, Daisuke Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E102-D ( 3 ) 444 - 453 2019年3月
Space-optimal population protocols for uniform bipartition under global fairness 査読

Hiroto Yasumi, Fukuhito Ooshita, Ken'ichi Yamaguchi, and Michiko Inoue

IEICE Transactions on Information and Systems E102-D ( 3 ) 454 - 463 2019年3月
A population protocol for uniform k-partition under global fairness 査読

Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, and Michiko Inoue

International Journal of Networking and Computing 9 ( 1 ) 97 - 110 2019年1月
Uniform deployment of mobile agents in asynchronous rings 査読

Masahiro Shibata, Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Journal of Parallel and Distributed Computing 119 92 - 106 2018年9月
Byzantine-tolerant gathering of mobile agents in arbitrary networks with authenticated whiteboards 査読

Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue

IEICE Transactions on Information and Systems E101-D ( 3 ) 602 - 610 2018年3月
Move-optimal partial gathering of mobile agents in asynchronous trees 査読

Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 705 9 - 30 2018年1月
Partial gathering of mobile agents in asynchronous unidirectional rings 査読

Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 617 1 - 11 2016年2月
An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks 査読

Yuma Asada, Fukuhito Ooshita, and Michiko Inoue

Journal of Graph Algorithms and Applications 20 ( 1 ) 59 - 78 2016年2月
A single agent exploration in unknown undirected graphs with whiteboards 査読

Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98-A ( 10 ) 2117 - 2128 2015年10月
フィジカル・インタラクションを使ったプログラミング学習のための教材開発と実践査読

有賀妙子，森公一，大下福仁，角川裕次，増澤利光

情報処理学会論文誌「教育とコンピュータ」トランザクション 2015年9月
On the self-stabilization of mobile oblivious robots in uniform rings 査読国際共著

Fukuhito Ooshita and Sebastien Tixeuil

Theoretical Computer Science 568 84 - 96 2015年2月
Randomized gathering of mobile agents in anonymous unidirectional ring networks 査読

Fukuhito Ooshita, Shinji Kawai, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEEE Transactions on Parallel and Distributed Systems 25 ( 5 ) 1289 - 1296 2014年5月
Analysis of distributed token circulation algorithm with faulty random number generator 査読

Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Parallel Processing Letters 24 ( 1 ) 2014年3月
Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings 査読

Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, and Fukuhito Ooshita

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96-A ( 630 ) 1072 - 1080 2013年6月
Hierarchical low power consumption technique with local information for sensor networks 査読

Susumu Matsumae and Fukuhito Ooshita

International Journal of Advanced Computer Science and Applications 4 ( 4 ) 69 - 74 2013年5月
Feasibility of polynomial-time randomized gathering for oblivious mobile robots 査読

Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, and Fukuhito Ooshita

IEEE Transactions on Parallel and Distributed Systems 24 ( 4 ) 716 - 723 2013年4月
Linear time and space gathering of anonymous mobile agents in asynchronous trees 査読

Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 478 118 - 126 2013年3月
Loosely-stabilizing leader election in population protocol model 査読

Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 444 100 - 112 2012年7月
The price of multi-organization constraint in unrelated parallel machine scheduling 査読

Fukuhito Ooshita, Tomoko Izumi, and Taisuke Izumi

Parallel Processing Letters 22 ( 2 ) 2012年6月
Timer-based composition of fault-containing self-stabilizing protocols 査読

Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Information Sciences 180 ( 10 ) 1802 - 1816 2010年5月
An ant colony optimization routing based on robustness for ad hoc networks with GPSs 査読

Daisuke Kadono, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Ad Hoc Networks 8 ( 1 ) 63 - 76 2010年1月
A self-adaptive routing protocol in wireless LANs based on attractor selection 査読

Gen Nishikawa, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E92-D ( 10 ) 2016 - 2024 2009年10月
A biologically inspired self-adaptation of replica density control 査読

Tomoko Izumi, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E92-D ( 5 ) 1125 - 1136 2009年5月
Distributed construction protocols of probabilistic degree-weighted peer-to-peer overlays 査読

Yu Wu, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E92-D ( 4 ) 563 - 574 2009年4月
Hierarchical composition of self-stabilizing protocols preserving the fault-containment property 査読

Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E92-D ( 3 ) 451 - 459 2009年3月
A message-efficient peer-to-peer search protocol based on adaptive index dissemination 査読

Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E92-D ( 2 ) 258 - 268 2009年2月
アルゴリズム学習における間違い探し形式の演習課題を自動生成する手法の提案と評価査読

長瀧寛之，伊藤亮太，大下福仁，角川裕次，増澤利光

情報処理学会論文誌 49 ( 10 ) 3366 - 3376 2008年10月
構造化オーバレイネットワークにおける故障耐性向上のための経路多重化法査読

乾広二，鈴木朋子，大下福仁，角川裕次，増澤利光

電子情報通信学会論文誌 J91-D ( 5 ) 1261 - 1274 2008年5月
Move-optimal gossiping among mobile agents 査読

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Theoretical Computer Science 393 ( 1-3 ) 90 - 101 2008年3月
モバイルアドホックネットワークにおける公平性の高い自己安定相互排除プロトコル査読

西川元，山内由紀子，大下福仁，角川裕次，増澤利光

電子情報通信学会論文誌 J91-A ( 2 ) 279 - 284 2008年2月
Scheduling for independent-task applications on heterogeneous parallel computing environments under the unidirectional one-port model 査読

Fukuhito Ooshita, Susumu Matsumae, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E90-D ( 2 ) 403 - 417 2007年2月
Self-adaptive mobile agent population control in dynamic networks based on the single species population model 査読

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, and Toshimitsu Masuzawa

IEICE Transactions on Information and Systems E90-D ( 1 ) 314 - 324 2007年1月
無線ネットワークにおける距離2の彩色を利用したTDMAスケジュール手法査読

山内由紀子，中南良浩，大下福仁，増澤利光

情報処理学会論文誌 48 ( 1 ) 327 - 341 2007年1月
A self-stabilizing link-coloring protocol in tree networks with permanent Byzantine faults 査読

Yusuke Sakurai, Fukuhito Ooshita, and Toshimitsu Masuzawa

Journal of Aerospace Computing, Information, and Communication 3 ( 8 ) 420 - 436 2006年8月
通信遅延が大きな並列計算環境に対するタスクスケジュールのためのクラスタリングアルゴリズム査読

野口智史，大下福仁，増澤利光

情報処理学会論文誌コンピューティングシステム 45 ( SIG11(ACS7) ) 257 - 268 2004年10月
Scheduling for gather operation in heterogeneous parallel computing environments 査読

Fukuhito Ooshita, Susumu Matsumae, and Toshimitsu Masuzawa

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E86-A ( 4 ) 908 - 918 2003年4月
異種並列計算環境におけるブロードキャストスケジューリング査読

大下福仁，松前進，増澤利光，都倉信樹

電子情報通信学会論文誌 J-86-D-I ( 2 ) 88 - 98 2003年2月

▼全件表示

講演・口頭発表等

Meeting times of non-atomic random walks 国際共著

Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, and Sebastien Tixeuil

2023年9月
Extended maximal P-star partition and its self-stabilizing solution

Haruki Chaen, Ryota Eguchi, Fukuhito Ooshita, and Michiko Inoue

2023年9月
Gathering despite a linear number of weakly Byzantine agents 国際会議

Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue

14th International Workshop on Parallel and Distributed Algorithms and Applications (PDAA) 2022年11月
Brief announcement: Gathering despite a linear number of weakly Byzantine agents 国際会議

Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue

41st ACM Symposium on Principles of Distributed Computing (PODC) 2022年7月

　詳細を見る

We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist k agents with unique identifiers (IDs) in the network, and f of them are weakly Byzantine agents, which behave arbitrarily except for falsifying their IDs. The agents behave in synchronous rounds, and each node does not have any memory like a whiteboard. In the literature, there exists a gathering algorithm that tolerates any number of Byzantine agents, while the fastest gathering algorithm requires Ω( f 2) non-Byzantine agents.
How to simulate message-passing algorithms in mobile agent systems with faults 国際会議

Tsuyoshi Gotoh, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa

19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2017年11月
An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks 国際共著国際会議

Michiko Inoue, Fukuhito Ooshita and Sebastien Tixeuil

19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2017年11月
Self-stabilizing rendezvous of synchronous mobile agents in graphs 国際共著国際会議

Fukuhito Ooshita, Ajoy K. Datta and Toshimitsu Masuzawa

19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2017年11月
Constant-space population protocols for uniform bipartition 国際会議

Hiroto Yasumi, Fukuhito Ooshita, Ken'ichi Yamaguchi, and Michiko Inoue

21st International Conference on Principles of Distributed Systems (OPODIS) 2017年12月
Gathering of mobile agents in asynchronous Byzantine environments with authenticated whiteboards 国際会議

Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue

6th Edition of the International Conference on Networked Systems (NETYS) 2018年5月
A population protocol for uniform k-partition under global fairness 国際会議

Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, and Michiko Inoue

20th Workshop on Advances in Parallel and Distributed Computational Models (APDCM) 2018年5月
Group exploration of dynamic tori 国際会議

Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

38th IEEE International Conference on Distributed Computing Systems (ICDCS) 2018年7月
Brief announcement: Loosely-stabilizing leader election with polylogarithmic convergence time 国際会議

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

32nd International Symposium on Distributed Computing (DISC) 2018年10月
Ring exploration with myopic luminous robots 国際共著国際会議

Fukuhito Ooshita and Sebastien Tixeuil

20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2018年11月
Brief announcement: Feasibility of weak gathering in connected-over-time dynamic rings 国際共著国際会議

Fukuhito Ooshita and Ajoy K. Datta

20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2018年11月
Loosely-stabilizing leader election with polylogarithmic convergence time 国際共著国際会議

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, and Lawrence L. Larmore

22nd International Conference on Principles of Distributed Systems (OPODIS) 2018年12月
A Rapid feasibility checking for reconfiguration of mismatched PV arrays 国際会議

Dafang Zhao, Fukuhito Ooshita, and Michiko Inoue

46th IEEE Photovoltaic Specialists Conference (PVSC) 2019年6月
Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings 国際会議

Masahiro Shibata, Norikazu Kawata, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2019年7月
Brief announcement: Logarithmic expected-time leader election in population protocol model 国際会議

Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

38th ACM Symposium on Principles of Distributed Computing (PODC) 2019年7月
Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of Look-Compute-Move robots 国際共著国際会議

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada

33rd International Symposium on Distributed Computing (DISC) 2019年10月
Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots 国際共著国際会議

Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, and Koichi Wada

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2019年10月
Brief announcement: Self-stabilizing LCM schedulers for autonomous mobile robots using neighborhood mutual remainder 国際共著国際会議

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2019年10月
Ring exploration of myopic luminous robots with visibility more than one 国際会議

Shota Nagahama, Fukuhito Ooshita, and Michiko Inoue

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2019年10月
Logarithmic expected-time leader election in population protocol model 国際会議

Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2019年10月
Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view 国際会議

Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, and Toshimitsu Masuzawa

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2019年10月
Black hole search despite Byzantine agents 国際会議

Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2019年10月
Eventually consistent distributed ledger relying on degraded atomic broadcast 国際共著国際会議

Gregory Benassy, Fukuhito Ooshita, and Michiko Inoue

11th International Workshop on Parallel and Distributed Algorithms and Applications (PDAA) 2019年11月
Forgive & Forget: Self-stabilizing swarms in spite of Byzantine robots 国際共著国際会議

Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, and Koichi Wada

11th International Workshop on Parallel and Distributed Algorithms and Applications (PDAA) 2019年11月
Gathering on rings for myopic asynchronous robots with lights 国際共著国際会議

Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sebastien Tixeuil, and Koichi Wada

23rd International Conference on Principles of Distributed Systems (OPODIS) 2019年12月
Uniform partition in population protocol model under weak fairness 国際会議

Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue

23rd International Conference on Principles of Distributed Systems (OPODIS) 2019年12月
Brief announcement: Gathering with a strong team in weakly Byzantine environments 国際会議

Jion Hirose, Masashi Tsuchida, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue

27th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2020年6月
Uniform bipartition in population protocol model with arbitrary communication graphs 国際共著国際会議

Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, and Sebastien Tixeuil

24th International Conference on Principles of Distributed Systems (OPODIS) 2020年12月
Gathering with a strong team in weakly Byzantine environments 国際会議

Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue

22nd International Conference on Distributed Computing and Networking (ICDCN) 2021年1月
Terminating grid exploration with myopic luminous robots 国際会議

Shota Nagahama, Fukuhito Ooshita, and Michiko Inoue

23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM) 2021年5月
Location Functions for Self-Stabilizing Byzantine Tolerant Swarms 国際共著国際会議

Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada

23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2021年11月
Asynchronous gathering in a torus 国際共著国際会議

Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sebastien Tixeuil, and Koichi Wada

25th International Conference on Principles of Distributed Systems (OPODIS) 2021年12月
Population protocols for graph class identification problems 国際会議

Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue

25th International Conference on Principles of Distributed Systems (OPODIS) 2021年12月
Brief announcement: Efficient self-stabilizing 1-maximal matching algorithm for arbitrary networks 国際共著国際会議

Michiko Inoue, Fukuhito Ooshita, and Sebastien Tixeuil

36th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) 2017年7月
Efficient gather operation in heterogeneous cluster systems 国際会議

Fukuhito Ooshita, Susumu Matsumae, and Toshimitsu Masuzawa

16th Annual International Symposium on High Performance Computing Systems and Applications (HPCS) 2002年6月
A self-stabilizing link-coloring protocol resilient to Byzantine faults in tree networks 国際会議

Yusuke Sakurai, Fukuhito Ooshita, and Toshimitsu Masuzawa

8th International Conference on Principles of Distributed Systems (OPODIS) 2004年12月
Self-adaptation of mobile agent population in dynamic networks: A biologically inspired approach 国際会議

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, and Toshimitsu Masuzawa

2nd IEEE International Conference on Autonomic Computing (ICAC) 2005年6月
Biologically inspired self-adaptation of mobile agent population 国際会議

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, and Toshimitsu Masuzawa

3rd International Workshop on Self-Adaptable and Autonomic Computing Systems (SAACS) 2005年8月
Bio-inspired replica density control in dynamic networks 国際会議

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

2nd International Workshop on Biologically Inspired Approaches to Advanced Information Technology (Bio-ADIT) 2006年1月
Scheduling independent tasks on heterogeneous parallel computing environments under the unidirectional one-port model 国際会議

Fukuhito Ooshita, Susumu Matsumae, and Toshimitsu Masuzawa

2006 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA) 2006年6月
Composition of fault-containing protocols based on recovery waiting fault-containing composition framework 国際会議

Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

8th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2006年11月
An adaptive randomised searching protocol in peer-to-peer systems based on probabilistic weak quorum system 国際会議

Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

8th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2006年11月
An adaptive randomized searching protocol in peer-to-peer systems 国際会議

Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

22nd Annual ACM Symposium on Applied Computing (SAC) 2007年3月
Optimal moves for gossiping among mobile agents 国際会議

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

14th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2007年6月
A fault injection method for generating error-correction exercises in algorithm learning 国際会議

Ryota Itoh, Hiroyuki Nagataki, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

8th International Conference on Information Technology Based Higher Education and Training (ITHET) 2007年7月
A robust based ant colony optimization routing for ad hoc networks with GPSs 国際会議

Daisuke Kadono, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

2008 International Conference on Wireless Networks (ICWN) 2008年7月
Timer-based composition of fault-containing self-stabilizing protocols 国際会議

Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

International Symposium on Intelligent Distributed Computing (IDC) 2008年9月
Clustering algorithm for mobile ad-hoc networks to improve the stability of clusters 国際会議

Yukiko Yamauchi, Takeshi Itou, Gen Nishikawa, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

IASTED International Conference on Sensor Networks (SN) 2008年9月
A stable clustering algorithm for mobile ad hoc networks based on attractor selection 国際会議

Gen Nishikawa, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

1st International Workshop on Technologies for Ambient Information Society (TAIS) 2008年11月
Output stability of self-stabilizing protocols against topology changes and transient faults 国際会議

Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

8th International Conference on Applications and Principles of Information Science (APIS) 2009年1月
A resource replication protocol based on node density for mobile ad hoc networks 国際会議

Rikiya Hasegawa, Yu Wu, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

8th International Conference on Applications and Principles of Information Science (APIS) 2009年1月
Upper bound on cell size for hierarchical GAF 国際会議

Susumu Matsumae and Fukuhito Ooshita

8th International Conference on Applications and Principles of Information Science (APIS) 2009年1月
Probabilistic gathering of mobile robots with weak multiplicity-detection capabilities 国際会議

Taisuke Izumi, Tomoko Suzuki, Sayaka Kamei, and Fukuhito Ooshita

2nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC) 2009年4月
Loosely-stabilizing leader election in population protocol model 国際会議

Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

16th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2009年5月
Experimental evaluation of a clustering algorithm based on attractor selection 国際会議

Naoko Uemura, Gen Nishikawa, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

2009 International Symposium on Nonlinear Theory and its Applications (NOLTA) 2009年10月
Randomized gathering of mobile robots with local-multiplicity detection 国際会議

Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, and Fukuhito Ooshita

11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2009年11月
A generalized multi-organization scheduling on unrelated parallel machines 国際会議

Fukuhito Ooshita, Tomoko Izumi, and Taisuke Izumi

10th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) 2009年12月
Mobile agents rendezvous in tree networks 国際会議

Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

2nd International Workshop on Reliability, Availability, and Security (WRAS) 2009年12月
A distributed algorithm to update spanning trees minimizing the number of output changes 国際会議

Atsushi Takada, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

2nd International Workshop on Reliability, Availability, and Security (WRAS) 2009年12月
Space-optimal rendezvous of mobile agents in asynchronous trees 国際会議

Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

17th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2010年6月
Mobile robots gathering algorithm with local weak multiplicity in rings 国際会議

Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, and Fukuhito Ooshita

17th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2010年6月
An agent exploration in unknown undirected graphs with whiteboards 国際会議

Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

third ACM International Workshop on Reliability, Availability, and Security (WRAS) 2010年7月
Evaluation of self-stabilizing token circulation algorithm with faulty random number generators 国際会議

Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Workshop on Dependability of Network Software Applications (DNSA) 2010年11月
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection 国際共著国際会議

Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, and Sebastien Tixeuil

18th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2011年6月
Randomized rendezvous of mobile agents in anonymous unidirectional ring networks 国際会議

Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

19th International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2012年7月
Gathering an even number of robots in an odd ring without global multiplicity detection 国際共著国際会議

Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, and Sebastien Tixeuil

37th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2012年8月
Communication-efficient self-stabilization in wireless networks 国際会議

Tomoya Takimoto, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2012年10月
On the self-stabilization of mobile oblivious robots in uniform rings 国際共著国際会議

Fukuhito Ooshita and Sebastien Tixeuil

14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2012年10月
Algorithms for partial gathering of mobile agents in asynchronous rings 国際会議

Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

16th International Conference on Principles of Distributed Systems (OPODIS) 2012年12月
Zigzag: Local-information-based self-optimizing routing in virtual grid networks 国際会議

Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

33rd International Conference on Distributed Computing Systems (ICDCS) 2013年7月
Move-optimal partial gathering of mobile agents in asynchronous trees 国際会議

Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) 2014年7月
Asynchronous ring gathering by oblivious robots with limited vision 国際共著国際会議

Sayaka Kamei, Anissa Lamani, and Fukuhito Ooshita

Workshop on Self-organization in Swarm of Robots: from Molecular Robots to Mobile Agents (WSSR) 2014年10月
Loosely-stabilizing leader election on arbitrary graphs in population protocols 国際会議

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

18th International Conference on Principles of Distributed Systems (OPODIS) 2014年12月
Ring gathering by robots with limited vision 国際共著国際会議

Sayaka Kamei, Anissa Lamani, and Fukuhito Ooshita

8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC) 2015年5月
An algorithm for partial gathering of mobile agents in arbitrary networks 国際会議

Masahiro Shibata, Daisuke Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

Workshop on Distributed Robotic Swarms (WDRS) 2015年10月
Realization of an efficient concurrent partial snapshot algorithm for large-scale and dynamic distributed systems 国際会議

Rentaro Watanabe, Yonghwan Kim, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

5th International Workshop on Networking, Computing, Systems, and Software (NCSS) 2015年12月
Loosely-stabilizing leader election on arbitrary graphs in population protocols without identifiers nor random numbers 国際会議

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

19th International Conference on Principles of Distributed Systems (OPODIS) 2015年12月
Uniform deployment of mobile agents in asynchronous rings 国際会議

Masahiro Shibata, Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) 2016年7月
An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers 国際共著国際会議

Michiko Inoue, Fukuhito Ooshita, and Sebastien Tixeuil

18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) 2016年11月
Byzantine gathering in networks with authenticated whiteboards 国際会議

Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue

11th International Workshop on Algorithms and Computation (WALCOM) 2017年3月

▼全件表示

受賞

PDAA best paper award

2022年11月

Jion Hirose, Junya Nakamura, Fukuhito Ooshita and Michiko Inoue

担当経験のある授業科目

コンピュータアーキテクチャ

2022年

-

現在
機関名：福井工業大学
電気電子工学実験II

2022年

-

現在
機関名：福井工業大学
電気数学II

2022年

-

現在
機関名：福井工業大学
コンピュータ言語II

2022年

-

現在
機関名：福井工業大学
並列分散処理

2019年
機関名：大阪電気通信大学
分散コンピューティング論

2019年
機関名：奈良先端科学技術大学院大学
アルゴリズム設計論

2016年

-

2021年
機関名：奈良先端科学技術大学院大学
情報活用基礎

2013年

-

2015年
機関名：大阪大学
プログラミングD

2003年

-

2012年
機関名：大阪大学
情報科学実験A

2003年

-

2012年
機関名：大阪大学

▼全件表示