The following pages link to Koichi Wada (Q418775):
Displaying 50 items.
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- The optimal tolerance of uniform observation error for mobile robot convergence (Q442269) (← links)
- Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances'' (Q476920) (← links)
- Oracle-based flocking of mobile robots in crash-recovery model (Q555317) (← links)
- New results in graph routing (Q690239) (← links)
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model (Q692907) (← links)
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks (Q740980) (← links)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs (Q876733) (← links)
- Acknowledged broadcasting and gossiping in ad hoc radio networks (Q884460) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Integer summing algorithms on reconfigurable meshes (Q1128663) (← links)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
- Optimal fault-tolerant routings for connected graphs (Q1186600) (← links)
- Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs (Q1199456) (← links)
- (Q1580960) (redirect page) (← links)
- Parallel algorithms for partitioning sorted sets and related problems (Q1580962) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- An approximation of data points by piecewise polynomial functions and their dual orthogonal functions (Q1978290) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- Gathering problems for autonomous mobile robots with lights (Q2680865) (← links)
- Location functions for self-stabilizing Byzantine tolerant swarms (Q2697536) (← links)
- On a grading system for beef marbling (Q2730126) (← links)
- (Q2766692) (← links)
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses (Q2884572) (← links)
- Minimum Certificate Dispersal with Tree Structures (Q2898067) (← links)
- (Q3047316) (← links)
- (Q3084819) (← links)
- On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (Q3088055) (← links)
- ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS (Q3144927) (← links)
- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents (Q3408164) (← links)
- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors (Q3408180) (← links)
- PROBABILISTIC ANALYSIS OF LOAD-IMBALANCED PARALLEL APPLICATIONS WITH PARTIALLY ELIMINATED BARRIERS (Q3456029) (← links)
- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses (Q3511385) (← links)
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result (Q3523215) (← links)
- PaRM: A parallel relaxation machine for handwritten character recognition (Q4212677) (← links)
- (Q4232799) (← links)
- (Q4373694) (← links)
- (Q4406876) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- (Q4551346) (← links)
- Parallel algorithms for partitioning sorted sets and related problems (Q4595490) (← links)
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (Q4682156) (← links)
- On a Fluency Image Coding System for Beef Marbling Evaluation (Q4795095) (← links)
- (Q4944980) (← links)
- (Q5091102) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)
- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots (Q5425977) (← links)
- Principles of Distributed Systems (Q5466234) (← links)
- (Q5874258) (← links)
- (Q5874261) (← links)
