Fukuhito Ooshita
Fukuhito Ooshita
Verified email at is.naist.jp
Title
Cited by
Cited by
Year
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection
S Kamei, A Lamani, F Ooshita, S Tixeuil
International Colloquium on Structural Information and Communicationá…, 2011
632011
Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings
T Izumi, T Izumi, S Kamei, F Ooshita
IEICE Transactions on Fundamentals of Electronics, Communications andá…, 2013
59*2013
An ant colony optimization routing based on robustness for ad hoc networks with GPSs
D Kadono, T Izumi, F Ooshita, H Kakugawa, T Masuzawa
Ad Hoc Networks 8 (1), 63-76, 2010
542010
Feasibility of polynomial-time randomized gathering for oblivious mobile robots
T Izumi, T Izumi, S Kamei, F Ooshita
IEEE Transactions on Parallel and Distributed Systems 24 (4), 716-723, 2013
51*2013
A self-stabilizing link-coloring protocol in tree networks with permanent byzantine faults
Y Sakurai, F Ooshita, T Masuzawa
Journal of Aerospace Computing, Information, and Communication 3 (8), 420-436, 2006
50*2006
Loosely-stabilizing leader election in a population protocol model
Y Sudo, J Nakamura, Y Yamauchi, F Ooshita, H Kakugawa, T Masuzawa
Theoretical Computer Science 444, 100-112, 2012
422012
Gathering an even number of robots in an odd ring without global multiplicity detection
S Kamei, A Lamani, F Ooshita, S Tixeuil
International Symposium on Mathematical Foundations of Computer Science, 542-553, 2012
372012
Uniform deployment of mobile agents in asynchronous rings
M Shibata, T Mega, F Ooshita, H Kakugawa, T Masuzawa
Journal of Parallel and Distributed Computing 119, 92-106, 2018
302018
Linear time and space gathering of anonymous mobile agents in asynchronous trees
D Baba, T Izumi, F Ooshita, H Kakugawa, T Masuzawa
Theoretical Computer Science 478, 118-126, 2013
28*2013
Time-optimal leader election in population protocols
Y Sudo, F Ooshita, T Izumi, H Kakugawa, T Masuzawa
IEEE Transactions on Parallel and Distributed Systems 31 (11), 2620-2632, 2020
27*2020
On the self-stabilization of mobile oblivious robots in uniform rings
F Ooshita, S Tixeuil
Theoretical Computer Science 568, 84-96, 2015
232015
Randomized gathering of mobile agents in anonymous unidirectional ring networks
F Ooshita, S Kawai, H Kakugawa, T Masuzawa
IEEE Transactions on Parallel and Distributed Systems 25 (5), 1289-1296, 2013
20*2013
A single agent exploration in unknown undirected graphs with whiteboards
Y Sudo, D Baba, J Nakamura, F Ooshita, H Kakugawa, T Masuzawa
IEICE Transactions on Fundamentals of Electronics, Communications andá…, 2015
19*2015
Loosely-stabilizing leader election with polylogarithmic convergence time
Y Sudo, F Ooshita, H Kakugawa, T Masuzawa, AK Datta, LL Larmore
Theoretical Computer Science 806, 617-631, 2020
182020
Loosely stabilizing leader election on arbitrary graphs in population protocols without identifiers or random numbers
Y Sudo, F Ooshita, H Kakugawa, T Masuzawa
IEICE Transactions on Information and Systems 103 (3), 489-499, 2020
14*2020
Loosely-stabilizing leader election on arbitrary graphs in population protocols
Y Sudo, F Ooshita, H Kakugawa, T Masuzawa
International Conference on Principles of Distributed Systems, 339-354, 2014
142014
The price of multi-organization constraint in unrelated parallel machine scheduling
F Ooshita, T Izumi, T Izumi
Parallel Processing Letters 22 (02), 1250006, 2012
13*2012
Scheduling for gather operation in heterogeneous parallel computing environments
F Ooshita, S Matsumae, T Masuzawa
IEICE Transactions on Fundamentals of Electronics, Communications andá…, 2003
13*2003
Byzantine-tolerant gathering of mobile agents in arbitrary networks with authenticated whiteboards
M Tsuchida, F Ooshita, M Inoue
IEICE TRANSACTIONS on Information and Systems 101 (3), 602-610, 2018
12*2018
Move-optimal gossiping among mobile agents
T Suzuki, T Izumi, F Ooshita, H Kakugawa, T Masuzawa
Theoretical Computer Science 393 (1-3), 90-101, 2008
12*2008
The system can't perform the operation now. Try again later.
Articles 1–20