The following pages link to Tomoko Izumi (Q740978):
Displaying 12 items.
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks (Q740980) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Population protocols with faulty interactions: the impact of a leader (Q1628589) (← links)
- Linear time and space gathering of anonymous mobile agents in asynchronous trees (Q1951563) (← links)
- Fault-tolerant simulation of population protocols (Q2220403) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- Minimum Certificate Dispersal with Tree Structures (Q2898067) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees (Q3569118) (← links)
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings (Q3569119) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)