The following pages link to Masafumi Yamashita (Q590503):
Displayed 50 items.
- Item:Q590503 (redirect page) (← links)
- An alternative proof for the equivalence of searcher and 2-searcher (Q284588) (← links)
- Broadcastings and digit tilings on three-dimensional torus networks (Q620939) (← links)
- Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon (Q701146) (← links)
- Distance functions defined by variable neighbourhood sequences (Q794451) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- Autonomous mobile robots with lights (Q897873) (← links)
- The hitting and cover times of Metropolis walks (Q964410) (← links)
- Characterizing geometric patterns formable by oblivious anonymous mobile robots (Q974737) (← links)
- The hitting and cover times of random walks on finite graphs using local degree information (Q1001905) (← links)
- Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026) (← links)
- Parallel and sequential transformations on digital images (Q1064066) (← links)
- Distances defined by neighborhood sequences (Q1082093) (← links)
- Fast gossiping on square mesh computers (Q1313753) (← links)
- A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie (Q1318744) (← links)
- Fair Petri nets and structural induction for rings of processes (Q1346633) (← links)
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space (Q1664133) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Team assembling problem for asynchronous heterogeneous mobile robots (Q1704590) (← links)
- Max- and Min-neighborhood monopolies (Q1849375) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- Realization of periodic functions by self-stabilizing population protocols with synchronous handshakes (Q1989513) (← links)
- Plane formation by semi-synchronous robots in the three dimensional Euclidean space (Q2007917) (← links)
- Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918) (← links)
- Constructing self-stabilizing oscillators in population protocols (Q2013587) (← links)
- Monotonic self-stabilization and its application to robust and adaptive pattern formation (Q2089064) (← links)
- Search by a metamorphic robotic system in a finite 2D square grid (Q2139088) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- Forming sequences of geometric patterns with oblivious mobile robots (Q2353251) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537) (← links)
- (Q2722008) (← links)
- (Q2751886) (← links)
- ModelingK-coteries by well-covered graphs (Q2766106) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
- Expressivity of Time-Varying Graphs (Q2842776) (← links)
- (Q2845529) (← links)
- Rendezvous of Two Robots with Constant Memory (Q2868644) (← links)
- Pattern Formation by Mobile Robots with Limited Visibility (Q2868645) (← links)
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses (Q2884572) (← links)
- L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains (Q2920442) (← links)
- Weak <i>vs.</i> Self <i>vs.</i> Probabilistic Stabilization (Q2947955) (← links)
- (Q3046537) (← links)
- (Q3104251) (← links)
- A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space (Q3104649) (← links)