Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hara, Takashi
Slade, Gordon
and
Sokal, Alan D.
1993.
New lower bounds on the self-avoiding-walk connective constant.
Journal of Statistical Physics,
Vol. 72,
Issue. 3-4,
p.
479.
Slade, Gordon
1994.
Self-avoiding walks.
The Mathematical Intelligencer,
Vol. 16,
Issue. 1,
p.
29.
Slade, Gordon
1995.
Proceedings of the International Congress of Mathematicians.
p.
1315.
Hara, Takashi
and
Slade, Gordon
1995.
The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions.
Combinatorics, Probability and Computing,
Vol. 4,
Issue. 3,
p.
197.
Balister, Paul
Bollob�s, B�la
and
Stacey, Alan
1999.
Counting Boundary Paths for Oriented Percolation Clusters.
Random Structures and Algorithms,
Vol. 14,
Issue. 1,
p.
1.
Finch, Steven R.
1999.
Several constants arising in statistical mechanics.
Annals of Combinatorics,
Vol. 3,
Issue. 2-4,
p.
323.
MacDonald, D
Joseph, S
Hunter, D L
Moseley, L L
Jan, N
and
Guttmann, A J
2000.
Self-avoiding walks on the simple cubic lattice.
Journal of Physics A: Mathematical and General,
Vol. 33,
Issue. 34,
p.
5973.
Randall, Dana
and
Sinclair, Alistair
2000.
Self-testing algorithms for self-avoiding walks.
Journal of Mathematical Physics,
Vol. 41,
Issue. 3,
p.
1570.
Jensen, Iwan
2004.
Improved lower bounds on the connective constants for two-dimensional self-avoiding walks.
Journal of Physics A: Mathematical and General,
Vol. 37,
Issue. 48,
p.
11521.
Alm, S E
and
Parviainen, R
2004.
Bounds for the connective constant of the hexagonal lattice.
Journal of Physics A: Mathematical and General,
Vol. 37,
Issue. 3,
p.
549.
Alm, Sven Erick
2005.
Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices.
Journal of Physics A: Mathematical and General,
Vol. 38,
Issue. 10,
p.
2055.
Restrepo, Ricardo
Shin, Jinwoo
Tetali, Prasad
Vigoda, Eric
and
Yang, Linji
2011.
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets.
p.
140.
Blanca, Antonio
Galvin, David
Randall, Dana
and
Tetali, Prasad
2013.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 8096,
Issue. ,
p.
379.
Sinclair, Alistair
Srivastava, Piyush
and
Yin, Yitong
2013.
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant.
p.
300.
Restrepo, Ricardo
Shin, Jinwoo
Tetali, Prasad
Vigoda, Eric
and
Yang, Linji
2013.
Improved mixing condition on the grid for counting and sampling independent sets.
Probability Theory and Related Fields,
Vol. 156,
Issue. 1-2,
p.
75.
Padmanabhan, A. S.
and
Jacob, Susamma
2014.
Self avoiding walk trees and laces.
Journal of Mathematical Chemistry,
Vol. 52,
Issue. 2,
p.
627.
Abért, Miklós
Csikvári, Péter
and
Hubai, Tamás
2015.
Matching Measure, Benjamini–Schramm Convergence and the Monomer–Dimer Free Energy.
Journal of Statistical Physics,
Vol. 161,
Issue. 1,
p.
16.
Sinclair, Alistair
Srivastava, Piyush
Štefankovič, Daniel
and
Yin, Yitong
2017.
Spatial mixing and the connective constant: optimal bounds.
Probability Theory and Related Fields,
Vol. 168,
Issue. 1-2,
p.
153.
BLANCA, ANTONIO
CHEN, YUXUAN
GALVIN, DAVID
RANDALL, DANA
and
TETALI, PRASAD
2019.
Phase Coexistence for the Hard-Core Model on ℤ2.
Combinatorics, Probability and Computing,
Vol. 28,
Issue. 1,
p.
1.
Slade, Gordon
2020.
The Journal of Fourier Analysis and Applications.
p.
525.