Complexity of network synchronization
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
The power of Collision: randomized parallel algorithms for chaining and integer sorting
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
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
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems (integer programming)
Distributed scheduling algorithms to improve the performance of parallel data transfers
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Applying randomized edge coloring algorithms to distributed communication: an experimental study
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth 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
Fast practical algorithms for the Boolean-product-witness-matrix problem
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Parallel I/O scheduling using randomized, distributed edge coloring algorithms
Journal of Parallel and Distributed Computing
Scheduling against an adversarial network
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
An experimental study of a simple, distributed edge-coloring algorithm
Journal of Experimental Algorithmics (JEA)
IEEE Transactions on Signal Processing
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Approximate top-k queries in sensor networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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 |