Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Tolerating linear number of faults in networks of bounded degree
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Fault diagnosis in a small constant number of parallel testing rounds
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Construction of the mesh and the torus tolerating a large number of faults
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Linear-time encodable and decodable error-correcting codes
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fault tolerant networks with small degree
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Mixing time and long paths in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-Tolerant Meshes with Small Degree
IEEE Transactions on Computers
Hamilton cycles in random subgraphs of pseudo-random graphs
Discrete Mathematics
Optimal fault-tolerant linear arrays
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Distributed communication algorithms for ad hoc mobile networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Regular pairs in sparse random graphs I
Random Structures & Algorithms
The emergence of a giant component in random subgraphs of pseudo-random graphs
Random Structures & Algorithms
Sparse networks tolerating random faults
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The effect of faults on network expansion
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Mobile Networks and Applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fault Tolerant Asynchronous Adder through Dynamic Self-reconfiguration
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Efficient gossip and robust distributed computation
Theoretical Computer Science
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Expanders and time-restricted branching programs
Theoretical Computer Science
Proceedings of the forty-first annual ACM symposium on Theory of computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Derandomizing graph tests for homomorphism
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the derandomization of the graph test for homomorphism over groups
Theoretical Computer Science
Modular orientations of random and quasi-random regular graphs
Combinatorics, Probability and Computing
Deterministic polynomial-time algorithms for designing short DNA words
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
The size Ramsey number of a directed path
Journal of Combinatorial Theory Series B
Fighting constrained fires in graphs
Theoretical Computer Science
The Grothendieck constant of random and pseudo-random graphs
Discrete Optimization
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.01 |