Combinatorica
Sorting in c log n parallel steps
Combinatorica
Fault tolerance in networks of bounded degree
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Constructing disjoint paths on expander graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Locating faults in a constant number of parallel testing rounds
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second 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-tolerant circuit-switching networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Spectral techniques for expander codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Wavelength requirements for multicasting in all-optical networks
IEEE/ACM Transactions on Networking (TON)
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scalable secure storage when half the system is faulty
Information and Computation
Scalable Secure Storage when Half the System Is Faulty
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Essentially Every Unimodular Matrix Defines and Expander
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Edge-Expansion of Graphs
Combinatorics, Probability and Computing
Random Lifts of Graphs: Edge Expansion
Combinatorics, Probability and Computing
On the expansion rate of Margulis expanders
Journal of Combinatorial Theory Series B
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Recursive construction for 3-regular expanders
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Revisiting the Efficiency of Malicious Two-Party Computation
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
On the error parameter of dispersers
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
MV3: a new word based stream cipher using rapid mixing and revolving buffers
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
A note on searching line arrangements and applications
Information Processing Letters
| Hi-index | 0.00 |