Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Existence and Construction of Edge-Disjoint Pathson Expander Graphs
SIAM Journal on Computing
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Multicommodity Flow and Circuit Switching
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Graph Theory With Applications
Graph Theory With Applications
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Edge-disjoint paths in expander graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |