Masafumi Yamashita

Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Computing 25(6): 451-460 (2012)

Masafumi Yamashita: Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs. IJNC 2(2): 147-159 (2012)

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. 41(1): 26-46 (2012)

Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita: The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. ICDCS 2012: 506-515

Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita: An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops 2012: 872-877

Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita: Brief announcement: waiting in dynamic networks. PODC 2012: 99-100

Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. DISC 2012: 312-325

Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita: Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. DISC 2012: 413-414

Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita: Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks. CoRR abs/1205.1975 (2012)

Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita: Broadcastings and digit tilings on three-dimensional torus networks. Theor. Comput. Sci. 412(4-5): 307-319 (2011)

Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS 2011: 63-68

Masafumi Yamashita: Probabilistic Self-Stabilization and Random Walks. ICNC 2011: 1-7

Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita: A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. ISAAC 2011: 514-523

Adrian Kosowski, Masafumi Yamashita (Eds.): Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings. Lecture Notes in Computer Science 6796, Springer 2011, isbn 978-3-642-22211-5

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 abs/1111.1492 (2011)

Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. 21(3): 427-440 (2010)

Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The hitting and cover times of Metropolis walks. Theor. Comput. Sci. 411(16-18): 1889-1894 (2010)

Masafumi Yamashita, Ichiro Suzuki: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26-28): 2433-2453 (2010)

Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS 2010: 1-15

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: 491-503

Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita: On the computational power of oblivious robots: forming a series of geometric patterns. PODC 2010: 267-276

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 7(4): 420-438 (2009)

Samia Souissi, Xavier Défago, Masafumi Yamashita: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. TAAS 4(1) (2009)

Satoshi Ikeda, Izumi Kubo, Masafumi Yamashita: The hitting and cover times of random walks on finite graphs using local degree information. Theor. Comput. Sci. 410(1): 94-100 (2009)

Ei Ando, Hirotaka Ono, Masafumi Yamashita: A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA 2009: 89-103

Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA 2009: 104-116

Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107

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: 168-178

Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita: Weak vs. Self vs. Probabilistic Stabilization. ICDCS 2008: 681-688

Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8

Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The Balanced Edge Cover Problem. ISAAC 2008: 246-257

Masafumi Yamashita: Designing good random walks on finite graphs. IWOCA 2008: 1

Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita: A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS 2008: 125-144

Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139

Masafumi Yamashita, Samia Souissi, Xavier Défago: Gathering two stateless mobile robots using very inaccurate compasses in finite time. ROBOCOMM 2007: 48

Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita: Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. SIROCCO 2007: 289-303

Masafumi Yamashita: Robots and Molecules. SSS 2007: 3

Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita: Weak vs. Self vs. Probabilistic Stabilization. CoRR abs/0711.3672 (2007)

Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita: How to collect balls moving in the Euclidean plane. Discrete Applied Mathematics 154(16): 2247-2262 (2006)

Jun Kiniwa, Masafumi Yamashita: A Randomized 1-latent, Time-adaptive and Safe Self-stabilizing Mutual Exclusion Protocol. Parallel Processing Letters 16(1): 53-62 (2006)

Ichiro Suzuki, Masafumi Yamashita: Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. 36(1): 279-280 (2006)

Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita: Characterization of Polygons Searchable by a Boundary 1-Searcher. CCCG 2006

Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171

Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285

Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A generic search strategy for large-scale real-world networks. Infoscale 2006: 2

Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50

Samia Souissi, Xavier Défago, Masafumi Yamashita: Gathering Asynchronous Mobile Robots with Inaccurate Compasses. OPODIS 2006: 333-349

Samia Souissi, Xavier Défago, Masafumi Yamashita: Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. SSS 2006: 484-500

Takashi Harada, Masafumi Yamashita: Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion. IEEE Trans. Parallel Distrib. Syst. 16(2): 183-192 (2005)

Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA 2005: 359-370

Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita: Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130

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. 91: 229-245 (2004)

Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita: Formations for Fast Locomotion of Metamorphic Robotic Systems. I. J. Robotic Res. 23(6): 583-593 (2004)

Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda: Searching a polygonal region by a group of stationary k-searchers. Inf. Process. Lett. 92(1): 1-8 (2004)

Takashi Harada, Masafumi Yamashita: k-Coteries for Tolerating Network 2-Partition. IEEE Trans. Parallel Distrib. Syst. 15(7): 666-672 (2004)

Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita: Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. IEEE Transactions on Robotics 20(3): 409-418 (2004)

Hirotsugu Kakugawa, Masafumi Yamashita: A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks. OPODIS 2004: 256-266

Sung-Hoon Park, Masafumi Yamashita: Leader Election in Asynchronous Distributed Systems with Unreliable Failure Detectors. PDPTA 2004: 687-693

Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163

Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita: Impact of Local Topological Information on Random Walks on Finite Graphs. ICALP 2003: 1054-1067

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: 203-207

Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda: Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002)

Hirotatsu Sakomoto, Yoshihiro Okada, Eisuke Itoh, Masafumi Yamashita: Component-Based Audio-Video Communication Tool for Network 3D Games. Int. J. Intell. Games & Simulation 1(1): 33-40 (2002)

Hirotsugu Kakugawa, Masafumi Yamashita: Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. J. Parallel Distrib. Comput. 62(5): 885-898 (2002)

Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita: Fair Circulation of a Token. IEEE Trans. Parallel Distrib. Syst. 13(4): 367-372 (2002)

Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita: High Speed Formations of Reconfigurable Modular Robotic Systems. ICRA 2002: 123-128

Hirotsugu Kakugawa, Masafumi Yamashita: Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct. SRDS 2002: 202-211

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: 134-139

Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda: Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. Algorithmica 31(2): 208-236 (2001)

Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda: Searching a Polygonal Region from the Boundary. Int. J. Comput. Geometry Appl. 11(5): 529-553 (2001)

Takashi Harada, Masafumi Yamashita: Coterie Join Operation and Tree Structured k-Coteries. IEEE Trans. Parallel Distrib. Syst. 12(9): 865-874 (2001)

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: 3016-3021

Toshio Nakata, Masafumi Yamashita: Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. SIROCCO 2001: 293-304

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 35(4): 266-273 (2000)

Satoshi Fujita, Masafumi Yamashita, Tiko Kameda: A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discrete Math. 13(2): 227-254 (2000)

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: 427-436

Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda: Max- and Min-Neighborhood Monopolies. SWAT 2000: 513-526

Masafumi Yamashita, Tsunehiko Kameda: Modeling K-coteries by well-covered graphs. Networks 34(3): 221-228 (1999)

Ichiro Suzuki, Masafumi Yamashita: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. 28(4): 1347-1363 (1999)

Takashi Harada, Masafumi Yamashita: Improving the Availability of Mutual Exclusion Systems on Incomplete Networks. IEEE Trans. Computers 48(7): 744-747 (1999)

Masafumi Yamashita, Tsunehiko Kameda: Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distrib. Syst. 10(9): 878-887 (1999)

Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita: Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. COCOON 1999: 330-338

Takashi Harada, Masafumi Yamashita: A Coterie Join Operation and Tree Structured k-Coteries. PDPTA 1999: 327-333

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. 66(1): 49-52 (1998)

Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita: A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States. IEEE Trans. Parallel Distrib. Syst. 9(6): 579-584 (1998)

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: 240-254

Hirotsugu Kakugawa, Masafumi Yamashita: Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. IEEE Trans. Parallel Distrib. Syst. 8(2): 154-163 (1997)

Takashi Harada, Masafumi Yamashita: Nondominated Coteries on Graphs. IEEE Trans. Parallel Distrib. Syst. 8(6): 667-672 (1997)

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: 448-450

Yoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita: A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes. ISPAN 1997: 487-493

Ichiro Suzuki, Masafumi Yamashita: Designing multi-link robot arms in a convex polygon. Int. J. Comput. Geometry Appl. 6(4): 461-486 (1996)

Satoshi Fujita, Masafumi Yamashita: A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm. J. Parallel Distrib. Comput. 34(1): 111-116 (1996)

Masafumi Yamashita, Tiko Kameda: Computing Functions on Asynchronous Anonymous Networks. Mathematical Systems Theory 29(4): 331-356 (1996)

Yoshitomo Chikamatsu, Tadashi Ae, Masafumi Yamashita: A general solution for combinatorial problems by neural networks. Systems and Computers in Japan 27(1): 101-109 (1996)

Satoshi Fujita, Masafumi Yamashita: Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model. SIAM J. Comput. 25(5): 1045-1060 (1996)

Satoshi Fujita, Masafumi Yamashita: Fast Gossiping on Mesh-Bus Computers. IEEE Trans. Computers 45(11): 1326-1330 (1996)

Masafumi Yamashita, Tsunehiko Kameda: Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. IEEE Trans. Parallel Distrib. Syst. 7(1): 69-89 (1996)

Masafumi Yamashita, Tsunehiko Kameda: Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distrib. Syst. 7(1): 90-96 (1996)

Ichiro Suzuki, Masafumi Yamashita: Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots. Intelligent Robots 1996: 305-321

Ichiro Suzuki, Masafumi Yamashita: Distributed Anonymous Mobile Robots. SIROCCO 1996: 313-330

Satoshi Fujita, Masafumi Yamashita: Maintaining a Dynamic Set of Processors in a Distributed System. WDAG 1996: 220-233

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. 5(4): 397-412 (1995)

Satoshi Fujita, Tiko Kameda, Masafumi Yamashita: A Resource Assignment Problem on Graphs. ISAAC 1995: 418-427

Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae: A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. Inf. Process. Lett. 49(4): 213-218 (1994)

Jianan Li, Ichiro Suzuki, Masafumi Yamashita: Fair Petri Nets and Structural Induction for Rings of Processes. Theor. Comput. Sci. 135(2): 377-404 (1994)

Jianan Li, Ichiro Suzuki, Masafumi Yamashita: A New Structural Induction Theorem for Rings of Temporal Petri Nets. IEEE Trans. Software Eng. 20(2): 115-126 (1994)

Satoshi Fujita, Masafumi Yamashita: Fast Gossiping on Square Mesh Computers. Inf. Process. Lett. 48(3): 127-130 (1993)

Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita: Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993)

Satoshi Fujita, Masafumi Yamashita: Optimal Gossiping in Mesh-Bus Computers. Parallel Processing Letters 3: 357-361 (1993)

Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae: Availability of k-Coterie. IEEE Trans. Computers 42(5): 553-558 (1993)

Satoshi Fujita, Masafumi Yamashita, Tadashi Ae: Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model. ISAAC 1993: 277-286

Ichiro Suzuki, Masafumi Yamashita: Searching for a Mobile Intruder in a Polygonal Region. SIAM J. Comput. 21(5): 863-888 (1992)

Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita (Eds.): Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings. Lecture Notes in Computer Science 650, Springer 1992, isbn 3-540-56279-6

Yukinori Ikegawa, Masafumi Yamashita, Tadashi Ae: An experimental evaluation of leader election algorithms for ring networks. Systems and Computers in Japan 22(3): 10-18 (1991)

Yutaka Hisanaga, Masafumi Yamashita, Tadashi Ae: Set partition of real numbers by hopfield neural network. Systems and Computers in Japan 22(10): 88-95 (1991)

Satoshi Fujita, Masafumi Yamashita, Tadashi Ae: Distributed k-Mutual Exclusion Problem and k-Coteries. ISA 1991: 22-31

Satoshi Fujita, Masafumi Yamashita, Tadashi Ae: Search Level Parallel Processing of Production Systems. PARLE (2) 1991: 471-488

Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita: The Searchlight Scheduling Problem. SIAM J. Comput. 19(6): 1024-1040 (1990)

Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae: A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance. IWDM 1989: 331-344

Masafumi Yamashita, Tiko Kameda: Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). WDAG 1989: 303-314

Masafumi Yamashita, Tiko Kameda: Computing on an Anonymous Network. PODC 1988: 117-130

Satoshi Fujita, Reiji Aibara, Masafumi Yamashita, Tadashi Ae: A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture. ISCA 1987: 64-70

Tadashi Ae, Masafumi Yamashita, Hiroshi Matsumoto: A Response Time Estimation of Real-Time Networks. RTSS 1987: 198-207

Masafumi Yamashita, Toshihide Ibaraki: Distances defined by neighborhood sequences. Pattern Recognition 19(3): 237-246 (1986)

Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki: Implementation of Parallel Prolog on Tree Machines. FJCC 1986: 287-296

Masafumi Yamashita: Parallel and sequential transformations on digital images. Pattern Recognition 18(1): 31-41 (1985)

Masafumi Yamashita, Namio Honda: Distance functions defined by variable neighborhood sequences. Pattern Recognition 17(5): 509-513 (1984)