Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The Swendsen-Wang process does not always mix rapidly
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case
IEEE Transactions on Computers
Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Sampling spin configurations of an Ising system
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing in Science and Engineering
Cross-entropy and rare events for maximal cut and partition problems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
Computational Optimization and Applications
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
IEEE Transactions on Pattern Analysis and Machine Intelligence
A bounding chain for Swendsen-Wang
Random Structures & Algorithms
Parallel 'Go with the Winners' Algorithms in the LogP Model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
On Logarithmic Simulated Annealing
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Parallel 'go with the winners' algorithms in distributed memory models
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
Combinatorics, Probability and Computing
A Path Method for the Logarithmic Sobolev Constant
Combinatorics, Probability and Computing
Semi-supervised learning using randomized mincuts
ICML '04 Proceedings of the twenty-first international conference on Machine learning
The Complexity of Ferromagnetic Ising with Local Fields
Combinatorics, Probability and Computing
On the Ashkin–Teller Model and Tutte–Whitney Functions
Combinatorics, Probability and Computing
Structured Prediction, Dual Extragradient and Bregman Projections
The Journal of Machine Learning Research
Learning Factor Graphs in Polynomial Time and Sample Complexity
The Journal of Machine Learning Research
Inapproximability of the Tutte polynomial
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Counting good truth assignments of random k-SAT formulae
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability of the Tutte polynomial
Information and Computation
Discriminative Learning of Max-Sum Classifiers
The Journal of Machine Learning Research
Approximately Counting Embeddings into Random Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
Theoretical Computer Science
Efficient reinforcement learning in factored MDPs
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Efficient Markov network structure discovery using independence tests
Journal of Artificial Intelligence Research
Energy scaling laws for distributed inference in random fusion networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Approximating the partition function of the ferromagnetic Potts model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Sparse reliable graph backbones
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Approximating partition functions of the two-state spin system
Information Processing Letters
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The computational complexity of estimating MCMC convergence time
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
A new class of upper bounds on the log partition function
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Sparse reliable graph backbones
Information and Computation
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Proceedings of the twenty-third 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 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
Journal of Computer and System Sciences
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Approximating the partition function of the ferromagnetic Potts model
Journal of the ACM (JACM)
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
Journal of Computer and System Sciences
Hitting time of quantum walks with perturbation
Quantum Information Processing
The expressibility of functions on the boolean domain, with applications to counting CSPs
Journal of the ACM (JACM)
Variational algorithms for marginal MAP
The Journal of Machine Learning Research
| Hi-index | 0.01 |