A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. - Jeff Kahn 001; Michael E. Saks; Cliff Smyth 001 (CCC, 2000)

Reimer's inequality and tardos' conjecture. - Clifford D. Smyth (STOC, 2002)

Long Monotone Paths in Line Arrangements. - József Balogh; Oded Regev 001; Clifford D. Smyth; William L. Steiger; Mario Szegedy (Discret. Comput. Geom., 2004)

Identifying codes in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (ISIT, 2005)

The Hardness of 3-Uniform Hypergraph Coloring. - Irit Dinur; Oded Regev 001; Clifford D. Smyth (Comb., 2005)

First-Order Definability of Trees and Sparse Random Graphs. - Tom Bohman; Alan M. Frieze; Tomasz Luczak 001; Oleg Pikhurko; Clifford D. Smyth; Joel Spencer; Oleg Verbitsky 001 (Comb. Probab. Comput., 2007)

On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. - Alan M. Frieze; Michael Krivelevich; Cliff Smyth 001 (Comb. Probab. Comput., 2007)

Codes identifying sets of vertices in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (Discret. Math., 2007)

Some results in polychromatic Ramsey theory. - Uri Abraham; James Cummings 001; Clifford D. Smyth (J. Symb. Log., 2007)

Randomly generated intersecting hypergraphs II. - Tom Bohman; Alan M. Frieze; Ryan R. Martin; Miklós Ruszinkó; Cliff Smyth 001 (Random Struct. Algorithms, 2007)

On the variance of Shannon products of graphs. - József Balogh; Clifford D. Smyth (Discret. Appl. Math., 2008)

Anti-Ramsey properties of random graphs. - Tom Bohman; Alan M. Frieze; Oleg Pikhurko; Cliff Smyth 001 (J. Comb. Theory B, 2010)

Revolutionaries and spies on trees and unicyclic graphs - Daniel W. Cranston; Clifford D. Smyth; Douglas B. West (CoRR, 2011)

The Dual BKR Inequality and Rudich's Conjecture. - Jeff Kahn 001; Michael E. Saks; Clifford D. Smyth (Comb. Probab. Comput., 2011)

Enumeration of non-crossing pairings on bit strings. - Todd Kemp; Karl Mahlburg; Amarpreet Rattan; Clifford D. Smyth (J. Comb. Theory A, 2011)

Approximate Query Complexity. - Clifford D. Smyth (ACM Trans. Comput. Theory, 2011)

Revolutionaries and Spies. - David M. Howard 002; Clifford D. Smyth (Discret. Math., 2012)

Symmetric Polynomials and Symmetric Mean Inequalities. - Karl Mahlburg; Clifford D. Smyth (Electron. J. Comb., 2013)

Reimer's Inequality on a Finite Distributive Lattice. - Clifford D. Smyth (Comb. Probab. Comput., 2013)

Topological approaches to skin disease image analysis. - Yu-Min Chung 002; Chuan-Shen Hu; Austin Lawson; Clifford D. Smyth (IEEE BigData, 2018)

A Probabilistic Characterization of the Dominance Order on Partitions. - Clifford D. Smyth (Order, 2018)

TopoResNet: A hybrid deep learning architecture and its application to skin lesion classification. - Yu-Min Chung 002; Chuan-Shen Hu; Austin Lawson; Clifford D. Smyth (CoRR, 2019)

Restricted Stirling and Lah number matrices and their inverses. - John Engbers; David J. Galvin; Cliff Smyth 001 (J. Comb. Theory A, 2019)

Certified Evaluations of Hölder Continuous Functions at Roots of Polynomials. - Parker B. Edwards; Jonathan D. Hauenstein; Clifford D. Smyth (MC, 2020)

The Noncrossing Bond Poset of a Graph. - C. Matthew Farmer; Joshua Hallam; Clifford D. Smyth (Electron. J. Comb., 2020)

On a rank-unimodality conjecture of Morier-Genoud and Ovsienko. - Thomas McConville; Bruce E. Sagan; Clifford D. Smyth (Discret. Math., 2021)

Reciprocals of thinned exponential series. - John Engbers; David J. Galvin; Cliff Smyth 001 (Australas. J Comb., 2024)