| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita |
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita |
Broadcastings and digit tilings on three-dimensional torus networks. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita |
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Adrian Kosowski, Masafumi Yamashita (eds.) |
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings |
SIROCCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita |
Probabilistic Self-Stabilization and Random Walks. |
ICNC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita |
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The hitting and cover times of Metropolis walks. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Ichiro Suzuki |
Characterizing geometric patterns formable by oblivious anonymous mobile robots. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The Space Complexity of Leader Election in Anonymous Networks. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita |
Pattern Formation through Optimum Matching by Oblivious CORDA Robots. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita |
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita |
On the computational power of oblivious robots: forming a series of geometric patterns. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed coordination |
| 1 | Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita |
The hitting and cover times of random walks on finite graphs using local degree information. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samia Souissi, Xavier Défago, Masafumi Yamashita |
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. |
TAAS |
2009 |
DBLP DOI BibTeX RDF |
Cooperation and Control, Point Formation, Self-Organizing Robots, Unreliable Compasses, Self-Stabilization, Autonomous Mobile Robots |
| 1 | Ei Ando, Toshio Nakata, Masafumi Yamashita |
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
How to Design a Linear Cover Time Random Walk on a Finite Graph. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ei Ando, Hirotaka Ono, Masafumi Yamashita |
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. |
DNA |
2008 |
DBLP DOI BibTeX RDF |
Statistical Thermodynamical Constraints, Local Search, DNA Sequence Design |
| 1 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The space complexity of the leader election in anonymous networks. |
IPDPS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita |
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. |
OPODIS |
2008 |
DBLP DOI BibTeX RDF |
marching, oblivious algorithm, flocking, self-stabilizing algorithm, motion coordination |
| 1 | Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita |
Weak vs. Self vs. Probabilistic Stabilization. |
ICDCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
The Balanced Edge Cover Problem. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita |
Designing good random walks on finite graphs. |
IWOCA |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita |
Weak vs. Self vs. Probabilistic Stabilization |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. |
DNA |
2007 |
DBLP DOI BibTeX RDF |
DNA Sequence Design Algorithm, Statistical Thermodynamical Constraints, Local Search |
| 1 | Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita |
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. |
SIROCCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Samia Souissi, Xavier Défago |
Gathering two stateless mobile robots using very inaccurate compasses in finite time. |
ROBOCOMM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita |
Robots and Molecules. |
SSS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Kiniwa, Masafumi Yamashita |
A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol. |
Parallel Processing Letters |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita |
How to collect balls moving in the Euclidean plane. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ichiro Suzuki, Masafumi Yamashita |
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
A Probabilistic Model of the DNA Conformational Change. |
DNA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
DNA Sequence Design by Dynamic Neighborhood Searches. |
DNA |
2006 |
DBLP DOI BibTeX RDF |
Combinatorial Constraints, Variable Depth Search, Local Search, Variable Neighborhood Search, DNA Sequence Design |
| 1 | Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. |
ISPA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita |
Characterization of Polygons Searchable by a Boundary 1-Searcher. |
CCCG |
2006 |
DBLP BibTeX RDF |
|
| 1 | Samia Souissi, Xavier Défago, Masafumi Yamashita |
Gathering Asynchronous Mobile Robots with Inaccurate Compasses. |
OPODIS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Samia Souissi, Xavier Défago, Masafumi Yamashita |
Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. |
SSS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
A generic search strategy for large-scale real-world networks. |
Infoscale |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Harada, Masafumi Yamashita |
Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion. |
IEEE Trans. Parallel Distrib. Syst. |
2005 |
DBLP DOI BibTeX RDF |
grid structures, nondominatedness, distributed systems, Coteries, transversals, quorum consensus, mutual exclusion algorithms |
| 1 | Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. |
DNA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita |
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. |
WONS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda |
Searching a polygonal region by a group of stationary k-searchers. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita |
Formations for Fast Locomotion of Metamorphic Robotic Systems. |
I. J. Robotic Res. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Takashi Harada, Masafumi Yamashita |
k-Coteries for Tolerating Network 2-Partition. |
IEEE Trans. Parallel Distrib. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita |
How to Collect Balls Moving in the Euclidean Plane. |
Electr. Notes Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita |
Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. |
IEEE Transactions on Robotics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotsugu Kakugawa, Masafumi Yamashita |
A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. |
OPODIS |
2004 |
DBLP DOI BibTeX RDF |
ad-hoc network, self-stabilization, spanning tree, token circulation |
| 1 | Sung-Hoon Park, Masafumi Yamashita |
Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors. |
PDPTA |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
Neighborhood Composition: A Parallelization of Local Search Algorithms. |
PVM/MPI |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita |
Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. |
VLSI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita |
Impact of Local Topological Information on Random Walks on Finite Graphs. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda |
Max- and Min-Neighborhood Monopolies. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita |
Fair Circulation of a Token. |
IEEE Trans. Parallel Distrib. Syst. |
2002 |
DBLP DOI BibTeX RDF |
distributed systems, random walk, self-stabilizing systems, token circulation, cover time |
| 1 | Hirotatsu Sakomoto, Yoshihiro Okada, Eisuke Itoh, Masafumi Yamashita |
Component-Based Audio-Video Communication Tool for Network 3D Games. |
Int. J. Intell. Games & Simulation |
2002 |
DBLP BibTeX RDF |
|
| 1 | Hirotsugu Kakugawa, Masafumi Yamashita |
Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. |
J. Parallel Distrib. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotsugu Kakugawa, Masafumi Yamashita |
Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. |
SRDS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita |
High Speed Formations of Reconfigurable Modular Robotic Systems. |
ICRA |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga |
The statistical longest path problem and its application to delay analysis of logical circuits. |
Timing Issues in the Specification and Synthesis of Digital Systems |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda |
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Harada, Masafumi Yamashita |
Coterie Join Operation and Tree Structured k-Coteries. |
IEEE Trans. Parallel Distrib. Syst. |
2001 |
DBLP DOI BibTeX RDF |
k-coteries, k-semicoteries, k-mutual exclusion problem, nondominatedness, distributed systems, Availability, quorums, message complexity |
| 1 | Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda |
Searching a Polygonal Region from the Boundary. |
Int. J. Comput. Geometry Appl. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Ichiro Suzuki, Masafumi Yamashita |
A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor. |
ICRA |
2001 |
DBLP BibTeX RDF |
|
| 1 | Toshio Nakata, Masafumi Yamashita |
Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. |
SIROCCO |
2001 |
DBLP BibTeX RDF |
|
| 1 | Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita |
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoshi Fujita, Masafumi Yamashita, Tiko Kameda |
A Study on r-Configurations - A Resource Assignment Problem on Graphs. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda |
Max- and Min-Neighborhood Monopolies. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eric Chung-Hui Chang, Amol Dattatraya Mali, Syunsuke Nagafuji, Ichiro Suzuki, Masafumi Yamashita |
Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder. |
DARS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Masafumi Yamashita, Tsunehiko Kameda |
Modeling K-coteries by well-covered graphs. |
Networks |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Tsunehiko Kameda |
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. |
IEEE Trans. Parallel Distrib. Syst. |
1999 |
DBLP DOI BibTeX RDF |
mailbox communication, fault tolerance, Distributed computing, leader election, broadcast communication, point-to-point communication |
| 1 | Takashi Harada, Masafumi Yamashita |
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks. |
IEEE Trans. Computers |
1999 |
DBLP DOI BibTeX RDF |
$G$-nondominatedness, distributed systems, graph theory, Availability, quorums, coteries, mutual exclusion problems |
| 1 | Ichiro Suzuki, Masafumi Yamashita |
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Harada, Masafumi Yamashita |
A Coterie Join Operation and Tree Structured k-Coteries. |
PDPTA |
1999 |
DBLP BibTeX RDF |
|
| 1 | Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita |
Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
local majority voting, agreement and consensus problem, distributed computing, graph theory, Markov chain |
| 1 | Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda |
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita |
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. |
IEEE Trans. Parallel Distrib. Syst. |
1998 |
DBLP DOI BibTeX RDF |
ring orientation, fault-tolerance, Distributed algorithm, self-stabilization, ring network |
| 1 | Yuichi Asahiro, Hajime Asama, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita |
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time. |
Sensor Based Intelligent Robots |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotsugu Kakugawa, Masafumi Yamashita |
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. |
IEEE Trans. Parallel Distrib. Syst. |
1997 |
DBLP DOI BibTeX RDF |
unfair daemon, fault tolerance, distributed algorithms, self-stabilization, mutual exclusion, Ring networks |
| 1 | Takashi Harada, Masafumi Yamashita |
Nondominated Coteries on Graphs. |
IEEE Trans. Parallel Distrib. Syst. |
1997 |
DBLP DOI BibTeX RDF |
coteries on graphs, distributed mutual exclusion problem, G-nondominatedness, majority consensus, Availability |
| 1 | Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda |
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). |
Symposium on Computational Geometry |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita |
A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Tsunehiko Kameda |
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. |
IEEE Trans. Parallel Distrib. Syst. |
1996 |
DBLP DOI BibTeX RDF |
edge election, spanning tree construction, topology recognition, distributed computing, knowledge, leader election, Anonymous network |
| 1 | Masafumi Yamashita, Tsunehiko Kameda |
Computing on Anonymous Networks: Part II-Decision and Membership Problems. |
IEEE Trans. Parallel Distrib. Syst. |
1996 |
DBLP DOI BibTeX RDF |
edge election, spanning tree construction, topology recognition, distributed computing, NP-completeness, computability, leader election, Anonymous network |
| 1 | Satoshi Fujita, Masafumi Yamashita |
Fast Gossiping on Mesh-Bus Computers. |
IEEE Trans. Computers |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoshi Fujita, Masafumi Yamashita |
A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. |
J. Parallel Distrib. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Masafumi Yamashita, Tiko Kameda |
Computing Functions on Asynchronous Anonymous Networks. |
Mathematical Systems Theory |
1996 |
DBLP BibTeX RDF |
|
| 1 | Satoshi Fujita, Masafumi Yamashita |
Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Ichiro Suzuki, Masafumi Yamashita |
Designing multi-link robot arms in a convex polygon. |
Int. J. Comput. Geometry Appl. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Ichiro Suzuki, Masafumi Yamashita |
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots. |
Intelligent Robots |
1996 |
DBLP BibTeX RDF |
|
| 1 | Ichiro Suzuki, Masafumi Yamashita |
Distributed Anonymous Mobile Robots. |
SIROCCO |
1996 |
DBLP BibTeX RDF |
|
| 1 | Satoshi Fujita, Masafumi Yamashita |
Maintaining a Dynamic Set of Processors in a Distributed System. |
WDAG |
1996 |
DBLP DOI BibTeX RDF |
processor structure, amortized message complexity, data structure, group communication, dynamic set |
| 1 | D. Crass, Ichiro Suzuki, Masafumi Yamashita |
Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. |
Int. J. Comput. Geometry Appl. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Satoshi Fujita, Tiko Kameda, Masafumi Yamashita |
A Resource Assignment Problem on Graphs. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianan Li, Ichiro Suzuki, Masafumi Yamashita |
A New Structural Induction Theorem for Rings of Temporal Petri Nets. |
IEEE Trans. Software Eng. |
1994 |
DBLP DOI BibTeX RDF |
structural induction theorem, temporal Petri nets, identical components, temporal logic formula, similar behavior, demand-driven token circulation, Petri nets, formal verification, formal verification, temporal logic, correctness, temporal reasoning, rings |
| 1 | Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae |
A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianan Li, Ichiro Suzuki, Masafumi Yamashita |
Fair Petri Nets and Structural Induction for Rings of Processes. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoshi Fujita, Masafumi Yamashita |
Fast Gossiping on Square Mesh Computers. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae |
Availability of k-Coterie. |
IEEE Trans. Computers |
1993 |
DBLP DOI BibTeX RDF |
distributed k-mutual-exclusion problem, k-mutex problem, distribution system, graph theory, distributed processing, concurrency control, network topology, critical section, complete graph |
| 1 | Satoshi Fujita, Masafumi Yamashita |
Optimal Gossiping in Mesh-Bus Computers. |
Parallel Processing Letters |
1993 |
DBLP BibTeX RDF |
|
| 1 | Satoshi Fujita, Masafumi Yamashita, Tadashi Ae |
Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
optimal time bound, parallel algorithm, wormhole routing, gossiping, n-cubes |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")