STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The reliability of queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
What do we know about the Metropolis algorithm?
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
Approximately counting up to four (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An interruptible algorithm for perfect sampling via Markov chains
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Distributed cooperative Bayesian learning strategies
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
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
Recovery time of dynamic allocation processes
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Towards a polynomial-time randomized algorithm for closed product-form networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Stopping criterion for a simulation-based optimization method
Proceedings of the 30th conference on Winter simulation
Efficient learning in Boltzmann machines using linear response theory
Neural Computation
Majorizing estimators and the approximation of #P-complete problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
RCN algorithms for the uniform generation of combinatorial structures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Delayed path coupling and generating random permutations via distributed stochastic processes
Proceedings of the tenth 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
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Diffusive load balancing schemes on heterogeneous networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computational Optimization and Applications
Evolution towards the Maximum Clique
Journal of Global Optimization
Near-Optimal Reinforcement Learning in Polynomial Time
Machine Learning
Random Structures & Algorithms
Decomposition Methods and Sampling Circuits in the Cartesian Lattice
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Random Generation of Bayesian Networks
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
The algorithmics of folding proteins on lattices
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
A Markov chain sequence generator for power macromodeling
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Similarity of personal preferences: theoretical foundations and empirical analysis
Artificial Intelligence
A Method for Real-Time Scheduling Problems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
A Path Method for the Logarithmic Sobolev Constant
Combinatorics, Probability and Computing
Torpid mixing of simulated tempering on the Potts model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Generating connected acyclic digraphs uniformly at random
Information Processing Letters
Weighted expanders and the anisotropic Alon-Boppana theorem
European Journal of Combinatorics
Tilings of rectangles with T-tetrominoes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
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
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms.
Evolutionary Computation
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
Combinatorics, Probability and Computing
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Journal of Combinatorial Theory Series A
State-dependent Importance Sampling and large Deviations
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
Sampling stable marriages: why spouse-swapping won't work
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Random sampling from a search engine's index
Journal of the ACM (JACM)
Computational Geometry: Theory and Applications
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Simrank++: query rewriting through link analysis of the click graph
Proceedings of the VLDB Endowment
Local approximation of pagerank and reverse pagerank
Proceedings of the 17th ACM conference on Information and knowledge management
Optimal search-relocation trade-off in Markovian-target searching
Computers and Operations Research
Generating random graphs with large girth
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph matching using the interference of discrete-time quantum walks
Image and Vision Computing
Coined quantum walks lift the cospectrality of graphs and trees
Pattern Recognition
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Protein structure prediction on the face centered cubic lattice by local search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science
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
Output space sampling for graph patterns
Proceedings of the VLDB Endowment
Note: The hitting and cover times of Metropolis walks
Theoretical Computer Science
Congestion and almost invariant sets in dynamical systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
The second eigenvalue of random walks on symmetric random intersection graphs
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Anonymity in the wild: mixes on unstructured networks
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science
How to design a linear cover time random walk on a finite graph
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Necessary and sufficient conditions for success of the metropolis algorithm for optimization
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Algorithms and theory of computation handbook
Information theoretic bounds for distributed computation over networks of point-to-point channels
IEEE Transactions on Information Theory
Privacy amplification with social networks
Proceedings of the 15th international conference on Security protocols
Uniform sampling of digraphs with a fixed degree sequence
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
Generating random graphic sequences
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
Quantum Information & Computation
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
Generating constrained random graphs using multiple edge switches
Journal of Experimental Algorithmics (JEA)
Toward case-based preference elicitation: similarity measures on preference structures
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
An Expansion Tester for Bounded Degree Graphs
SIAM Journal on Computing
On the convergence rate of quasi lumpable markov chains
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Quantum complexity of testing group commutativity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On weighted balls-into-bins games
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Towards unitary representations for graph matching
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Almost FPRAS for lattice models of protein folding
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Coined quantum walks lift the cospectrality of graphs and trees
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computer Science Review
Efficient enumeration of the directed binary perfect phylogenies from incomplete data
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Information Processing Letters
On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions
Fundamenta Informaticae
Expander properties and the cover time of random intersection graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
An extension of geiringer's theorem for a wide class of evolutionary search algorithms
Evolutionary Computation
On estimating the average degree
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.06 |