A characterization of competition graphs of arbitrary digraphs. - Fred S. Roberts; Jeffrey E. Steif (Discret. Appl. Math., 1983)

The frame dimension and the complete overlap dimension of a graph. - Jeffrey E. Steif (J. Graph Theory, 1985)

Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields. - Olle Häggström; Jeffrey E. Steif (Comb. Probab. Comput., 2000)

Probability on Discrete Structures, edited by H. Kesten. - Jeffrey E. Steif (Comb. Probab. Comput., 2005)

Lectures on noise sensitivity and percolation - Christophe Garban; Jeffrey E. Steif (CoRR, 2011)

Noise Sensitivity and Stability of Deep Neural Networks for Binary Classification. - Johan Jonasson; Jeffrey E. Steif; Olof Zetterqvist (CoRR, 2023)

A study of distributional complexity measures for Boolean functions. - Laurin Köhler-Schindler; Jeffrey E. Steif (CoRR, 2024)