Sciweavers

57 search results - page 3 / 12
» Complexity of Ring Morphism Problems
Sort
View
LICS
2000
IEEE
13 years 10 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
IPPS
2006
IEEE
14 years 5 days ago
Distributed algorithm for a color assignment on asynchronous rings
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
Gianluca De Marco, Mauro Leoncini, Manuela Montang...
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
13 years 10 months ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen
INFOCOM
2002
IEEE
13 years 11 months ago
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...
Dirceu Cavendish, Bhaskar Sengupta
COCOA
2010
Springer
13 years 4 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...