Clifford D. Smyth

Jeff Kahn, Michael Saks, Clifford D. Smyth: The Dual BKR Inequality and Rudich's Conjecture. Combinatorics, Probability & Computing 20(2): 257-266 (2011)

Daniel W. Cranston, Clifford D. Smyth, Douglas B. West: Revolutionaries and spies on trees and unicyclic graphs. CoRR abs/1110.2274 (2011)

Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth: Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100(3): 299-312 (2010)

József Balogh, Clifford D. Smyth: On the variance of Shannon products of graphs. Discrete Applied Mathematics 156(1): 110-118 (2008)

Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky: First-Order Definability of Trees and Sparse Random Graphs. Combinatorics, Probability & Computing 16(3): 375-400 (2007)

Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth: On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Combinatorics, Probability & Computing 16(5): 733-746 (2007)

Alan M. Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth: Codes identifying sets of vertices in random networks. Discrete Mathematics 307(9-10): 1094-1107 (2007)

Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Clifford D. Smyth: Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007)

Irit Dinur, Oded Regev, Clifford D. Smyth: The Hardness of 3-Uniform Hypergraph Coloring. Combinatorica 25(5): 519-535 (2005)

József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long Monotone Paths in Line Arrangements. Discrete & Computational Geometry 32(2): 167-176 (2004)

József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long monotone paths in line arrangements. Symposium on Computational Geometry 2003: 124-128

Irit Dinur, Oded Regev, Clifford D. Smyth: The Hardness of 3 - Uniform Hypergraph Coloring. FOCS 2002: 33-

Clifford D. Smyth: Reimer's inequality and tardos' conjecture. STOC 2002: 218-221

Jeff Kahn, Michael E. Saks, Clifford D. Smyth: A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. IEEE Conference on Computational Complexity 2000: 98-103