A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Asymptotic behavior of the chromatic index for hypergraphs
Journal of Combinatorial Theory Series A
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
The Ramsey number R(3, t) has order of magnitude t2/log t
Random Structures & Algorithms
On the complexity of distributed network decomposition
Journal of Algorithms
Asymptotically good list-colorings
Journal of Combinatorial Theory Series A
Nearly optimal distributed edge coloring in O(log log n) rounds
Random Structures & Algorithms
Near-Optimal Distributed Edge Coloring
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
Combinatorics, Probability and Computing
Fast distributed algorithms for Brooks-Vizing colourings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Parallel I/O scheduling using randomized, distributed edge coloring algorithms
Journal of Parallel and Distributed Computing
Fast parallel edge colouring of graphs
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
An experimental study of a simple, distributed edge-coloring algorithm
Journal of Experimental Algorithmics (JEA)
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited
Journal of Parallel and Distributed Computing
A route-based scheduling in wireless multi-hop mesh networks for collision avoidance
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Hi-index | 0.00 |