On the Stability of the Ethernet - Jonathan Goodman; Albert G. Greenberg; Neal Madras; Peter March (STOC, 1985)

Stability of binary exponential backoff. - Jonathan Goodman; Albert G. Greenberg; Neal Madras; Peter March (J. ACM, 1988)

Monte-Carlo Approximation Algorithms for Enumeration Problems. - Richard M. Karp; Michael Luby; Neal Madras (J. Algorithms, 1989)

Comparison of a Fair Queueing Discipline to Processor Sharing. - Albert G. Greenberg; Neal Madras (Performance, 1990)

How Fair is Fair Queuing? - Albert G. Greenberg; Neal Madras (J. ACM, 1992)

Factoring Graphs to Bound Mixing Rates. - Neal Madras; Dana Randall (FOCS, 1996)

On the swapping algorithm. - Neal Madras; Zhongrong Zheng (Random Struct. Algorithms, 2003)

Self-Avoiding Walks on Hyperbolic Graphs. - Neal Madras; C. Chris Wu (Comb. Probab. Comput., 2005)

Strong Limit Theorems for the Bayesian Scoring Criterion in Bayesian Networks. - Nikolai Slobodianik; Dmitry Yu. Zaporozhets; Neal Madras (J. Mach. Learn. Res., 2009)

Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations. - Mahshid Atapour; Neal Madras (Comb. Probab. Comput., 2014)

Large Deviations for Permutations Avoiding Monotone Patterns. - Neal Madras; Lerna Pehlivan (Electron. J. Comb., 2016)

Structure of random 312-avoiding permutations. - Neal Madras; Lerna Pehlivan (Random Struct. Algorithms, 2016)

Longest Monotone Subsequences and Rare Regions of Pattern-Avoiding Permutations. - Neal Madras; Gökhan Yildirim (Electron. J. Comb., 2017)

Bounded affine permutations I. Pattern avoidance and enumeration. - Neal Madras; Justin M. Troyka (Discret. Math. Theor. Comput. Sci., 2021)

On Totally-Concave Polyominoes. - Gill Barequet; Noga Keren; Neal Madras; Johann Peters; Adi Rivkin (CCCG, 2024)

Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem. - Sooyeong Kim; Neal Madras; Ada Chan; Mark Kempton; Stephen Kirkland; Adam Knudson (Discret. Appl. Math., 2026)