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
Routing permutations on graphs via matchings
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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)
A near optimal algorithm for edge separators (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
What do we know about the Metropolis algorithm?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
STOC '98 Proceedings of the thirtieth 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)
Proceedings of the seventh 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
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth 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
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating permanents of complex matrices
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Sampling plausible solutions to multi-body constraint problems
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Computing in Science and Engineering
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
Clifford algebras and approximating the permanent
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Cross-entropy and rare events for maximal cut and partition problems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
Expansion of product replacement graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence
An O(n2) bound for the relaxation time of a Markov chain on cladograms
Random Structures & Algorithms
Approximating Probabilistic Inference in Bayesian Belief Networks
IEEE Transactions on Pattern Analysis and Machine Intelligence
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,
Alternative Algorithms for Counting All Matchings in Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Analysis of Absorbing Times of Quantum Walks
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Load balancing of unit size tokens and expansion properties of graphs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
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
Clifford algebras and approximating the permanent
Journal of Computer and System Sciences - STOC 2002
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
Expanding and forwarding parameters of product graphs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
Probability in the Engineering and Informational Sciences
A determinant-based algorithm for counting perfect matchings in a general graph
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Tilings of rectangles with T-tetrominoes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Counting without sampling: new algorithms for enumeration problems using statistical physics
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
SIGACT news complexity theory column 51
ACM SIGACT News
Compression of samplable sources
Computational Complexity
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms
Simple Monte Carlo and the Metropolis algorithm
Journal of Complexity
Fast approximation of the permanent for very dense problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Estimating PageRank on graph streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Perfect simulation with exponential tails on the running time
Random Structures & Algorithms
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
Random Structures & Algorithms
Explicit error bounds for lazy reversible Markov chain Monte Carlo
Journal of Complexity
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Sampling Eulerian orientations of triangular lattice graphs
Journal of Discrete Algorithms
The flip markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing
Mathematics of Operations Research
The Glauber Dynamics for Colourings of Bounded Degree Trees
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A distributed dynamical scheme for fastest mixing Markov chains
ACC'09 Proceedings of the 2009 conference on American Control Conference
Probabilistic Verification and Approximation
Electronic Notes in Theoretical Computer Science (ENTCS)
Supervised self-organization of homogeneous swarms using ergodic projections of Markov chains
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Problems on RNA secondary structure prediction and design
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On approximating minimum infrequent and maximum frequent sets
DS'07 Proceedings of the 10th international conference on Discovery science
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
Journal of Computer and System Sciences
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
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
On the hardness of counting and sampling center strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Estimating PageRank on graph streams
Journal of the ACM (JACM)
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of mixed discriminants and related problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Almost FPRAS for lattice models of protein folding
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
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
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Weighted counting of k-matchings is #w[1]-hard
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
On the Hardness of Counting and Sampling Center Strings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.06 |