Updated on 2024/01/10

写真a

 
Fukuhito Ooshita
 

Degree

  • Doctor (Engineering)   Coursework ( 2002.3   Osaka University )

Research Areas

  • Informatics / Software

  • Informatics / Theory of informatics

Education

  • Osaka University   Advanced a Year

    1997.4 - 2000.3

  • Osaka University   Master's Course   Completed

    2000.4 - 2002.3

  • Osaka University   Doctor's Course   Unfinished

    2002.4 - 2003.3

Research History

  • Osaka University   Research Assistant

    2003.4 - 2007.3

  • Osaka University   Assistant Professor

    2007.4 - 2015.6

  • Nara Institute of Science and Technology   Associate Professor

    2015.7 - 2018.3

  • Nara Institute of Science and Technology   Associate Professor

    2018.4 - 2022.3

  • Fukui University of Technology   Professor

    2022.4

 

Papers

  • A near time-optimal population protocol for self-stabilizing leader election on rings with a poly-logarithmic number of states Reviewed International journal

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

    42nd ACM Symposium on Principles of Distributed Computing (PODC)   2023.7

    　More details

    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 Reviewed International coauthorship

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

    Theoretical Computer Science   892   187 - 207   2021.9

    　More details

    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 Reviewed International coauthorship

    Fukuhito Ooshita and Sebastien Tixeuil

    Information and Computation   2021.1

    　More details

    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 Reviewed

    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 Reviewed

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

    IEEE Transactions on Parallel and Distributed Systems   31 ( 11 )   2620 - 2632   2020.11

    　More details

    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 Reviewed International coauthorship

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

    Acta Informatica   2023.12

    　More details

    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 Reviewed

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

    15th International Workshop on Parallel and Distributed Algorithms and Applications (PDAA)   2023.11

    　More details

    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 Reviewed International coauthorship International journal

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

    25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)   2023.10

    　More details

    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 Reviewed International coauthorship

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

    Theoretical Computer Science   954   2023.4

    　More details

    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 Reviewed

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

    IEICE Transactions on Information and Systems   E105-D ( 3 )   2022.3

    　More details

    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 Reviewed

    Shota Nagahama, Fukuhito Ooshita, and Michiko Inoue

    International Journal of Networking and Computing   2022.1

    　More details

    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 Reviewed International coauthorship

    Gregory Benassy, Fukuhito Ooshita, and Michiko Inoue

    Concurrency and Computation: Practice and Experience   2021.1

    　More details

    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 Reviewed International coauthorship

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

    Concurrency and Computation: Practice and Experience   2020.11

    　More details

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed International coauthorship

    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 Reviewed International coauthorship

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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

  • On the design of learning materials for supporting physical interactive programming Reviewed

    Taeko Ariga, Koichi Mori, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa

    IPSJ Journal   2015.9

  • On the self-stabilization of mobile oblivious robots in uniform rings Reviewed International coauthorship

    Fukuhito Ooshita and Sebastien Tixeuil

    Theoretical Computer Science   568   84 - 96   2015.2

  • Randomized gathering of mobile agents in anonymous unidirectional ring networks Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    Fukuhito Ooshita, Tomoko Izumi, and Taisuke Izumi

    Parallel Processing Letters   22 ( 2 )   2012.6

  • Timer-based composition of fault-containing self-stabilizing protocols Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

    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 Reviewed

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

    IEICE Transactions on Information and Systems   E92-D ( 2 )   258 - 268   2009.2

  • A fault injection method for generating error-correction exercises in algorithm learning Reviewed

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

    IPSJ Journal   49 ( 10 )   3366 - 3376   2008.10

  • A multiple path based approach for achieving fault tolerance on structured overlay networks Reviewed

    Koji Inui, Tomoko Suzuki, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa

    IEICE Transactions on Information and Systems   J91-D ( 5 )   1261 - 1274   2008.5

  • Move-optimal gossiping among mobile agents Reviewed

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

    Theoretical Computer Science   393 ( 1-3 )   90 - 101   2008.3

  • A fair self-stabilizing mutual exclusion protocol for mobile ad hoc networks Reviewed

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

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   J91-A ( 2 )   279 - 284   2008.2

  • Scheduling for independent-task applications on heterogeneous parallel computing environments under the unidirectional one-port model Reviewed

    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 Reviewed

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

    IEICE Transactions on Information and Systems   E90-D ( 1 )   314 - 324   2007.1

  • TDMA slot assignment for wireless networks based on distance-2 graph coloring Reviewed

    Yukiko Yamauchi, Yoshihiro Nakaminami, Fukuhito Ooshita, and Toshimitsu Masuzawa

    IPSJ Journal   48 ( 1 )   327 - 341   2007.1

  • A self-stabilizing link-coloring protocol in tree networks with permanent Byzantine faults Reviewed

    Yusuke Sakurai, Fukuhito Ooshita, and Toshimitsu Masuzawa

    Journal of Aerospace Computing, Information, and Communication   3 ( 8 )   420 - 436   2006.8

  • A clustering algorithm for task scheduling in parallel computing environments with large communication delays Reviewed

    Satoshi Noguchi, Fukuhito Ooshita, and Toshimitsu Masuzawa

    IPSJ Transaction   45 ( SIG11(ACS7) )   257 - 268   2004.10

  • Scheduling for gather operation in heterogeneous parallel computing environments Reviewed

    Fukuhito Ooshita, Susumu Matsumae, and Toshimitsu Masuzawa

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E86-A ( 4 )   908 - 918   2003.4

  • Scheduling for broadcast operation in heterogeneous parallel computing environments Reviewed

    Fukuhito Ooshita, Susumu Matsumae, Toshimitsu Masuzawa, and Nobuki Tokura

    IEICE Transactions on Information and Systems   J-86-D-I ( 2 )   88 - 98   2003.2

▼display all

Presentations

  • Meeting times of non-atomic random walks International coauthorship

    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 International conference

    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 International conference

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

    41st ACM Symposium on Principles of Distributed Computing (PODC)  2022.7 

    　More details

    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.

  • Location Functions for Self-Stabilizing Byzantine Tolerant Swarms International coauthorship International conference

    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 International coauthorship International conference

    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 International conference

    Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue

    25th International Conference on Principles of Distributed Systems (OPODIS)  2021.12 

  • Terminating grid exploration with myopic luminous robots International conference

    Shota Nagahama, Fukuhito Ooshita, and Michiko Inoue

    23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM)  2021.5 

  • Mobile robots gathering algorithm with local weak multiplicity in rings International conference

    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 International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

    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 International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

    Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue

    11th International Workshop on Algorithms and Computation (WALCOM)  2017.3 

  • Brief announcement: Efficient self-stabilizing 1-maximal matching algorithm for arbitrary networks International coauthorship International conference

    Michiko Inoue, Fukuhito Ooshita, and Sebastien Tixeuil

    36th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)  2017.7 

  • How to simulate message-passing algorithms in mobile agent systems with faults International conference

    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 International coauthorship International conference

    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 International coauthorship International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

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

    32nd International Symposium on Distributed Computing (DISC)  2018.10 

  • Ring exploration with myopic luminous robots International coauthorship International conference

    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 International coauthorship International conference

    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 International coauthorship International conference

    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 International conference

    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 International conference

    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 International conference

    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 International coauthorship International conference

    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 International coauthorship International conference

    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 International coauthorship International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International coauthorship International conference

    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 International coauthorship International conference

    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 International coauthorship International conference

    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 International conference

    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 International conference

    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 International coauthorship International conference

    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 International conference

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

    22nd International Conference on Distributed Computing and Networking (ICDCN)  2021.1 

  • Space-optimal rendezvous of mobile agents in asynchronous trees International conference

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

    17th International Colloquium on Structural Information and Communication Complexity (SIROCCO)  2010.6 

  • Efficient gather operation in heterogeneous cluster systems International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

    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 International conference

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

    2nd International Workshop on Reliability, Availability, and Security (WRAS)  2009.12 

▼display all

Awards

  • PDAA best paper award

    2022.11  

    Jion Hirose, Junya Nakamura, Fukuhito Ooshita and Michiko Inoue