| Publication | Date of Publication | Type |
|---|
Alternators on uniform rings of odd size
Distributed Computing | 2020-12-04 | Paper |
| Self-stabilizing \(2^m\)-clock for unidirectional rings of odd size | 2020-12-03 | Paper |
Self-stabilizing token circulation in uniform networks
Distributed Computing | 2020-12-02 | Paper |
An efficient routing algorithm for realizing linear permutations on p/sup t/-shuffle-exchange networks
IEEE Transactions on Computers | 2018-09-14 | Paper |
Four-state stabilizing phase clock for unidirectional rings of odd size
Information Processing Letters | 2016-06-09 | Paper |
Distributed edge coloration for bipartite networks
Distributed Computing | 2013-06-28 | Paper |
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Information Processing Letters | 2010-08-16 | Paper |
A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Information Processing Letters | 2010-01-29 | Paper |
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Information Processing Letters | 2009-12-04 | Paper |
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters | 2009-12-04 | Paper |
Self-stabilizing token circulation on uniform trees by using edge-tokens
Lecture Notes in Computer Science | 2004-03-21 | Paper |
A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes
Information Processing Letters | 2003-06-24 | Paper |
Optimal 1-fair alternators
Information Processing Letters | 2002-07-14 | Paper |
Self-stabilizing depth-first token circulation on networks
Distributed Computing | 1995-11-22 | Paper |
Identity assignment in uniform synchronous rings
Information Processing Letters | 1994-04-05 | Paper |
A self-stabilizing algorithm for maximal matching
Information Processing Letters | 1993-01-17 | Paper |
A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph
Parallel Computing | 1992-10-07 | Paper |
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters | 1992-06-28 | Paper |
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters | 1992-06-27 | Paper |
A linear systolic algorithm for the connected component problem
BIT | 1989-01-01 | Paper |
K-way bitonic sort
IEEE Transactions on Computers | 1989-01-01 | Paper |
A fully distributed termination detection scheme
Information Processing Letters | 1988-01-01 | Paper |
Self-routing technique in perfect-shuffle networks using control tags
IEEE Transactions on Computers | 1988-01-01 | Paper |
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers | 1986-01-01 | Paper |
