Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Sampling and integration of near log-concave functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the number of Eularian orientations of a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The reliability of queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
What do we know about the Metropolis algorithm?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Exactly learning automata with small cover time
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Faster isomorphism testing of strongly regular graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An efficient algorithm for the vertex-disjoint paths problem in random graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Simple Markov-chain algorithms for generating bipartite graphs and tournaments
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The path resistance method for bounding &lgr;2 of a Laplacian
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Graph orientations with no sink and an approximation for a hard case of #SAT
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random regular graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Estimating interpolation error: a combinatorial approach
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Testable algorithms for self-avoiding walks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Faster random generation of linear extensions
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Edge-disjoint paths in expander graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Diffusive load balancing schemes on heterogeneous networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computational Optimization and Applications
Approximating Probabilistic Inference in Bayesian Belief Networks
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
On Logarithmic Simulated Annealing
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Load balancing of unit size tokens and expansion properties of graphs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Approximate counting by dynamic programming
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Computer and System Sciences - STOC 2002
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
Large Deviation Bounds for Markov Chains
Combinatorics, Probability and Computing
ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
Probability in the Engineering and Informational Sciences
Torpid mixing of simulated tempering on the Potts model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
ON THE SPECTRAL GAP OF A TIME REVERSIBLE MARKOV CHAIN
Probability in the Engineering and Informational Sciences
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Dynamic load balancing by diffusion in heterogeneous systems
Journal of Parallel and Distributed Computing
Slow mixing of glauber dynamics via topological obstructions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
Combinatorics, Probability and Computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Compression of samplable sources
Computational Complexity
A divide-and-merge methodology for clustering
ACM Transactions on Database Systems (TODS)
On Different Models for Packet Flow in Multistage Interconnection Networks
Fundamenta Informaticae
Agent-based randomized broadcasting in large networks
Discrete Applied Mathematics
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Filtering spam with behavioral blacklisting
Proceedings of the 14th ACM conference on Computer and communications security
Sampling stable marriages: why spouse-swapping won't work
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Local approximation of pagerank and reverse pagerank
Proceedings of the 17th ACM conference on Information and knowledge management
A Sequential Algorithm for Generating Random Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficient identification of starters and followers in social media
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Sampling Eulerian orientations of triangular lattice graphs
Journal of Discrete Algorithms
A new perspective on implementation by voting trees
Proceedings of the 10th ACM conference on Electronic commerce
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Faster Algorithms for Sampling and Counting Biological Sequences
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science
Foundations and Trends® in Theoretical Computer Science
The trichotomy of HAVING queries on a probabilistic database
The VLDB Journal — The International Journal on Very Large Data Bases
A graph-spectral method for surface height recovery
Pattern Recognition
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The second eigenvalue of random walks on symmetric random intersection graphs
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Rateless packet approach for data gathering wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
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
Liftings of tree-structured Markov chains
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Biased selection for building small-world networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Journal of Combinatorial Optimization
Spectral Sparsification of Graphs
SIAM Journal on Computing
Pseudorandomness and derandomization
XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The effect of boundary conditions on mixing rates of markov chains
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Multi-way spectral partitioning and higher-order cheeger inequalities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Paper: A tutorial introduction to stochastic simulation algorithms for belief networks
Artificial Intelligence in Medicine
GANC: Greedy agglomerative normalized cut for graph clustering
Pattern Recognition
Constructing and sampling graphs with a prescribed joint degree distribution
Journal of Experimental Algorithmics (JEA)
On Different Models for Packet Flow in Multistage Interconnection Networks
Fundamenta Informaticae
Expander properties and the cover time of random intersection graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Spectral sparsification of graphs: theory and algorithms
Communications of the ACM
| Hi-index | 0.03 |