A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
The complexity of parallel search
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Rapid randomized pruning for fast greedy distributed algorithms
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A real elementary approach to the master recurrence and generalizations
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Computing the least median of squares estimator in time O(nd)
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Robust network supercomputing with malicious processes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |