Memory capacity in neural network models: Rigorous lower bounds. - Charles M. Newman (Neural Networks, 1988)

Chain Lengths in Certain Random Directed Graphs. - Charles M. Newman (Random Struct. Algorithms, 1992)

Scaling limits for minimal and random spanning trees in two dimensions. - Michael Aizenman; Almut Burchard; Charles M. Newman; David Bruce Wilson (Random Struct. Algorithms, 1999)

Random nearest neighbor and influence graphs on Zd. - S. Nanda; Charles M. Newman (Random Struct. Algorithms, 1999)

Spin Glasses: Old and New Complexity. - Daniel L. Stein; Charles M. Newman (Complex Syst., 2011)

Absence of site percolation at criticality in ℤ2×{0, 1}. - Michael Damron; Charles M. Newman; Vladas Sidoravicius (Random Struct. Algorithms, 2015)