On the public citation graph
Approximating the Permanent
0 signed · 703 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-6200-8openalex-snapshot
Markov Chain Models — Rarity and Exponentiality
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf00535487openalex-snapshot
Generating a random permutation with random transpositions
inferredcites →https://doi.org/10.1007/bf01010403openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bf01025864openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bf01582166openalex-snapshot
Convergence of an annealing algorithm
inferredcites →https://doi.org/10.1007/bfb0068322openalex-snapshot
Random walks on finite groups and rapidly mixing markov chains
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0020-0190(89)90115-4openalex-snapshot
On coupling and the approximation of the permanent
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1016/0890-5401(89)90067-9openalex-snapshot
Approximate counting, uniform generation and rapidly mixing Markov chains
inferredcites →https://doi.org/10.1017/s0269964800000267openalex-snapshot
On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
inferredcites →https://doi.org/10.1090/s0002-9947-1988-0930082-9openalex-snapshot
Bounds on the 𝐿² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality
inferredcites →https://doi.org/10.1109/sfcs.1983.35openalex-snapshot
Monte-Carlo algorithms for enumeration and reliability problems
inferredcites →https://doi.org/10.1109/sfcs.1988.21957openalex-snapshot
Polytopes, permanents and graphs with large factors
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0222021openalex-snapshot
A Monte-Carlo Algorithm for Estimating the Permanent
inferredcites →https://doi.org/10.1145/12130.12136openalex-snapshot
How hard is it to marry at random? (On the approximation of the permanent)
inferredcites →https://doi.org/10.1145/42282.46160openalex-snapshot
The time complexity of maximum matching by simulated annealing
inferredcites →https://doi.org/10.1145/800061.808740openalex-snapshot
The complexity of approximate counting
inferredcites →https://doi.org/10.1287/moor.13.2.311openalex-snapshot
Cooling Schedules for Optimal Annealing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.966345openalex-extracted
On the Computational Complexity of MCMC-Based Estimators in Large Samples
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199612)9:4<403::aid-rsa4>3.0.co;2-0openalex-snapshot
Multiple cover time
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199712)11:4<299::aid-rsa2>3.0.co;2-uopenalex-snapshot
A semidefinite bound for mixing rates of Markov chains
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(1999010)14:1<29::aid-rsa2>3.0.co;2-xopenalex-snapshot
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199910/12)15:3/4<210::aid-rsa2>3.0.co;2-ropenalex-snapshot
The Tutte polynomial
inferred← citeshttps://doi.org/10.1002/1098-2418(200101)18:1<1::aid-rsa1>3.0.co;2-7openalex-snapshot
Coupling vs. conductance for the Jerrum-Sinclair chain
inferred← citeshttps://doi.org/10.1002/9780470012505.tam006openalex-snapshot
M arkov Chain M onte C arlo Methods
inferred← citeshttps://doi.org/10.1002/9781118445112.stat04385openalex-snapshot
M arkov Chain M onte C arlo Methods
inferred← citeshttps://doi.org/10.1002/cpa.21718openalex-snapshot
Mixing Times of Critical Two‐Dimensional Potts Models
inferred← citeshttps://doi.org/10.1002/jgt.20180openalex-snapshot
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
inferred← citeshttps://doi.org/10.1002/jgt.23253openalex-snapshot
A Nordhaus–Gaddum Problem for the Spectral Gap of a Graph
inferred← citeshttps://doi.org/10.1002/net.3230250305openalex-snapshot
Monte Carlo and Markov Chain techniques for network reliability and sampling
inferred← citeshttps://doi.org/10.1002/nla.1844openalex-snapshot
A load balancing strategy for parallel computation of sparse permanents
inferred← citeshttps://doi.org/10.1002/rsa.1029openalex-snapshot
An O(n2) bound for the relaxation time of a Markov chain on cladograms
inferred← citeshttps://doi.org/10.1002/rsa.20135openalex-snapshot
The geometry of logconcave functions and sampling algorithms
inferred← citeshttps://doi.org/10.1002/rsa.20155openalex-snapshot
Sampling binary contingency tables with a greedy start
inferred← citeshttps://doi.org/10.1002/rsa.20212openalex-snapshot
Perfect simulation with exponential tails on the running time
inferred← citeshttps://doi.org/10.1002/rsa.20236openalex-snapshot
Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models
inferred← citeshttps://doi.org/10.1002/rsa.20569openalex-snapshot
Mixing of the Glauber dynamics for the ferromagnetic Potts model
inferred← citeshttps://doi.org/10.1002/rsa.20752openalex-snapshot
Cover time and mixing time of random walks on dynamic graphs
inferred← citeshttps://doi.org/10.1002/rsa.20949openalex-snapshot
Rapid mixing of the switch Markov chain for strongly stable degree sequences
inferred← citeshttps://doi.org/10.1002/rsa.21003openalex-snapshot
Counting independent sets in graphs with bounded bipartite pathwidth
inferred← citeshttps://doi.org/10.1002/rsa.21036openalex-snapshot
Algebraic and combinatorial expansion in random simplicial complexes
inferred← citeshttps://doi.org/10.1002/rsa.21074openalex-snapshot
Efficiently list-edge coloring multigraphs asymptotically optimally
inferred← citeshttps://doi.org/10.1002/rsa.21079openalex-snapshot
Perfect sampling from spatial mixing
inferred← citeshttps://doi.org/10.1002/rsa.21131openalex-snapshot
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
inferred← citeshttps://doi.org/10.1002/rsa.21135openalex-snapshot
Smoothed counting of 0–1 points in polyhedra
inferred← citeshttps://doi.org/10.1002/rsa.21191openalex-snapshot
Spatial mixing and the random‐cluster dynamics on lattices
inferred← citeshttps://doi.org/10.1002/rsa.3240030303openalex-snapshot
Counting the Number of Hamilton Cycles in Random Digraphs
inferred← citeshttps://doi.org/10.1002/rsa.3240030402openalex-snapshot
Large Cliques Elude the Metropolis Process
inferred← citeshttps://doi.org/10.1002/rsa.3240050208openalex-snapshot
Approximating the permanent: A simple approach
inferred← citeshttps://doi.org/10.1002/rsa.70019openalex-snapshot
Triangle Processes on Graphs With Given Degree Sequence
inferred← citeshttps://doi.org/10.1002/sim.3613openalex-snapshot
Respondent‐driven sampling as Markov chain Monte Carlo
inferred← citeshttps://doi.org/10.1006/jagm.1996.0042openalex-snapshot
Generating and Counting Hamilton Cycles in Random Regular Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1997.0917openalex-snapshot
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
inferred← citeshttps://doi.org/10.1006/jcph.1998.6149openalex-snapshot
Approximating the Permanent via Importance Sampling with Application to the Dimer Covering Problem
inferred← citeshttps://doi.org/10.1006/jcss.1998.1576openalex-snapshot
What Do We Know about the Metropolis Algorithm ?
inferred← citeshttps://doi.org/10.1006/jcss.1998.1605openalex-snapshot
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
inferred← citeshttps://doi.org/10.1006/jcss.2000.1711openalex-snapshot
Latent Semantic Indexing: A Probabilistic Analysis
inferred← citeshttps://doi.org/10.1007/11427186_46openalex-snapshot
Almost FPRAS for Lattice Models of Protein Folding
inferred← citeshttps://doi.org/10.1007/11493853_14openalex-snapshot
Multiconsistency and Robustness with Global Constraints
inferred← citeshttps://doi.org/10.1007/11533719_45openalex-snapshot
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
inferred← citeshttps://doi.org/10.1007/11549345_39openalex-snapshot
On the Complexity of Mixed Discriminants and Related Problems
inferred← citeshttps://doi.org/10.1007/11830924_37openalex-snapshot
Randomness-Efficient Sampling Within NC 1
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_38openalex-snapshot
Alternative Algorithms for Counting All Matchings in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_2openalex-snapshot
Problems on RNA Secondary Structure Prediction and Design
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_14openalex-snapshot
Quantum Walks on the Hypercube
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_26openalex-snapshot
An Analysis of Absorbing Times of Quantum Walks
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_75openalex-snapshot
Secure Multiparty Computation of Approximations
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_75openalex-snapshot
Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_49openalex-snapshot
On the random walk method for protocol testing
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_60openalex-snapshot
Communication complexity of key agreement on small ranges
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_15openalex-snapshot
A semidefinite bound for mixing rates of Markov chains
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_165openalex-snapshot
A formal framework for evaluating heuristic programs
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_52openalex-snapshot
Simulated Annealing and its problems to color graphs
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_1openalex-snapshot
Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_713openalex-snapshot
Ultrafast randomized parallel construction and approximation algorithms for spanning forests in dense graphs
inferred← citeshttps://doi.org/10.1007/978-1-4612-0801-3_3openalex-snapshot
Rectangular Arrays with Fixed Margins
inferred← citeshttps://doi.org/10.1007/978-1-4612-0801-3_4openalex-snapshot
Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics
inferred← citeshttps://doi.org/10.1007/978-1-4612-1704-6_1openalex-snapshot
Convergence Rates for Monte Carlo Experiments
inferred← citeshttps://doi.org/10.1007/978-1-4612-2224-8_7openalex-snapshot
Trilogy of Couplings and General Formulas for Lower Bound of Spectral Gap
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_6openalex-snapshot
Ultrafast Randomized Parallel Construction- and Approximation Algorithms for Spanning Forests in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-6594-6_14openalex-snapshot
Combinatorial Optimization, Cross-Entropy, Ants and Rare Events
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_4openalex-snapshot
$$\mathsf {WAPS}$$ : Weighted and Projected Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_23openalex-snapshot
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_54openalex-snapshot
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators
inferred← citeshttps://doi.org/10.1007/978-3-031-76738-8_34openalex-snapshot
Triangle Switches: Irreducibility and Mixing
inferred← citeshttps://doi.org/10.1007/978-3-032-01190-9_6openalex-snapshot
Markov Chain Monte Carlo Methods
inferred← citeshttps://doi.org/10.1007/978-3-0346-0422-2_13openalex-snapshot
Discrete and Continuous: Two Sides of the Same?
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_42openalex-snapshot
A Markov Chain Algorithm for Eulerian Orientations of Planar Triangular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_135openalex-snapshot
The Computational Complexity of Counting
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_33openalex-snapshot
Approximate Counting of Matchings in (3,3)-Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_49openalex-snapshot
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_12openalex-snapshot
Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_1openalex-snapshot
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-67190-1_3openalex-snapshot
Expected Outcomes and Manipulations in Online Fair Division
inferred← citeshttps://doi.org/10.1007/978-3-319-68445-1_87openalex-snapshot
Bounding the Convergence Time of Local Probabilistic Evolution
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_63openalex-snapshot
On Counting Perfect Matchings in General Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_22openalex-snapshot
An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_66openalex-snapshot
Multisampling: A New Approach to Uniform Sampling and Approximate Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_13openalex-snapshot
Probabilistic and Deterministic Approximations of the Permanent
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_11openalex-snapshot
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
inferred← citeshttps://doi.org/10.1007/978-3-540-75488-6_8openalex-snapshot
On Approximating Minimum Infrequent and Maximum Frequent Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_23openalex-snapshot
Some Problems on Approximate Counting in Graphs and Matroids
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_33openalex-snapshot
Approximately Counting Embeddings into Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-95995-3_6openalex-snapshot
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_47openalex-snapshot
The Glauber Dynamics for Colourings of Bounded Degree Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_13openalex-snapshot
Sampling Edge Covers in 3-Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_45openalex-snapshot
Liftings of Tree-Structured Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_12openalex-snapshot
On the Hardness of Counting and Sampling Center Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-19592-1_10openalex-snapshot
Critical Phenomena on Large Graphs with Regular Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19592-1_9openalex-snapshot
When Feedbacks Matter: Epidemics, Synchronization, and Self-regulation in Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_26openalex-snapshot
Bravely, Moderately: A Common Theme in Four Recent Works
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_31openalex-snapshot
Testing Permanent Oracles – Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_17openalex-snapshot
Weighted Counting of k-Matchings Is #W[1]-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-52463-9_2openalex-snapshot
Assessing Convergence of Markov Chain Monte Carlo Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-60744-8_32openalex-snapshot
A Note on the Finite Time Behaviour of Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-3-662-09444-0_4openalex-snapshot
Relaxation Times of Markov Chains in Statistical Mechanics and Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_4openalex-snapshot
Mathematical Foundations of the Markov Chain Monte Carlo Method
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_65openalex-snapshot
FPTAS for Weighted Fibonacci Gates and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_12openalex-snapshot
Generating Graphs Uniformly at Random
inferred← citeshttps://doi.org/10.1007/978-94-011-1691-6_45openalex-snapshot
Relaxation Times for Stochastic Ising Models in the Limit of Vanishing External Field at Fixed Low Temperatures
inferred← citeshttps://doi.org/10.1007/978-94-015-8326-8_17openalex-snapshot
Theorems and Conjectures on the Droplet-Driven Relaxation of Stochastic Ising Models
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_6openalex-snapshot
Some applications of Laplace eigenvalues of graphs
inferred← citeshttps://doi.org/10.1007/b138904openalex-snapshot
Eigenvalues, Inequalities, and Ergodic Theory
inferred← citeshttps://doi.org/10.1007/bf00140871openalex-snapshot
Analysis of the Gibbs sampler for a model related to James-Stein estimators
inferred← citeshttps://doi.org/10.1007/bf01270385openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.1007/bf01294460openalex-snapshot
An analysis of a Monte Carlo algorithm for estimating the permanent
inferred← citeshttps://doi.org/10.1007/bf01582563openalex-snapshot
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bf01940871openalex-snapshot
A mildly exponential approximation algorithm for the permanent
inferred← citeshttps://doi.org/10.1007/bf02099411openalex-snapshot
Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region
inferred← citeshttps://doi.org/10.1007/bf02106789openalex-snapshot
Estimation of spectral gap for Markov chains
inferred← citeshttps://doi.org/10.1007/bf02183743openalex-snapshot
Approximating the number of monomer-dimer coverings of a lattice
inferred← citeshttps://doi.org/10.1007/bf02187060openalex-snapshot
On the two-dimensional dynamical Ising model in the phase coexistence region
inferred← citeshttps://doi.org/10.1007/bf02214660openalex-snapshot
Nash inequalities for finite Markov chains
inferred← citeshttps://doi.org/10.1007/bf02366856openalex-snapshot
Computing the permanent by importance sampling method
inferred← citeshttps://doi.org/10.1007/bf02883046openalex-snapshot
Coupling, spectral gap and related topics (II)
inferred← citeshttps://doi.org/10.1007/bfb0023849openalex-snapshot
Improved bounds for mixing rates of Markov chains and multicommodity flow
inferred← citeshttps://doi.org/10.1007/bfb0032051openalex-snapshot
Polynomial-time approximation algorithms for the ising model
inferred← citeshttps://doi.org/10.1007/bfb0054330openalex-snapshot
Analyzing Glauber dynamics by comparison of Markov chains
inferred← citeshttps://doi.org/10.1007/pl00009316openalex-snapshot
Computing Mixed Discriminants, Mixed Volumes, and Permanents
inferred← citeshttps://doi.org/10.1007/s00026-023-00678-8openalex-snapshot
Approximate Sampling of Graphs with Near-P-Stable Degree Intervals
inferred← citeshttps://doi.org/10.1007/s00037-005-0198-6openalex-snapshot
Compression of Samplable Sources
inferred← citeshttps://doi.org/10.1007/s00037-022-00226-5openalex-snapshot
Zeros and approximations of Holant polynomials on the complex plane
inferred← citeshttps://doi.org/10.1007/s00039-001-8219-3openalex-snapshot
The distance approach to approximate combinatorial counting
inferred← citeshttps://doi.org/10.1007/s00180-014-0506-1openalex-snapshot
Permanents, $$\alpha $$ α -permanents and Sinkhorn balancing
inferred← citeshttps://doi.org/10.1007/s00220-002-0749-5openalex-snapshot
Einstein Relation for a Class of Interface Models
inferred← citeshttps://doi.org/10.1007/s00220-018-3152-6openalex-snapshot
Spectral Gap Estimates in Mean Field Spin Glasses
inferred← citeshttps://doi.org/10.1007/s00220-026-05623-3openalex-snapshot
Pirogov–Sinai Theory for the Hard-Core Model Beyond Lattices
inferred← citeshttps://doi.org/10.1007/s00224-018-9899-5openalex-snapshot
Mixing of Permutations by Biased Transpositions
inferred← citeshttps://doi.org/10.1007/s00373-013-1284-1openalex-snapshot
Uniform Generation of d-Factors in Dense Host Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1457-6openalex-snapshot
Uniform Estimates of Nonlinear Spectral Gaps
inferred← citeshttps://doi.org/10.1007/s00440-004-0369-4openalex-snapshot
Glauber dynamics on trees and hyperbolic graphs
inferred← citeshttps://doi.org/10.1007/s00440-005-0434-7openalex-snapshot
Evolving sets, mixing and heat kernel bounds
inferred← citeshttps://doi.org/10.1007/s00440-009-0222-xopenalex-snapshot
Gibbs rapidly samples colorings of G(n, d/n)
inferred← citeshttps://doi.org/10.1007/s00440-016-0708-2openalex-snapshot
Spatial mixing and the connective constant: optimal bounds
inferred← citeshttps://doi.org/10.1007/s00440-023-01257-xopenalex-snapshot
Geometric bounds on the fastest mixing Markov chain
inferred← citeshttps://doi.org/10.1007/s00440-024-01328-7openalex-snapshot
Metastability cascades and prewetting in the SOS model
inferred← citeshttps://doi.org/10.1007/s004400050231openalex-snapshot
Relations entre isopérimétrie et trou spectral pour les chaînes de Markov finies
inferred← citeshttps://doi.org/10.1007/s00446-021-00409-3openalex-snapshot
Sublinear-time distributed algorithms for detecting small cliques and even cycles
inferred← citeshttps://doi.org/10.1007/s00446-024-00470-8openalex-snapshot
Deterministic Near-Optimal Distributed Listing of Cliques
inferred← citeshttps://doi.org/10.1007/s00446-025-00496-6openalex-snapshot
Narrowing the LOCAL–CONGEST gaps in sparse networks via expander decompositions
inferred← citeshttps://doi.org/10.1007/s00453-001-0072-0openalex-snapshot
A Permanent Algorithm with exp[Ω (n ^{1/3}/2 ln n )] Expected Speedup for 0-1 Matrices
inferred← citeshttps://doi.org/10.1007/s00453-005-1175-9openalex-snapshot
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00453-007-9096-4openalex-snapshot
Random Bichromatic Matchings
inferred← citeshttps://doi.org/10.1007/s00453-015-0025-7openalex-snapshot
Convergence to Equilibrium of Logit Dynamics for Strategic Games
inferred← citeshttps://doi.org/10.1007/s00453-019-00606-4openalex-snapshot
A Fixed-Parameter Perspective on #BIS
inferred← citeshttps://doi.org/10.1007/s00453-021-00805-yopenalex-snapshot
Parameterized Counting of Partially Injective Homomorphisms
inferred← citeshttps://doi.org/10.1007/s00454-001-0083-2openalex-snapshot
A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary
inferred← citeshttps://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferred← citeshttps://doi.org/10.1007/s004930070007openalex-snapshot
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
inferred← citeshttps://doi.org/10.1007/s10114-016-5330-9openalex-snapshot
Logarithmic Sobolev, isoperimetry and transport inequalities on graphs
inferred← citeshttps://doi.org/10.1007/s10955-009-9859-1openalex-snapshot
Censored Glauber Dynamics for the Mean Field Ising Model
inferred← citeshttps://doi.org/10.1007/s10955-013-0855-0openalex-snapshot
Permanental Partition Models and Markovian Gibbs Structures
inferred← citeshttps://doi.org/10.1007/s10955-016-1572-2openalex-snapshot
The Worm Process for the Ising Model is Rapidly Mixing
inferred← citeshttps://doi.org/10.1007/s10955-018-2199-2openalex-snapshot
The Ising Partition Function: Zeros and Deterministic Approximation
inferred← citeshttps://doi.org/10.1007/s10955-019-02433-xopenalex-snapshot
Convergence Time to Equilibrium of the Metropolis Dynamics for the GREM
inferred← citeshttps://doi.org/10.1007/s11118-024-10161-5openalex-snapshot
Heat Kernel Asymptotics for Scaling Limits of Isoradial Graphs
inferred← citeshttps://doi.org/10.1007/s11222-014-9491-zopenalex-snapshot
Monte Carlo algorithms for computing $$\alpha $$ α -permanents
inferred← citeshttps://doi.org/10.1007/s11222-017-9752-8openalex-snapshot
Without-replacement sampling for particle methods on finite state spaces
inferred← citeshttps://doi.org/10.1007/s11856-016-1375-9openalex-snapshot
Matchings in vertex-transitive bipartite graphs
inferred← citeshttps://doi.org/10.1007/s11856-022-2447-7openalex-snapshot
Perfectly packing graphs with bounded degeneracy and many leaves
inferred← citeshttps://doi.org/10.1007/s13278-015-0300-2openalex-snapshot
On the role of conductance, geography and topology in predicting hashtag virality
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0118-iopenalex-snapshot
Expanding and forwarding
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90164-dopenalex-snapshot
Fast uniform generation of regular graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90234-7openalex-snapshot
Approximating the permanent of graphs with large factors
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90293-3openalex-snapshot
Computational complexity of loss networks
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00197-2openalex-snapshot
Récents développements et problèmes dans le domaine de la génération aléatoire
inferred← citeshttps://doi.org/10.1016/0304-4149(95)00082-8openalex-snapshot
Markov chain convergence: From finite to infinite
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90001-ropenalex-snapshot
Simulated annealing: A tool for operational research
inferred← citeshttps://doi.org/10.1016/b0-12-512666-2/00133-4openalex-snapshot
Statistical Mechanics and Combinatorial Problems
inferred← citeshttps://doi.org/10.1016/b978-0-323-95703-8.00124-5openalex-snapshot
Statistical Mechanics and Combinatorial Problems
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50030-0openalex-snapshot
10.1016/b978-044488002-4/50030-0
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50033-6openalex-snapshot
10.1016/b978-044488002-4/50033-6
inferred← citeshttps://doi.org/10.1016/c2011-0-07533-6openalex-snapshot
Numerical Linear Algebra with Applications
inferred← citeshttps://doi.org/10.1016/j.aam.2024.102805openalex-snapshot
Fully graphic degree sequences and P-stable degree sequences
inferred← citeshttps://doi.org/10.1016/j.aam.2026.103047openalex-snapshot
Mixing times of a Burnside process Markov chain on set partitions
inferred← citeshttps://doi.org/10.1016/j.acha.2021.11.004openalex-snapshot
A multiscale environment for learning by diffusion
inferred← citeshttps://doi.org/10.1016/j.akcej.2017.10.001openalex-snapshot
Sampling contingency tables
inferred← citeshttps://doi.org/10.1016/j.amc.2004.11.020openalex-snapshot
A hybrid algorithm for computing permanents of sparse matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2006.07.070openalex-snapshot
Random path method with pivoting for computing permanents of matrices
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2012.03.003openalex-snapshot
Performance metrics in the average consensus problem: A tutorial
inferred← citeshttps://doi.org/10.1016/j.biosystems.2025.105687openalex-snapshot
From Darwin to teleonomy: A categorical final-cause calculus for evolution
inferred← citeshttps://doi.org/10.1016/j.camwa.2015.06.010openalex-snapshot
A two-level method for mimetic finite difference discretizations of elliptic problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100837openalex-snapshot
Parameterised counting complexity theory
inferred← citeshttps://doi.org/10.1016/j.cpc.2004.08.003openalex-snapshot
A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.002openalex-snapshot
Approximately counting paths and cycles in a graph
showing the first 200 of 675 · page through all 675
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.