Distributed Soft Path Coloring
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Distributed O(Delta log(n))-Edge-Coloring Algorithm
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Distributed packing in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Space efficient and time optimal distributed BFS tree construction
Information Processing Letters
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deploying wireless networks with beeps
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Reliably detecting connectivity using local graph traits
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed deterministic edge coloring using bounded neighborhood independence
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Distributed spanner construction in doubling metric spaces
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Distributed approximation algorithms for planar graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Efficient distributed breadth-first search algorithm
Computer Communications
On the locality of some NP-complete problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the complexity of distributed greedy coloring
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Distributed approximation algorithms for weighted problems in minor-closed families
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parallel graph decompositions using random shifts
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Information and Computation
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...