Clifford D. Smyth

Publication Activity (10 Years)

Years Active: 2000-2021
Publications (10 Years): 2

Top Topics

Image Processing

Bayesian Networks

Top Venues

Publications

Parker B. Edwards, Jonathan D. Hauenstein, Clifford D. Smyth
Certified evaluations of Hölder continuous functions at roots of polynomials. CoRR (2021)
Parker B. Edwards, Jonathan D. Hauenstein, Clifford D. Smyth
Certified Evaluations of Hölder Continuous Functions at Roots of Polynomials. MC (2020)
Jeff Kahn, Michael E. Saks, Clifford D. Smyth
The Dual BKR Inequality and Rudich's Conjecture. Comb. Probab. Comput. 20 (2) (2011)
Daniel W. Cranston, Clifford D. Smyth, Douglas B. West
Revolutionaries and spies on trees and unicyclic graphs CoRR (2011)
Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth
Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100 (3) (2010)
József Balogh, Clifford D. Smyth
On the variance of Shannon products of graphs. Discret. Appl. Math. 156 (1) (2008)
Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 16 (5) (2007)
Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Clifford D. Smyth
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30 (1-2) (2007)
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. Comb. Probab. Comput. 16 (3) (2007)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Codes identifying sets of vertices in random networks. Discret. Math. 307 (9-10) (2007)
Irit Dinur, Oded Regev, Clifford D. Smyth
The Hardness of 3-Uniform Hypergraph Coloring. Comb. 25 (5) (2005)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Identifying codes in random networks. ISIT (2005)
József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
Long Monotone Paths in Line Arrangements. Discret. Comput. Geom. 32 (2) (2004)
József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
Long monotone paths in line arrangements. SCG (2003)
Irit Dinur, Oded Regev, Clifford D. Smyth
The Hardness of 3 - Uniform Hypergraph Coloring. FOCS (2002)
Clifford D. Smyth
Reimer's inequality and tardos' conjecture. STOC (2002)
Jeff Kahn, Michael E. Saks, Clifford D. Smyth
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. Computational Complexity Conference (2000)