| Publication | Date of Publication | Type |
|---|
| Self-stabilizing algorithm for two disjoint minimal dominating sets | 2019-05-10 | Paper |
| Fast parallel algorithms for binary multiplication and their implementation on systolic architectures | 2018-09-14 | Paper |
| Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph | 2017-12-15 | Paper |
| New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets | 2015-07-06 | Paper |
| Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph | 2014-04-16 | Paper |
| Daemon Conversions in Distributed Self-stabilizing Algorithms | 2013-04-12 | Paper |
| SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE | 2013-01-18 | Paper |
| Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks | 2012-07-26 | Paper |
| High Performance Computing - HiPC 2003 | 2009-08-11 | Paper |
| Distributed Computing - IWDC 2003 | 2009-08-06 | Paper |
| Linear time self-stabilizing colorings | 2009-04-28 | Paper |
| An online distributed gossiping protocol for mobile networks | 2007-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494201 | 2006-10-17 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE | 2006-05-10 | Paper |
| Leader election in hierarchical star network | 2005-12-07 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS | 2005-05-06 | Paper |
| A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM | 2004-10-06 | Paper |
| Self-stabilizing multicast protocols for ad hoc networks. | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536977 | 2002-11-06 | Paper |
| SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM | 2002-09-12 | Paper |
| A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph | 2002-08-06 | Paper |
| Maximal matching stabilizes in time \(O(m)\) | 2002-07-25 | Paper |
| Adaptive distributed dynamic channel allocation for wireless networks | 2002-07-22 | Paper |
| Scheduling independent jobs for torus connected networks with/without link contention. | 2002-05-05 | Paper |
| A regular scalable fault tolerant interconnection network for distributed processing | 2002-03-03 | Paper |
| Cored-based tree with forwarding regions (CBT-FR); a protocol for reliable multicasting in mobile ad hoc networks | 2002-01-27 | Paper |
| SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS | 2002-01-17 | Paper |
| UpdateSearch: A new dynamic channel allocation scheme for mobile networks that can adjust to system loads | 2000-11-06 | Paper |
| Wormhole broadcast in hypercubes | 2000-09-19 | Paper |
| A self-stabilizing distributed algorithm to find the median of a tree graph | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4380053 | 1999-12-06 | Paper |
| Wormhole broadcast in star graph networks | 1999-01-12 | Paper |
| SEP: a fixed degree regular network for massively parallel systems | 1999-01-11 | Paper |
| A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH | 1997-05-28 | Paper |
| Trivalent Cayley graphs for interconnection networks | 1997-02-28 | Paper |
| Shortest routing in trivalent Cayley graph network | 1997-02-27 | Paper |
| Scheduling of independent jobs in star graph networks | 1996-12-19 | Paper |
| Incrementally extensible hypercube networks and their fault tolerance | 1996-08-11 | Paper |
| Linear and nonlinear penetrative convection in a porous layer | 1996-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862353 | 1996-02-08 | Paper |
| A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph | 1996-01-11 | Paper |
| Transposition networks as a class of fault-tolerant robust networks | 1996-01-01 | Paper |
| IEH graphs. A novel generalization of hypercube graphs | 1995-12-19 | Paper |
| An almost regular fault tolerant network with arbitrary number of nodes | 1995-07-06 | Paper |
| A depth-first search routing algorithm for star graphs and its performance evaluation | 1994-08-08 | Paper |
| Topological properties of star graphs | 1993-09-01 | Paper |
| A self-stabilizing algorithm for coloring bipartite graphs | 1993-06-29 | Paper |
| Transitions in heat transfer in a rotating porous layer | 1993-01-16 | Paper |
| Load sharing in soft real-time distributed systems | 1993-01-16 | Paper |
| Another distributed algorithm for multiple entries to a critical section | 1992-06-28 | Paper |
| Properties of a class of trivalent network graphs and optimal routing | 1992-06-26 | Paper |
| Marangoni porous convection in a cylindrical geometry. I: Surface tension effects dominant | 1990-01-01 | Paper |
| Marangoni porous convection in a cylindrical geometry. II: Buoyancy effects dominant | 1990-01-01 | Paper |
| New fast parallel algorithm for the connected component problem and its VLSI implementation | 1990-01-01 | Paper |
| Efficient strategy for checkpointing in a transaction oriented database and its performance evaluation | 1989-01-01 | Paper |
| Checkpointing strategies in database systems and their performance evaluation | 1988-01-01 | Paper |
| Worst case performance of weighted buddy systems | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735728 | 1986-01-01 | Paper |
| A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation | 1986-01-01 | Paper |
| A new approach to program verification | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343427 | 1984-01-01 | Paper |
| A simple way to near minimization of microprogram control memory | 1983-01-01 | Paper |
| Impossible pair constrained test path generation in a program | 1982-01-01 | Paper |
| Generalized proof of modified Booth's algorithm | 1981-01-01 | Paper |
| A new algorithm to compute vertex cutsets in a graph | 1981-01-01 | Paper |
| MOS networks and fault-tolerant sequential machines | 1981-01-01 | Paper |
| Checking p-t diagnosability of a system | 1980-01-01 | Paper |
| A new method to test system diagnosability | 1980-01-01 | Paper |
| Enumeration of all minimum feedback edge sets in a directed graph | 1980-01-01 | Paper |
| On certain investigations on self-diagnosable systems | 1980-01-01 | Paper |
| Algebraic analysis of multiple faults in combinational networks | 1980-01-01 | Paper |
| Finite-amplitude cellular convection in a fluidsaturated porous layer | 1980-01-01 | Paper |
| On identification of CR property in file organisation | 1979-01-01 | Paper |
| Algebraic determination of circuits in a directed graph | 1979-01-01 | Paper |
| A new method to find out the chromatic partition of a symmetric graph | 1978-01-01 | Paper |
| Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences" | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4123243 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138757 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140876 | 1976-01-01 | Paper |
