UB Paderborn / Katalog / Suche / in CDI

Storage capacity in symmetric binary perceptrons

Journal of physics. A, Mathematical and theoretical, 2019-06, Vol.52 (29), p.294003

2019

Volltextzugriff (PDF)

Birthday inequalities, repulsion, and hard spheres

Proceedings of the American Mathematical Society, 2016-06, Vol.144 (6), p.2635-2649

Perkins, Will

2016

Volltextzugriff (PDF)

On the average size of independent sets in triangle-free graphs

Proceedings of the American Mathematical Society, 2018-01, Vol.146 (1), p.111-124

2018

Volltextzugriff (PDF)

ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS

Forum of mathematics. Sigma, 2019, Vol.7, Article e1

2019

Volltextzugriff (PDF)

Independent sets in the hypercube revisited

Journal of the London Mathematical Society, 2020-10, Vol.102 (2), p.645-669

2020

Volltextzugriff (PDF)

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs

SIAM journal on computing, 2023-04, Vol.52 (2), p.618-640

2023

Volltextzugriff (PDF)

Frozen 1‐RSB structure of the symmetric Ising perceptron

Random structures & algorithms, 2024-07, Vol.64 (4), p.856-877

2024

Volltextzugriff (PDF)

Algorithms for #BIS-Hard Problems on Expander Graphs

SIAM journal on computing, 2020-01, Vol.49 (4), p.681-710

2020

Volltextzugriff (PDF)

Frozen 1-RSB structure of the symmetric Ising perceptron

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.1579-1588

2021

Volltextzugriff (PDF)

On the Complexity of Random Satisfiability Problems with Planted Solutions

SIAM journal on computing, 2018-01, Vol.47 (4), p.1294-1338

2018

Volltextzugriff (PDF)

Analyticity for Classical Gasses via Recursion

Communications in mathematical physics, 2023-04, Vol.399 (1), p.367-388

2023

Volltextzugriff (PDF)

Approximately counting independent sets in bipartite graphs via graph containers

Random structures & algorithms, 2023-08, Vol.63 (1), p.215-241

2023

Volltextzugriff (PDF)

Random k-SAT and the power of two choices

Random structures & algorithms, 2015-08, Vol.47 (1), p.163-173

Perkins, Will

2015

Volltextzugriff (PDF)

Strong Spatial Mixing for Repulsive Point Processes

Journal of statistical physics, 2022-10, Vol.189 (1), Article 9

2022

Volltextzugriff (PDF)

Correlation decay for hard spheres via Markov chains

The Annals of applied probability, 2022-06, Vol.32 (3)

2022

Volltextzugriff (PDF)

Algorithmic Pirogov–Sinai theory

Probability theory and related fields, 2020-04, Vol.176 (3-4), p.851-895

2020

Volltextzugriff (PDF)

A proof of the upper matching conjecture for large graphs

Journal of combinatorial theory. Series B, 2021-11, Vol.151, p.393-416

2021

Volltextzugriff (PDF)

Fast and Perfect Sampling of Subgraphs and Polymer Systems

ACM transactions on algorithms, 2024-01, Vol.20 (1), p.1-30, Article 5

2024

Volltextzugriff (PDF)

Spin Systems on Bethe Lattices

Communications in mathematical physics, 2019-12, Vol.372 (2), p.441-523

2019

Volltextzugriff (PDF)

Algorithmic Pirogov-Sinai theory

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, p.1009-1020

2019

Volltextzugriff (PDF)

Large deviations for the empirical distribution in the branching random walk

Electronic journal of probability, 2015-02, Vol.20 (none)

2015

Volltextzugriff (PDF)

Bethe States of Random Factor Graphs

Communications in mathematical physics, 2019-02, Vol.366 (1), p.173-201

2019

Volltextzugriff (PDF)

Fast algorithms at low temperatures via Markov chains

Random structures & algorithms, 2021-03, Vol.58 (2), p.294-321

2021

Volltextzugriff (PDF)

Counting independent sets in cubic graphs of given girth

Journal of combinatorial theory. Series B, 2018-11, Vol.133, p.211-242

2018

Volltextzugriff (PDF)

Efficient sampling and counting algorithms for the Potts model on ℤ d at all temperatures

Random structures & algorithms, 2023-08, Vol.63 (1), p.130-170

2023

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Storage capacity in symmetric binary perceptrons

Birthday inequalities, repulsion, and hard spheres

On the average size of independent sets in triangle-free graphs

ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS

Independent sets in the hypercube revisited

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs

Frozen 1‐RSB structure of the symmetric Ising perceptron

Algorithms for #BIS-Hard Problems on Expander Graphs

Frozen 1-RSB structure of the symmetric Ising perceptron

On the Complexity of Random Satisfiability Problems with Planted Solutions

Analyticity for Classical Gasses via Recursion

Approximately counting independent sets in bipartite graphs via graph containers

Random k-SAT and the power of two choices

Strong Spatial Mixing for Repulsive Point Processes

Correlation decay for hard spheres via Markov chains

Algorithmic Pirogov–Sinai theory

A proof of the upper matching conjecture for large graphs

Fast and Perfect Sampling of Subgraphs and Polymer Systems

Spin Systems on Bethe Lattices

Algorithmic Pirogov-Sinai theory

Large deviations for the empirical distribution in the branching random walk

Bethe States of Random Factor Graphs

Fast algorithms at low temperatures via Markov chains

Counting independent sets in cubic graphs of given girth

Efficient sampling and counting algorithms for the Potts model on ℤ d at all temperatures

Aktive Filter

Suchergebnisse filtern