Randomness-Efficient Sampling within NC1
Computational Complexity
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Learning dynamics: system identification for perceptually challenged agents
Artificial Intelligence
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Journal of the ACM (JACM)
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Local partitioning for directed graphs using PageRank
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
High-ordered random walks and generalized laplacians on hypergraphs
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Introduction to testing graph properties
Studies in complexity and cryptography
The network as a storage device: dynamic routing with bounded buffers
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
Derandomized squaring of graphs
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
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM (JACM)
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
The Journal of Machine Learning Research
Hi-index | 0.01 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...