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
Limits on the provable consequences of one-way permutations
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
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Limits on the provable consequences of one-way permutations (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
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
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Making zero-knowledge provers efficient
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
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Computational complexity and knowledge complexity (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Monte Carlo approximation of form factors with error bounded a priori
Proceedings of the eleventh annual symposium on Computational geometry
A competitive approach to game learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Approximately counting up to four (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exact sampling and approximate counting techniques
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Counting and random generation of strings in regular languages
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
RCN algorithms for the uniform generation of combinatorial structures
Proceedings of the seventh 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
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth 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
Proceedings of the ninth 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
Uniform generation in spatial constraint databases and applications (Extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A faster method for sampling independent sets
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Electrostatic fields without singularities: theory and algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distribution functions of probabilistic automata
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
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Counting by quantum eigenvalue estimation
Theoretical Computer Science
SIGACT News complexity theory column 32
ACM SIGACT News
The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved bounds for sampling contingency tables
Random Structures & Algorithms
Approximating Probabilistic Inference in Bayesian Belief Networks
IEEE Transactions on Pattern Analysis and Machine Intelligence
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Parallel 'Go with the Winners' Algorithms in the LogP Model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Secure Multiparty Computation of Approximations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Generating Partial and Multiple Transversals of a Hypergraph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Generalized Model-Checking over Locally Tree-Decomposable Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms for Almost-uniform Generation with an Unbiased Binary Source
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Note on Bounding the Mixing Time by Linear Programming
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Counting and Sampling H-Colourings
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
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
On Approximating the Number of Bases of Exchange Preserving Matroids
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Randomly coloring graphs of girth at least five
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
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
Journal of Computer and System Sciences - STOC 2002
Counting and sampling H-colourings
Information and Computation
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
Distributed Computing
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximately counting integral flows and cell-bounded contingency tables
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Coupling with the stationary distribution and improved sampling for colorings and independent sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling binary contingency tables with a greedy start
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Accelerating simulated annealing for the permanent and combinatorial counting problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Simulated annealing in convex bodies and an O*(n4) volume algorithm
Journal of Computer and System Sciences - Special issue on FOCS 2003
Compression of samplable sources
Computational Complexity
Uniform generation in spatial constraint databases and applications
Journal of Computer and System Sciences
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
Journal of Computer and System Sciences
Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Inapproximability of the Tutte polynomial
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Proving SAT does not have small circuits with an application to the two queries problem
Journal of Computer and System Sciences
Fast approximation of the permanent for very dense problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability of the Tutte polynomial
Information and Computation
The Complexity of Distinguishing Markov Random Fields
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
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
Limitations of Hardness vs. Randomness under Uniform Reductions
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
Random sampling of colourings of sparse random graphs with a constant number of colours
Theoretical Computer Science
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Mining search engine query logs via suggestion sampling
Proceedings of the VLDB Endowment
Generating XML structure using examples and constraints
Proceedings of the VLDB Endowment
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
The gene evolution model and computing its associated probabilities
Journal of the ACM (JACM)
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Proceedings of the forty-first annual ACM symposium on Theory of computing
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
On the hardness of approximate reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
From sampling to model counting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Longest common subsequence as private search
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Approximating the number of frequent sets in dense data
Knowledge and Information Systems
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Approximating the partition function of the ferromagnetic Potts model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of approximately counting stable matchings
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Rigorous confidence bounds for MCMC under a geometric drift condition
Journal of Complexity
On the hardness of counting and sampling center strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
SIAM Journal on Computing
Journal of the ACM (JACM)
Quantum Information & Computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Studies in complexity and cryptography
Improved inapproximability results for counting independent sets in the hard-core model
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Journal of Combinatorial Optimization
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
Theoretical Computer Science
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Colorful triangle counting and a MapReduce implementation
Information Processing Letters
An almost linear time approximation algorithm for the permanent of a random (0-1) matrix
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
The complexity of approximately counting stable matchings
Theoretical Computer Science
Approximating the number of Double Cut-and-Join scenarios
Theoretical Computer Science
Sampling colourings of the triangular lattice
Random Structures & Algorithms
The complexity of approximately counting stable roommate assignments
Journal of Computer and System Sciences
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
Approximating the partition function of the ferromagnetic Potts model
Journal of the ACM (JACM)
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Optimal Monte Carlo integration with fixed relative precision
Journal of Complexity
Efficient negative selection algorithms by sampling and approximate counting
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
On the Hardness of Counting and Sampling Center Strings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Ontology-based access to probabilistic data with OWL QL
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Lee-Yang theorems and the complexity of computing averages
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A scalable and nearly uniform generator of SAT witnesses
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
The expressibility of functions on the boolean domain, with applications to counting CSPs
Journal of the ACM (JACM)
Theoretical Computer Science
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Applied Mathematics
Counting subsets of contingency tables
Computational Statistics
| Hi-index | 5.24 |