NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
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
Expanding graphs and the average-case analysis of algorithms for matchings and related problems
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)
On a random walk problem arising in self-stabilizing token management
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the hardness of computing the permanent of random matrices (extended abstract)
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
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Average-case analysis of algorithms for matchings and related problems
Journal of the ACM (JACM)
Towards an analysis of local optimization algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Towards a polynomial-time randomized algorithm for closed product-form networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating permanents of complex matrices
STOC '00 Proceedings of the thirty-second 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
Clifford algebras and approximating the permanent
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating Probabilistic Inference in Bayesian Belief Networks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Secure Multiparty Computation of Approximations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Clifford algebras and approximating the permanent
Journal of Computer and System Sciences - STOC 2002
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Accelerating simulated annealing for the permanent and combinatorial counting problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SIGACT news complexity theory column 51
ACM SIGACT News
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Fast approximation of the permanent for very dense problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the second eigenvalue of random regular graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
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
Constructing and sampling graphs with a prescribed joint degree distribution
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |