Koichi Wada

From MaRDI portal
Person:418775

Available identifiers

zbMath Open wada.koichiMaRDI QIDQ418775

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61285682024-04-15Paper
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications2024-03-05Paper
Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs2024-02-28Paper
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs2024-01-05Paper
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases2024-01-05Paper
Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights2023-10-26Paper
Rendezvous of Asynchronous Mobile Robots with Lights2023-06-30Paper
Location functions for self-stabilizing Byzantine tolerant swarms2023-04-12Paper
https://portal.mardi4nfdi.de/entity/Q58742582023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58742612023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58756182023-02-03Paper
Gathering problems for autonomous mobile robots with lights2023-01-04Paper
https://portal.mardi4nfdi.de/entity/Q50911022022-07-21Paper
Parallel algorithms for partitioning sorted sets and related problems2017-12-05Paper
PROBABILISTIC ANALYSIS OF LOAD-IMBALANCED PARALLEL APPLICATIONS WITH PARTIALLY ELIMINATED BARRIERS2015-12-11Paper
Approximability of minimum certificate dispersal with tree structures2015-07-13Paper
Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances2014-12-02Paper
Space-efficient self-stabilizing counting population protocols on mobile sensor networks2014-09-10Paper
ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS2012-12-12Paper
How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model2012-12-06Paper
The optimal tolerance of uniform observation error for mobile robot convergence2012-08-10Paper
Minimum Certificate Dispersal with Tree Structures2012-07-16Paper
On the approximability and hardness of minimum topic connected overlay and its special instances2012-05-30Paper
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses2012-05-30Paper
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances2011-08-17Paper
Oracle-based flocking of mobile robots in crash-recovery model2011-07-22Paper
https://portal.mardi4nfdi.de/entity/Q30848192011-03-25Paper
Approximability and inapproximability of the minimum certificate dispersal problem2010-07-07Paper
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents2010-02-24Paper
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors2010-02-24Paper
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem2009-07-23Paper
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result2008-09-02Paper
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses2008-07-10Paper
Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots2007-11-15Paper
Acknowledged broadcasting and gossiping in ad hoc radio networks2007-06-06Paper
Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs2007-04-26Paper
Principles of Distributed Systems2005-08-24Paper
CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q30473162004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44068762003-06-26Paper
On a Fluency Image Coding System for Beef Marbling Evaluation2003-02-20Paper
Robust algorithms for constructing strongly convex hulls in parallel.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45513462002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q27666922002-07-22Paper
On a grading system for beef marbling2001-10-01Paper
Parallel algorithms for partitioning sorted sets and related problems2001-05-20Paper
https://portal.mardi4nfdi.de/entity/Q49449802000-11-13Paper
Finding the Convex Hull of Discs in Parallel2000-11-07Paper
An approximation of data points by piecewise polynomial functions and their dual orthogonal functions2000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q42327991999-08-03Paper
PaRM: A parallel relaxation machine for handwritten character recognition1998-10-06Paper
Integer summing algorithms on reconfigurable meshes1998-08-13Paper
Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43736941998-01-21Paper
New results in graph routing1993-12-20Paper
Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs1993-01-16Paper
Optimal fault-tolerant routings for connected graphs1992-06-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Koichi Wada