Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved bounds on the sample complexity of learning
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Largest planar matching in random bipartite graphs
Random Structures & Algorithms
The Probability of a Rendezvous is Minimal in Complete Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Machine Learning
Randomly coloring graphs of girth at least five
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Concentration inequalities for the missing mass and for histogram rule error
The Journal of Machine Learning Research
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Regression Dependence In Latent Variable Models
Probability in the Engineering and Informational Sciences
Negative dependence in the balls and bins experiment with applications to order statistics
Journal of Multivariate Analysis
Distribution sort with randomized cycling
Journal of the ACM (JACM)
Positive Influence and Negative Dependence
Combinatorics, Probability and Computing
Domination analysis for minimum multiprocessor scheduling
Discrete Applied Mathematics
Counting distinct items over update streams
Theoretical Computer Science
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Less hashing, same performance: building a better bloom filter
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Stability in the self-organized evolution of networks
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Random Structures & Algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
An optimal algorithm for the distinct elements problem
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the bit communication complexity of randomized rumor spreading
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Small subset queries and bloom filters using ternary associative memories, with applications
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Efficient information exchange in the random phone-call model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Negative dependence and srinivasan's sampling process
Combinatorics, Probability and Computing
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Spectral Sparsification of Graphs
SIAM Journal on Computing
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums
SIAM Journal on Computing
Efficient sketches for the set query problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Overlap properties of geometric expanders: extended abstract
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Leader election in shared spectrum radio networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Conditional negative association for competing urns
Random Structures & Algorithms
Tail bounds for the height and width of a random tree with a given degree sequence
Random Structures & Algorithms
Converting online algorithms to local computation algorithms
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Probabilistic techniques in algorithmic game theory
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Efficient sampling of non-strict turnstile data streams
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |