A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A time-randomness trade-off for oblivious routing
SIAM Journal on Computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Improved approximation algorithms for shop scheduling problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Approximation algorithms for multicommodity flow and shop scheduling problems
Approximation algorithms for multicommodity flow and shop scheduling problems
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Chernoff-Hoeffding Bounds for Applications with Limited Independence
Chernoff-Hoeffding Bounds for Applications with Limited Independence
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Space-efficient routing in vertex-symmetric networks (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomized path coloring on binary trees
Theoretical Computer Science
Randomized path coloring on binary trees
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Randomized Algorithm for Flow Shop Scheduling
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Gossiping by Packets in Faulty Networks
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Parsimonious estimates of bandwidth requirement for quality of service packet networks
Performance Evaluation - Performance modelling and evaluation of heterogeneous networks
Simpler algorithm for estimating frequency moments of data streams
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Counting distinct items over update streams
Theoretical Computer Science
SIAM Journal on Imaging Sciences
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
An efficient and fair MAC protocol robust to reactive interference
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |