| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128568 | 2024-04-15 | Paper |
| Neighborhood mutual remainder: self-stabilizing distributed implementation and applications | 2024-03-05 | Paper |
| Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs | 2024-02-28 | Paper |
| Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs | 2024-01-05 | Paper |
| Efficient algorithms for a mixed k-partition problem of graphs without specifying bases | 2024-01-05 | Paper |
| Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights | 2023-10-26 | Paper |
| Rendezvous of Asynchronous Mobile Robots with Lights | 2023-06-30 | Paper |
| Location Functions for Self-stabilizing Byzantine Tolerant Swarms | 2023-04-21 | Paper |
| Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights | 2023-04-21 | Paper |
| Location functions for self-stabilizing Byzantine tolerant swarms | 2023-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874258 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874261 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875618 | 2023-02-03 | Paper |
| Gathering problems for autonomous mobile robots with lights | 2023-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091102 | 2022-07-21 | Paper |
| Parallel algorithms for partitioning sorted sets and related problems | 2017-12-05 | Paper |
| PROBABILISTIC ANALYSIS OF LOAD-IMBALANCED PARALLEL APPLICATIONS WITH PARTIALLY ELIMINATED BARRIERS | 2015-12-11 | Paper |
| Approximability of minimum certificate dispersal with tree structures | 2015-07-13 | Paper |
| Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances | 2014-12-02 | Paper |
| Space-efficient self-stabilizing counting population protocols on mobile sensor networks | 2014-09-10 | Paper |
| ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS | 2012-12-12 | Paper |
| How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model | 2012-12-06 | Paper |
| The optimal tolerance of uniform observation error for mobile robot convergence | 2012-08-10 | Paper |
| Minimum Certificate Dispersal with Tree Structures | 2012-07-16 | Paper |
| On the approximability and hardness of minimum topic connected overlay and its special instances | 2012-05-30 | Paper |
| The Gathering Problem for Two Oblivious Robots with Unreliable Compasses | 2012-05-30 | Paper |
| On the Approximability of Minimum Topic Connected Overlay and Its Special Instances | 2011-08-17 | Paper |
| Oracle-based flocking of mobile robots in crash-recovery model | 2011-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084819 | 2011-03-25 | Paper |
| Approximability and inapproximability of the minimum certificate dispersal problem | 2010-07-07 | Paper |
| Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents | 2010-02-24 | Paper |
| Convergence of Mobile Robots with Uniformly-Inaccurate Sensors | 2010-02-24 | Paper |
| Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem | 2009-07-23 | Paper |
| Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result | 2008-09-02 | Paper |
| Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses | 2008-07-10 | Paper |
| Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots | 2007-11-15 | Paper |
| Acknowledged broadcasting and gossiping in ad hoc radio networks | 2007-06-06 | Paper |
| Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs | 2007-04-26 | Paper |
| Principles of Distributed Systems | 2005-08-24 | Paper |
| CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3047316 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406876 | 2003-06-26 | Paper |
| On a Fluency Image Coding System for Beef Marbling Evaluation | 2003-02-20 | Paper |
| Robust algorithms for constructing strongly convex hulls in parallel. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551346 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766692 | 2002-07-22 | Paper |
| On a grading system for beef marbling | 2001-10-01 | Paper |
| Parallel algorithms for partitioning sorted sets and related problems | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944980 | 2000-11-13 | Paper |
| Finding the Convex Hull of Discs in Parallel | 2000-11-07 | Paper |
| An approximation of data points by piecewise polynomial functions and their dual orthogonal functions | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232799 | 1999-08-03 | Paper |
| PaRM: A parallel relaxation machine for handwritten character recognition | 1998-10-06 | Paper |
| Integer summing algorithms on reconfigurable meshes | 1998-08-13 | Paper |
| Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373694 | 1998-01-21 | Paper |
| New results in graph routing | 1993-12-20 | Paper |
| Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs | 1993-01-16 | Paper |
| Optimal fault-tolerant routings for connected graphs | 1992-06-28 | Paper |
