The Swendsen-Wang process does not always mix rapidly
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Recovery time of dynamic allocation processes
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
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
Delayed path coupling and generating random permutations via distributed stochastic processes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster random generation of linear extensions
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Sampling plausible solutions to multi-body constraint problems
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
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
International Journal of Computer Vision - Special issue on statistical and computational theories of vision: Part II
Computing in Science and Engineering
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering Categorical Data: An Approach Based on Dynamical Systems
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
An Empirical-Statistical Agenda for Recognition
Shape, Contour and Grouping in Computer Vision
Alternative Algorithms for Counting All Matchings in Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
The "Burnside Process" Converges Slowly
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Efficiently Approximating Weighted Sums with Exponentially Many Terms
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Clustering categorical data: an approach based on dynamical systems
The VLDB Journal — The International Journal on Very Large Data Bases
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Similarity of personal preferences: theoretical foundations and empirical analysis
Artificial Intelligence
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Counting Independent Sets in Sparse Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Computer and System Sciences - STOC 2002
The ‘Burnside Process’ Converges Slowly
Combinatorics, Probability and Computing
The evolutionary capacity of protein structures
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
Probability in the Engineering and Informational Sciences
Slow mixing of Glauber dynamics for the hard-core model on the hypercube
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
On approximating weighted sums with exponentially many terms
Journal of Computer and System Sciences
On modeling profiles instead of values
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Random generation of 2×2×...×2×Jcontingency tables
Theoretical Computer Science
Efficiency test of pseudorandom number generators using random walks
Journal of Computational and Applied Mathematics
The cover time of two classes of random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
Computing in Science and Engineering
Probability in the Engineering and Informational Sciences
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs
Random Structures & Algorithms
Uniform random sampling of traces in very large models
Proceedings of the 1st international workshop on Random testing
Compression of samplable sources
Computational Complexity
Journal of Combinatorial Theory Series A
Approximate/perfect samplers for closed Jackson networks
WSC '05 Proceedings of the 37th conference on Winter simulation
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
IEEE Transactions on Pattern Analysis and Machine Intelligence
Weakly Supervised Scale-Invariant Learning of Models for Visual Recognition
International Journal of Computer Vision
The cover time of the preferential attachment graph
Journal of Combinatorial Theory Series B
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Every Linear Threshold Function has a Low-Weight Approximator
Computational Complexity
Torpid mixing of local Markov chains on 3-colorings of the discrete torus
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Simulated Annealing versus Metropolis for a TSP instance
Information Processing Letters
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Random Structures & Algorithms
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours
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
Coverage-biased Random Exploration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
The cover time of random geometric graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Sequential cavity method for computing limits of the log-partition function for lattice models
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
Theoretical Computer Science
Tracking many objects with many sensors
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Approximate inference for first-order probabilistic languages
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Approximating the number of frequent sets in dense data
Knowledge and Information Systems
Probabilistic structured predictors
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
On probabilistic fixpoint and Markov chain query languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Supporting ranking queries on uncertain and incomplete data
The VLDB Journal — The International Journal on Very Large Data Bases
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Uniform sampling of digraphs with a fixed degree sequence
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Using markov-chain mixing time estimates for the analysis of ant colony optimization
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Toward case-based preference elicitation: similarity measures on preference structures
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
SIAM Journal on Computing
A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Simulated annealing beats metropolis in combinatorial optimization
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Component structure of the vacant set induced by a random walk on a random graph
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Crossover can provably be useful in evolutionary computation
Theoretical Computer Science
Correlation decay and deterministic FPTAS for counting colorings of a graph
Journal of Discrete Algorithms
A flat histogram method for computing the density of states of combinatorial problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Two approaches to understanding when constraints help clustering
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Towards distributed MCMC inference in probabilistic knowledge bases
AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction
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 invariance principle for polytopes
Journal of the ACM (JACM)
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
Beam search algorithms for multilabel learning
Machine Learning
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
| Hi-index | 0.00 |