| Publication | Date of Publication | Type |
|---|
Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity
SIAM Journal on Discrete Mathematics | 2024-11-05 | Paper |
Improved bounds for randomly colouring simple hypergraphs
| 2024-08-22 | Paper |
Localization of scalar field on the brane-world by coupling with gravity
Journal of High Energy Physics | 2024-08-21 | Paper |
The impact of inner-coupling and time delay on synchronization: from single-layer network to hypernetwork
Chaos | 2024-07-10 | Paper |
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
TheoretiCS | 2024-07-03 | Paper |
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
| 2024-05-14 | Paper |
Kink solutions in generalized 2D dilaton gravity
Physics Letters B | 2024-03-12 | Paper |
Rapid mixing from spectral independence beyond the Boolean domain
| 2024-01-15 | Paper |
Rapid Mixing from Spectral Independence beyond the Boolean Domain
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Perfect sampling from spatial mixing
Random Structures \& Algorithms | 2023-10-17 | Paper |
Counting vertices of integral polytopes defined by facets
Discrete \& Computational Geometry | 2023-10-12 | Paper |
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
Information and Computation | 2023-09-27 | Paper |
Near-linear time samplers for matroid independent sets with applications
| 2023-08-18 | Paper |
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime
Journal of the ACM | 2022-12-08 | Paper |
Towards derandomising Markov chain Monte Carlo
| 2022-11-07 | Paper |
Counting solutions to random CNF formulas
SIAM Journal on Computing | 2022-08-17 | Paper |
FKT is not universal -- a planar holant dichotomy for symmetric constraints
Theory of Computing Systems | 2022-02-14 | Paper |
Improved bounds for randomly colouring simple hypergraphs
| 2022-02-11 | Paper |
Zeros of Holant Problems
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Quantitative photoacoustic imaging of chlorophyll using a GPU-accelerated finite element method
Communications in Computational Physics | 2021-11-02 | Paper |
Kaluza-Klein modes of \(U(1)\) gauge vector field on brane with codimension-\(d\)
Physics Letters B | 2021-09-24 | Paper |
Perfect simulation of the hard disks model by partial rejection sampling
| 2021-07-28 | Paper |
scientific article; zbMATH DE number 7375995 (Why is no real title available?)
| 2021-07-28 | Paper |
Approximately counting bases of bicircular matroids
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
On the Complexity of Holant Problems
| 2021-06-15 | Paper |
Perfect simulation of the hard disks model by partial rejection sampling
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) | 2021-06-09 | Paper |
Modified log-Sobolev inequalities for strongly log-concave distributions
The Annals of Probability | 2021-02-15 | Paper |
Zeros of ferromagnetic 2-spin systems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Fast sampling and counting 𝑘-SAT solutions in the local lemma regime
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Local-to-Global Contraction in Simplicial Complexes
| 2020-12-28 | Paper |
Tight bounds for popping algorithms
Random Structures \& Algorithms | 2020-11-30 | Paper |
Uniqueness, spatial mixing, and approximation for ferromagnetic 2-spin systems
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
The complexity of planar Boolean \#CSP with complex weights
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Uniform sampling through the Lovász local lemma
Journal of the ACM | 2019-11-21 | Paper |
Zeros of Holant problems: locations and algorithms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
SIAM Journal on Computing | 2019-09-02 | Paper |
Counting hypergraph colorings in the local lemma regime
SIAM Journal on Computing | 2019-09-02 | Paper |
Counting hypergraph colourings in the local lemma regime
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
scientific article; zbMATH DE number 7075923 (Why is no real title available?)
| 2019-07-03 | Paper |
Approximation via Correlation Decay When Strong Spatial Mixing Fails
SIAM Journal on Computing | 2019-05-07 | Paper |
Joint Video Stitching and Stabilization From Moving Cameras
IEEE Transactions on Image Processing | 2019-02-04 | Paper |
Clifford gates in the Holant framework
Theoretical Computer Science | 2018-09-24 | Paper |
Random cluster dynamics for the Ising model is rapidly mixing
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Random cluster dynamics for the Ising model is rapidly mixing
The Annals of Applied Probability | 2018-06-29 | Paper |
The oscillatory boundary conditions of different frequency bands in Parkinson's disease
Journal of Theoretical Biology | 2018-06-15 | Paper |
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
| 2018-04-19 | Paper |
Holographic algorithms beyond matchgates
Information and Computation | 2018-03-21 | Paper |
Localization of \(q\)-form fields on \(\mathrm{AdS}_{p + 1}\) branes
Physics Letters B | 2018-02-19 | Paper |
Approximation via correlation decay when strong spatial mixing fails
| 2017-12-19 | Paper |
The complexity of approximating complex-valued Ising and Tutte partition functions
Computational Complexity | 2017-12-18 | Paper |
Uniform sampling through the Lovász local lemma
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Spectrum structure of a fermion on Bloch branes with two scalar-fermion couplings
Classical and Quantum Gravity | 2017-08-14 | Paper |
\#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
| 2017-03-22 | Paper |
Non-minimal coupling branes
Journal of High Energy Physics | 2016-11-07 | Paper |
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
Research in the Mathematical Sciences | 2016-09-09 | Paper |
A complete dichotomy rises from the capture of vanishing signatures
SIAM Journal on Computing | 2016-09-02 | Paper |
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Journal of Computer and System Sciences | 2016-04-18 | Paper |
A complete dichotomy rises from the capture of vanishing signatures (extended abstract)
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Holographic algorithms beyond matchgates
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Localization of matters on Anti-de Sitter thick branes
Journal of High Energy Physics | 2013-08-27 | Paper |
The complexity of planar Boolean \(\#\)CSP with complex weights
Lecture Notes in Computer Science | 2013-08-06 | Paper |
The complexity of symmetric Boolean parity Holant problems
SIAM Journal on Computing | 2013-07-04 | Paper |
Inapproximability after uniqueness phase transition in two-spin systems
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
The complexity of weighted Boolean \#CSP modulo \(k\)
| 2012-01-23 | Paper |
The complexity of symmetric Boolean parity Holant problems (extended abstract)
Automata, Languages and Programming | 2011-07-06 | Paper |
Knotted Solitons in an Interacting Mixture of a Charged and a Neutral Superfluid for Neutron Stars
Communications in Theoretical Physics | 2010-01-26 | Paper |
On Model Checking Boolean BI
Computer Science Logic | 2009-11-12 | Paper |
Analysis of gradient descent learning algorithms for multilayer feedforward neural networks
IEEE Transactions on Circuits and Systems | 1992-06-28 | Paper |
