◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Yamashita

19 papers hereh-index 375.6k citations250 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author18

Across the 19 of 19 papers where every author was matched, so the position is known.

fields
  • cs.DC14
  • cs.DM3
  • cs.CC1
  • cs.MA1
same name
  • M. Yamashita — 73 papers, h 24
  • M. Yamashita — 63 papers, h 18
  • M. Yamashita — 56 papers, h 29
  • M. Yamashita — 33 papers, h 23
  • M. Yamashita — 26 papers, h 14
  • M. Yamashita — 6 papers, h 13

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20072023
most citedPlane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space

12 citations · 48 across the 17 of their papers we have counts for

collaborators
Showing 2017Show all

4 papers · 1 filter

cs.DM2017★ 2 cited

Finding Submodularity Hidden in Symmetric Difference

Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima +1

A set function f on a finite set V is submodular if f(X)+f(Y)≥f(X∪Y)+f(X∩Y) for any pair X,Y⊆V. The symmetric difference transformation (SD-tr…

cs.DC2017

Can Walker Localize The Middle Point of A Line-segment?

Akihiro Monde, Yukiko Yamauchi, Shuji Kijima +1

This paper poses a question about a simple localization problem. The question is if an {\em oblivious} walker on a line-segment can localize the middle point of the line-segment in…

cs.DC2017★ 2 cited

Plane Formation by Synchronous Mobile Robots without Chirality

Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima +1

We consider a distributed system consisting of autonomous mobile computing entities, called robots, moving in a specified space. The robots are anonymous, oblivious, and have neith…

cs.DC2017★ 6 cited

Meeting in a Polygon by Anonymous Oblivious Robots

Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro +2

The Meeting problem for k≥2 searchers in a polygon P (possibly with holes) consists in making the searchers move within P, according to a distributed algorithm, in such a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.